Scribd
Upload
41 views5 pages

75 Dsaa

The document outlines various algorithmic problems categorized into 18 topics, including Arrays & Hashing, Two Pointers, Stack, and more. Each category lists problems of varying difficulty levels, from Easy to Hard, providing a comprehensive guide for practice. This structure aids in understanding and mastering different algorithmic techniques.

Uploaded by

arjun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views5 pages

75 Dsaa

The document outlines various algorithmic problems categorized into 18 topics, including Arrays & Hashing, Two Pointers, Stack, and more. Each category lists problems of varying difficulty levels, from Easy to Hard, providing a comprehensive guide for practice. This structure aids in understanding and mastering different algorithmic techniques.

Uploaded by

arjun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1.

Arrays & Hashing

• Two Sum (Easy)

• Valid Anagram (Easy)

• Group Anagrams (Medium)

• Top K Frequent Elements (Medium)

• Product of Array Except Self (Medium)

• Valid Sudoku (Medium)

• Encode and Decode Strings (Medium)

• Longest Consecutive Sequence (Medium)

2. Two Pointers

• Valid Palindrome (Easy)

• Two Sum II - Input Array is Sorted (Medium)

• 3Sum (Medium)

• Container With Most Water (Medium)

• Trapping Rain Water (Hard)

3. Stack

• Valid Parentheses (Easy)

• Min Stack (Medium)

• Evaluate Reverse Polish Notation (Medium)

• Generate Parentheses (Medium)

• Daily Temperatures (Medium)

• Car Fleet (Medium)

• Largest Rectangle in Histogram (Hard)

4. Binary Search

• Binary Search (Easy)

• Search in Rotated Sorted Array (Medium)


• Find Minimum in Rotated Sorted Array (Medium)

• Koko Eating Bananas (Medium)

• Median of Two Sorted Arrays (Hard)

5. Sliding Window

• Best Time to Buy and Sell Stock (Easy)

• Longest Substring Without Repeating Characters (Medium)

• Longest Repeating Character Replacement (Medium)

• Permutation in String (Medium)

• Minimum Window Substring (Hard)

• Sliding Window Maximum (Hard)

6. Linked List

• Reverse Linked List (Easy)

• Merge Two Sorted Lists (Easy)

• Reorder List (Medium)

• Remove Nth Node From End of List (Medium)

• Linked List Cycle (Easy)

7. Trees

• Invert Binary Tree (Easy)

• Maximum Depth of Binary Tree (Easy)

• Diameter of Binary Tree (Easy)

• Balanced Binary Tree (Easy)

• Same Tree (Easy)

• Subtree of Another Tree (Easy)

• Lowest Common Ancestor of a BST (Medium)

• Binary Tree Level Order Traversal (Medium)

• Binary Tree Right Side View (Medium)


• Count Good Nodes in Binary Tree (Medium)

• Validate Binary Search Tree (Medium)

• Kth Smallest Element in a BST (Medium)

• Construct Binary Tree from Preorder and Inorder Traversal (Medium)

• Serialize and Deserialize Binary Tree (Hard)

8. Tries

• Implement Trie (Prefix Tree) (Medium)

• Design Add and Search Words Data Structure (Medium)

• Word Search II (Hard)

9. Heap / Priority Queue

• Find Median from Data Stream (Hard)

• Top K Frequent Elements (Medium)

• Kth Largest Element in a Stream (Easy)

• Kth Largest Element in an Array (Medium)

10. Intervals

• Merge Intervals (Medium)

• Non-overlapping Intervals (Medium)

• Meeting Rooms (Easy)

• Meeting Rooms II (Medium)

11. Greedy

• Jump Game (Medium)

• Jump Game II (Medium)

• Gas Station (Medium)

12. Backtracking
• Subsets (Medium)

• Combination Sum (Medium)

• Permutations (Medium)

• Word Search (Medium)

• Palindrome Partitioning (Medium)

• N-Queens (Hard)

13. Graphs

• Number of Islands (Medium)

• Clone Graph (Medium)

• Max Area of Island (Medium)

• Pacific Atlantic Water Flow (Medium)

• Surrounded Regions (Medium)

• Rotting Oranges (Medium)

• Course Schedule (Medium)

• Course Schedule II (Medium)

• Redundant Connection (Medium)

• Graph Valid Tree (Medium)

• Word Ladder (Hard)

14. Advanced Graphs

• Network Delay Time (Medium)

• Cheapest Flights Within K Stops (Medium)

• Alien Dictionary (Topological Sort) (Hard)

15. 1-D DP

• Climbing Stairs (Easy)

• House Robber (Medium)

• House Robber II (Medium)


• Longest Palindromic Substring (Medium)

• Palindromic Substrings (Medium)

16. 2-D DP

• Unique Paths (Medium)

• Longest Common Subsequence (Medium)

• Coin Change (Medium)

• Word Break (Medium)

• Combination Sum IV (Medium)

• Minimal Path Sum (Medium)

• Edit Distance (Hard)

• Regular Expression Matching (Hard)

17. Bit Manipulation

• Single Number (Easy)

• Number of 1 Bits (Easy)

• Counting Bits (Easy)

• Missing Number (Easy)

• Reverse Bits (Easy)

18. Math & Geometry

• Rotate Image (Medium)

• Spiral Matrix (Medium)

• Set Matrix Zeroes (Medium)

• Happy Number (Easy)

• Plus One (Easy)

You might also like