The 75-question core interview path, grouped by the source topic order and tracked with Bugl progress.
0/75
22
Work through the published Array / String problems in order.
Work through the published Two Pointers problems in order.
Work through the published Sliding Window problems in order.
Work through the published Prefix Sum problems in order.
Work through the published Hash Map / Set problems in order.
Work through the published Stack problems in order.
Work through the published Queue problems in order.
Work through the published Linked List problems in order.
Work through the published Binary Tree - DFS problems in order.
Work through the published Binary Tree - BFS problems in order.
Work through the published Binary Search Tree problems in order.
Work through the published Graphs - DFS problems in order.
Work through the published Graphs - BFS problems in order.
Work through the published Heap / Priority Queue problems in order.
Work through the published Binary Search problems in order.
Work through the published Backtracking problems in order.
Work through the published DP - 1D problems in order.
Work through the published DP - Multidimensional problems in order.
Work through the published Bit Manipulation problems in order.
Work through the published Trie problems in order.
Work through the published Intervals problems in order.
Work through the published Monotonic Stack problems in order.