Ask HN: How can I prepare for a coding interview in a week?
I&#x27;m in a similar situation RN, and this is my battle plan:<p>𝗗𝗮𝘆 01<p>* Backtracking - know how to solve 1 problem (Knight&#x27;s tour)<p>* Tree - implement BST<p>* Tree traversal - implement DFS, BFS &amp; DFS iterative<p>𝗗𝗮𝘆 02<p>* Quicksort - know how to implement<p>* Mergesort - know how to implement<p>* Binary search - know how to implement<p>* Min&#x2F;Max Heap (priority queue) - know how to implement<p>𝗗𝗮𝘆 03<p>* Graph - implement adjacency list<p>* Graph traversal - implement DFS, BFS &amp; DFS iterative<p>* Graph algo - implement &quot;Prim Minimum Spanning Tree&quot;<p>* Graph algo - Implement &quot;Detect Cycles algo&quot;<p>𝗗𝗮𝘆 04<p>* Graph algo - Implement &quot;Detect Connected Components&quot; algo<p>* Graph algo - Implement &quot;Lowest Common Ancestor&quot; algo<p>* Graph algo - Implement Djikstra single shortest path algo<p>𝗗𝗮𝘆 05<p>* Sets - Determine all subsets of a set<p>* Sets - Determine Maximum consecutive subarray sum<p>* Sets - Determine 2 sets intersection<p>𝗗𝗮𝘆 06<p>* String - Implement Levensthein Edit distance<p>* String - Implement Polynomial Hash<p>* String - Determine all substrings<p>* String - Find anagrams<p>𝗗𝗮𝘆 07<p>* String - Implement KNP algorithm for pattern matching<p>* Basic DS - Implement Queue, Stack, Dynamic array, Linked list absolutely cold<p>----<p>I chose javascript as the language for all this brushing up (no need to manage memory, and I can focus on the algo)<p>It&#x27;s a big list, but it&#x27;s a traversal of the CS engineering domain that makes sense to me, and it&#x27;s only a fraction of the expected knowledge for that kind of interview.<p>----<p>Edit: I pushed some of the code of this list on GH here: <a href="https:&#x2F;&#x2F;github.com&#x2F;netgusto&#x2F;brushup" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;netgusto&#x2F;brushup</a><p>I struggle to implement each concept in the smallest, simplest  way possible. I&#x27;ll keep adding code as I write it.