Top Interview 150 in C

a book through the LeetCode study plan

Chapter 1 is the toolbox: the data structures that every problem in the plan is built on. Each chapter after it is one topic of Top Interview 150, in the same order, with the idea, the code and the cost of every solution. Every example is in C, so nothing is hidden in a magic box: you see every allocation, pointer and copy.

Contents

  1. 1Data Structuresintroduction
  2. 2Array / String24 problems · soon
  3. 3Two Pointers5 problems · soon
  4. 4Sliding Window4 problems · soon
  5. 5Matrix5 problems · soon
  6. 6Hashmap9 problems · soon
  7. 7Intervals4 problems · soon
  8. 8Stack5 problems · soon
  9. 9Linked List11 problems · soon
  10. 10Binary Tree General14 problems · soon
  11. 11Binary Tree BFS4 problems · soon
  12. 12Binary Search Tree3 problems · soon
  13. 13Graph General6 problems · soon
  14. 14Graph BFS3 problems · soon
  15. 15Trie3 problems · soon
  16. 16Backtracking7 problems · soon
  17. 17Divide & Conquer4 problems · soon
  18. 18Kadane's Algorithm2 problems · soon
  19. 19Binary Search7 problems · soon
  20. 20Heap4 problems · soon
  21. 21Bit Manipulation6 problems · soon
  22. 22Math6 problems · soon
  23. 231D DP5 problems · soon
  24. 24Multidimensional DP9 problems · soon

Want to watch the structures move? See jrzayev/dsa-visual-c, colorful terminal animations in C.