Show newer

@Absinthe

The code isn't that bad, you just have to be careful you don't go down a dead end with your algorithm. It's much easier to add error checking etc. at the end if you designed a versatile solution than it is to try and generalise one of the more brittle ones.

Would you mind if I suggested a challenge? I have one involving graph manipulation, which is kind of up @freemo's alley.

@khird @freemo It is pretty well cleaned up now. and I fleshed out the list a little to make it iterable and printable and stuff. Take a peek!

Please suggest one, just remember to include the hash tag

Our is decolonial

openhardware.science/gosh-manifesto

@david what happens if you loose access or delete your old email address then?

Was just looking at the new listing on joinmastodon.org

Looks like other than mastodon.social we are the largest English speaking instance listed. Kinda cool.

Just wnt to update everyone. I just heard back from @Gargron@tooting.ai / @Gargron@mastodon.social and our server submission request on joinmastodon.org has been resolved. is now listed on the official server list.

I much appreciate Gargron taking the time to address the back log and it was handled very fairly and respectfully it seemed.

As you know they did ask if our server protected people in the trans-community, I think that is an amazing goal to have so I dont mind the question. Luckily our history of mutual respect for all people and all groups made the case for us I hope.

Thank you again Gargron for the amazing work you do.

@sociallyeleanor@mastodon.social

Freebie!! Here you go!
This problem was asked by Facebook.

A builder is looking to build a row of N houses that can be of K different colors. He has a goal of minimizing cost while ensuring that no two neighboring houses are of the same color.

Given an N by K matrix where the nth row and kth column represents the cost to build the nth house with kth color, return the minimum cost which achieves this goal.

Second Freebie!!! This one is marked as "easy"

This problem was asked by Google.

Given two singly linked lists that intersect at some point, find the intersecting node. The lists are non-cyclical.

For example, given A = 3 -> 7 -> 8 -> 10 and B = 99 -> 1 -> 8 -> 10, return the node with value 8.

In this example, assume nodes with the same value are the exact same node objects.

Do this in O(M + N) time (where M and N are the lengths of the lists) and constant space.

@inverness01

Actually i explicitly stated twice that he wasnt high intelligence, just intelligent (in today society moderate intelligence is the exception).

If you feel there is a video that shows anywhere near the lack of intelligence that Trump presents regularly by all means feel free to share.

@MarcusJ65 @vince @ThomasWic

Show older
CleverLibre Social

CleverLibre Social is an inclusive social instance for open discussion, learning, and community.
All cultures welcome.
Hate speech and harassment strictly forbidden.