Top 100 Liked DSA Questions
120 Modules
- Two Sum (#1)
- Valid Anagram (#242)
- Group Anagrams (#49)
- Top K Frequent Elements (#347)
- Product of Array Except Self (#238)
- Valid Sudoku (#36)
- Encode and Decode Strings (#271)
- Longest Consecutive Sequence (#128)
- Valid Palindrome (#125)
- 3Sum (#15)
- Container With Most Water (#11)
- Trapping Rain Water (#42)
- Best Time to Buy and Sell Stock (#121)
- Longest Substring Without Repeating Characters (#3)
- Longest Repeating Character Replacement (#424)
- Minimum Window Substring (#76)
- Find All Anagrams in a String (#438)
- Search in Rotated Sorted Array (#33)
- Find Minimum in Rotated Sorted Array (#153)
- Kth Largest Element in an Array (#215)
- Subarray Sum Equals K (#560)
- Median of Two Sorted Arrays (#4)
- Sliding Window Maximum (#239)
- Reverse Linked List (#206)
- Merge Two Sorted Lists (#21)
- Reorder List (#143)
- Remove Nth Node From End of List (#19)
- Copy List with Random Pointer (#138)
- Add Two Numbers (#2)
- Detect Cycle in Linked List (#141)
- Find the Duplicate Number (#287)
- LRU Cache (#146)
- Reverse Nodes in k-Group (#25)
- Valid Parentheses (#20)
- Min Stack (#155)
- Evaluate Reverse Polish Notation (#150)
- Generate Parentheses (#22)
- Daily Temperatures (#739)
- Car Fleet (#853)
- Largest Rectangle in Histogram (#84)
- Design Browser History (#1472)
- Encode and Decode TinyURL (#535)
- Decode String (#394)
- Task Scheduler (#621)
- Invert Binary Tree (#226)
- Maximum Depth of Binary Tree (#104)
- Same Tree (#100)
- Subtree of Another Tree (#572)
- Lowest Common Ancestor of BST (#235)
- Level Order Traversal (#102)
- Binary Tree Right Side View (#199)
- Validate Binary Search Tree (#98)
- Kth Smallest in BST (#230)
- Construct Binary Tree from Preorder & Inorder (#105)
- Binary Tree Maximum Path Sum (#124)
- Serialize and Deserialize Binary Tree (#297)
- Construct Binary Tree from Inorder & Postorder (#106)
- Validate Binary Tree Nodes (#1361)
- Binary Tree Paths (#257)
- Climbing Stairs (#70)
- Coin Change (#322)
- Longest Increasing Subsequence (#300)
- Longest Common Subsequence (#1143)
- Word Break (#139)
- Combination Sum (#39)
- House Robber (#198)
- House Robber II (#213)
- Decode Ways (#91)
- Unique Paths (#62)
- Jump Game (#55)
- Subsets (#78)
- Combination Sum II (#40)
- Word Search (#79)
- Permutations (#46)
- N-Queens (#51)
- Edit Distance (#72)
- Longest Increasing Path in a Matrix (#329)
- Longest Palindromic Substring (#5)
- Palindromic Substrings (#647)
- Combination Sum IV (#377)
- Coin Change II (#518)
- Jump Game II (#45)
- Target Sum (#494)
- Interleaving String (#97)
- Word Search II (#212)
- Number of Islands (#200)
- Clone Graph (#133)
- Course Schedule (#207)
- Course Schedule II (#210)
- Pacific Atlantic Water Flow (#417)
- Rotting Oranges (#994)
- Word Ladder (#127)
- Redundant Connection (#684)
- Graph Valid Tree (#261)
- Accounts Merge (#721)
- Number of Connected Components (#323)
- Merge Intervals (#56)
- Insert Interval (#57)
- Non-overlapping Intervals (#435)
- Meeting Rooms (#252)
- Meeting Rooms II (#253)
- Minimum Path Sum (#64)
- Top K Frequent Words (#692)
- Find Median from Data Stream (#295)
- LFU Cache (#460)
- Gas Station (#134)
- Hand of Straights (#846)
- Merge Triplets to Form Target (#1899)
- Partition Labels (#763)
- Find Peak Element (#162)
- Single Number (#136)
- Number of 1 Bits (#191)
- Counting Bits (#338)
- Missing Number (#268)
- Sum of Two Integers (#371)
- Alien Dictionary (#269)
- Insert Delete GetRandom O(1) (#380)
- Rotate Image (#48)
- Set Matrix Zeroes (#73)
- Spiral Matrix (#54)
Top 100 Liked DSA Questions
Follow the path to master this course. Select a module to begin.
This section covers fundamental and advanced array manipulation techniques, including two-pointers, sliding windows, and prefix sums.
Dive into linear data structures, mastering pointer manipulation, cycle detection, and common patterns like monotonic stacks.
Explore hierarchical data structures, including traversals (BFS, DFS), properties of Binary Search Trees, and advanced construction and serialization problems.
Master the art of solving complex optimization and combinatorial problems by breaking them down into simpler subproblems.
Model complex networks and relationships. This section covers graph traversals, topological sort, and cycle detection.
Tackle a common category of problems involving merging, inserting, and managing time intervals.
Learn specialized and highly efficient techniques for frequency counting, priority management, making optimal local choices, and low-level bit manipulation.
Challenge yourself with advanced problems that often require combining multiple data structures and algorithms to solve.
Practice problems involving 2D grids, a common way to represent data in interviews. These often involve clever traversals or in-place manipulations.