idkburkes

Software Engineer Interview Prep for the top tech companies. Arrays, Strings, Tries, Bit manipulation, Dynamic Programming(memoization & tabulation), Graphs, Linked-Lists, Matrices, Trees, Heaps, Hashmaps, Recursion. Graph Algorithms: Depth-first search, Breadth-first search, Cycle Detection, Djikstra’s Algorithm, Bellman Ford Algorithm, Minimum Spanning Tree (Prim’s Algorithm & Kruskal’s Algorithm), A* Shortest Path Algorithm. Sorting Algorithms: Insertion sort, Merge sort, Quick sort, Heap sort, Radix Sort,