30DaysCoding.
com
150 Questions: Data structures
Solve and understand these questions, make notes, watch solutions, and have fun. Don’t just
solve them to get a job, but to learn something new! These are mostly internship-level
questions (easy-medium), but will help you in general with problem solving!
Arrays
Easy
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Medium
- [Link]
- [Link]
- [Link]
/
- [Link]
- [Link]
- [Link]
[Link]
Linked list
Easy
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Medium
- [Link]
- [Link]
- [Link]
- [Link]
Binary search
Easy
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Medium
- [Link]
- [Link]
/
- [Link]
- [Link]
- [Link]
[Link]
Sliding window
Read
- Leetcode Pattern 2 | Sliding Windows for Strings | by csgator | Leetcode Patterns
Easy/Medium
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
2 pointers
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Stacks, Queues
- Easy
- [Link]
- [Link]
- [Link]
- Medium
- [Link]
- [Link]
[Link]
- [Link]
- [Link]
- [Link]
BFS, DFS
Read
- Leetcode Pattern 1 | BFS + DFS == 25% of the problems — part 1
- Leetcode Pattern 1 | DFS + BFS == 25% of the problems — part 2
Questions
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Recursion
Easy
- 509. Fibonacci Number
- Reverse String
[Link]
- 24. Swap Nodes in Pairs
- 206. Reverse Linked List
- Leetcode #700 Search in a Binary Search Tree
- 70. Climbing Stairs
- Leetcode #50 Pow(x, n)
Backtracking
Read
- Leetcode Pattern 3 | Backtracking | by csgator | Leetcode Patterns
- A general approach to backtracking questions in Java (Subsets, Permutations,
Combination Sum, Palindrome Partitioning)
Easy
- Word Search
- Leetcode #78 Subsets
- 90. Subsets II
- Letter Case Permutation
Medium
- 39. Combination Sum
- 17. Letter Combinations of a Phone Number
- Combinations
- Leetcode : Combination Sum II
- 216. Combination Sum III
- Combination Sum IV
- 46. Permutations
- 47. Permutations II
- 31. Next Permutation
- 51. N-Queens
[Link]
Trees
Read
- Leetcode Pattern 0 | Iterative traversals on Trees | by csgator | Leetcode Patterns
Easy
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- Medium
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Dynamic programming
Easy
- [Link]
[Link]
- [Link]
- [Link]
- [Link]
- [Link]
Medium
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Graphs
Easy
- [Link]
- [Link]
Medium
- [Link]
- [Link]
- [Link]
- [Link]
[Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
- [Link]
Additional questions
- [Link]
- [Link]
Random
- [Link]
Videos
Some long videos, to revise or study in one long stretch!
- Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer
- Introduction to Data Structures & Algorithms | Course Details & Prerequisites
- Algorithms Course - Graph Theory Tutorial from a Google Engineer