Total Solved
62/484
By Difficulty
54E8M0H
Streak
1 days
Striver A2Z
62/474
Activity Heatmap (Last 365 days)
LessMore
Topic Progress
Basics41/54
Sorting0/7
Arrays21/40
Binary Search0/32
Strings0/15
Linked List0/31
Recursion0/25
Bit Manipulation0/18
Stack & Queues0/30
Sliding Window & Two Pointers0/19
Heaps0/17
Greedy0/16
Binary Trees0/39
Binary Search Trees0/16
Graphs0/54
Dynamic Programming0/56
Tries0/7
Advanced Topics0/8
Problems (484)
| # | Problem | Diff | Pattern | Status | Date | Conf |
|---|---|---|---|---|---|---|
| 7 | Reverse a Number | Medium | Basics | Solved | Jun 15 | |
| 0 | Longest Subarray with Sum K | Medium | Basics | Solved | Jun 15 | |
| 0 | Count Distinct Elements in Array | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 1: Rectangular Star Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 2: Right-Angled Triangle Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 3: Right-Angled Number Pyramid | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 4: Right-Angled Number Pyramid II | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 5: Inverted Right Pyramid | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 6: Inverted Numbered Right Pyramid | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 7: Star Diamond | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 8: Diamond Star Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 9: Butterfly Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 10: Reverse Letter Triangle | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 11: Binary Number Triangle | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 12: Number Crown Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 13: Increasing Number Triangle | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 14: Increasing Letter Triangle | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 15: Reverse Letter Triangle II | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 16: Alpha-Ramp Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 17: Alpha-Hill Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 18: Alpha-Triangle Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 19: Symmetric-Butterfly Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 20: Symmetric-Void Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 21: Star Number Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Pattern 22: Palindrome Pattern | Easy | Basics | Solved | Jun 15 | |
| 0 | Count Digits | Easy | Basics | Solved | Jun 15 | |
| 9 | Check Palindrome Number | Easy | Basics | Solved | Jun 15 | |
| 0 | Check for Prime | Easy | Basics | Solved | Jun 15 | |
| 0 | Print 1 to N without loop | Easy | Basics | Solved | Jun 15 | |
| 0 | Print N to 1 without loop | Easy | Basics | Solved | Jun 15 | |
| 0 | Sum of First N Numbers | Easy | Basics | Solved | Jun 15 | |
| 0 | Factorial of N Numbers | Easy | Basics | Solved | Jun 15 | |
| 509 | Fibonacci Number | Easy | Basics | Solved | Jun 15 | |
| 0 | Count Frequency of Each Element | Easy | Basics | Solved | Jun 15 | |
| 1 | Two Sum (Hashing) | Easy | Basics | Solved | Jun 15 | |
| 0 | Check if Array is Sorted | Easy | Basics | Solved | Jun 15 | |
| 0 | Linear Search | Easy | Basics | Solved | Jun 15 | |
| 26 | Remove Duplicates from Sorted Array | Easy | Basics | Solved | Jun 15 | |
| 283 | Move Zeros to End | Easy | Basics | Solved | Jun 15 | |
| 0 | Union of Two Sorted Arrays | Easy | Basics | Solved | Jun 15 | |
| 268 | Missing Number | Easy | Basics | Solved | Jun 15 | |
| 128 | Longest Consecutive Sequence | Medium | Arrays | Solved | Jun 15 | |
| 73 | Set Matrix Zeroes | Medium | Arrays | Solved | Jun 15 | |
| 48 | Rotate Image | Medium | Arrays | Solved | Jun 15 | |
| 229 | Majority Element II (>n/3 times) | Medium | Arrays | Solved | Jun 15 | |
| 18 | 4Sum | Medium | Arrays | Solved | Jun 15 | |
| 56 | Merge Overlapping Intervals | Medium | Arrays | Solved | Jun 15 | |
| 0 | Second Largest Element in Array (Arrays) | Easy | Arrays | Solved | Jun 15 | |
| 26 | Remove Duplicates from Sorted Array (Arrays) | Easy | Arrays | Solved | Jun 15 | |
| 283 | Move Zeros to End (Arrays) | Easy | Arrays | Solved | Jun 15 | |
| 0 | Linear Search (Arrays) | Easy | Arrays | Solved | Jun 15 | |
| 0 | Union of Two Sorted Arrays (Arrays) | Easy | Arrays | Solved | Jun 15 | |
| 349 | Intersection of Two Arrays | Easy | Arrays | Solved | Jun 15 | |
| 268 | Find Missing Number in Array | Easy | Arrays | Solved | Jun 15 | |
| 485 | Maximum Consecutive Ones | Easy | Arrays | Solved | Jun 15 | |
| 136 | Find Number that Appears Once | Easy | Arrays | Solved | Jun 15 | |
| 0 | Longest Subarray with Sum K (Positives) | Easy | Arrays | Solved | Jun 15 | |
| 1 | Two Sum | Easy | Arrays | Solved | Jun 15 | |
| 169 | Majority Element (>n/2 times) | Easy | Arrays | Solved | Jun 15 | |
| 121 | Best Time to Buy and Sell Stock | Easy | Arrays | Solved | Jun 15 | |
| 118 | Pascal's Triangle | Easy | Arrays | Solved | Jun 15 | |
| 88 | Merge Sorted Array | Easy | Arrays | Solved | Jun 15 | |
| 0 | Sparse Table (Range Minimum Query) | Hard | Advanced Topics | Not Started | — | |
| 0 | Binary Indexed Tree (Fenwick Tree) | Hard | Advanced Topics | Not Started | — | |
| 0 | Segment Tree - Range Query | Hard | Advanced Topics | Not Started | — | |
| 0 | Segment Tree - Build and Update | Hard | Advanced Topics | Not Started | — | |
| 0 | Aho-Corasick Algorithm | Hard | Advanced Topics | Not Started | — | |
| 0 | Rabin-Karp Algorithm | Medium | Advanced Topics | Not Started | — | |
| 0 | Z-Function for Pattern Matching | Medium | Advanced Topics | Not Started | — | |
| 28 | KMP Algorithm - Pattern Searching | Medium | Advanced Topics | Not Started | — | |
| 0 | Implement Phone Directory (Trie) | Medium | Tries | Not Started | — | |
| 1707 | Maximum XOR With an Element From Array | Hard | Tries | Not Started | — | |
| 421 | Maximum XOR of Two Numbers in Array | Medium | Tries | Not Started | — | |
| 0 | Number of Distinct Substrings in a String | Medium | Tries | Not Started | — | |
| 0 | Longest String with All Prefixes | Medium | Tries | Not Started | — | |
| 0 | Implement Trie II | Medium | Tries | Not Started | — | |
| 208 | Implement Trie I | Medium | Tries | Not Started | — | |
| 1043 | Partition Array for Maximum Sum | Medium | Dynamic Programming | Not Started | — | |
| 132 | Palindrome Partitioning II (DP) | Hard | Dynamic Programming | Not Started | — | |
| 0 | Evaluate Boolean Expression to True | Hard | Dynamic Programming | Not Started | — | |
| 312 | Burst Balloons | Hard | Dynamic Programming | Not Started | — | |
| 1547 | Minimum Cost to Cut a Stick | Hard | Dynamic Programming | Not Started | — | |
| 0 | Matrix Chain Multiplication | Hard | Dynamic Programming | Not Started | — | |
| 673 | Number of Longest Increasing Subsequences | Medium | Dynamic Programming | Not Started | — | |
| 1048 | Longest String Chain | Medium | Dynamic Programming | Not Started | — | |
| 368 | Largest Divisible Subset | Medium | Dynamic Programming | Not Started | — | |
| 300 | LIS using Binary Search | Medium | Dynamic Programming | Not Started | — | |
| 0 | Print Longest Increasing Subsequence | Medium | Dynamic Programming | Not Started | — | |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | Not Started | — | |
| 122 | Stock Problem Infinite Transactions | Medium | Dynamic Programming | Not Started | — | |
| 1235 | Maximum Profit in Job Scheduling | Hard | Dynamic Programming | Not Started | — | |
| 714 | Best Time to Buy and Sell Stock with Fee | Medium | Dynamic Programming | Not Started | — | |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | Dynamic Programming | Not Started | — | |
| 188 | Best Time to Buy and Sell Stock IV | Hard | Dynamic Programming | Not Started | — | |
| 123 | Best Time to Buy and Sell Stock III | Hard | Dynamic Programming | Not Started | — | |
| 44 | Wildcard Matching | Hard | Dynamic Programming | Not Started | — | |
| 72 | Edit Distance | Medium | Dynamic Programming | Not Started | — | |
| 115 | Distinct Subsequences | Hard | Dynamic Programming | Not Started | — | |
| 1092 | Shortest Common Supersequence | Hard | Dynamic Programming | Not Started | — | |
| 583 | Minimum Insertions/Deletions to Convert | Medium | Dynamic Programming | Not Started | — | |
| 1312 | Minimum Insertions to Make String Palindrome | Hard | Dynamic Programming | Not Started | — | |
| 516 | Longest Palindromic Subsequence | Medium | Dynamic Programming | Not Started | — | |
| 0 | Longest Common Substring | Medium | Dynamic Programming | Not Started | — | |
| 0 | Print LCS | Medium | Dynamic Programming | Not Started | — | |
| 1143 | Longest Common Subsequence | Medium | Dynamic Programming | Not Started | — | |
| 0 | Count Total Coins (Unbounded Knapsack) | Medium | Dynamic Programming | Not Started | — | |
| 0 | Rod Cutting Problem | Medium | Dynamic Programming | Not Started | — | |
| 0 | Unbounded Knapsack | Medium | Dynamic Programming | Not Started | — | |
| 518 | Coin Change II | Medium | Dynamic Programming | Not Started | — | |
| 494 | Target Sum | Medium | Dynamic Programming | Not Started | — | |
| 322 | Minimum Coins | Medium | Dynamic Programming | Not Started | — | |
| 0 | 0/1 Knapsack | Medium | Dynamic Programming | Not Started | — | |
| 0 | Count Partitions with Given Difference | Medium | Dynamic Programming | Not Started | — | |
| 0 | Count Subsets with Sum K | Medium | Dynamic Programming | Not Started | — | |
| 2035 | Partition Array Into Two Arrays Min Sum Diff | Hard | Dynamic Programming | Not Started | — | |
| 416 | Partition Equal Subset Sum | Medium | Dynamic Programming | Not Started | — | |
| 0 | Subset Sum Equals Target | Medium | Dynamic Programming | Not Started | — | |
| 1463 | Cherry Pickup II | Hard | Dynamic Programming | Not Started | — | |
| 120 | Minimum Path Sum in Triangular Grid | Medium | Dynamic Programming | Not Started | — | |
| 0 | Maximum Chocolate Pickup (3D DP) | Hard | Dynamic Programming | Not Started | — | |
| 931 | Minimum Falling Path Sum | Medium | Dynamic Programming | Not Started | — | |
| 120 | Triangle - Minimum Path Sum | Medium | Dynamic Programming | Not Started | — | |
| 64 | Minimum Path Sum in Grid | Medium | Dynamic Programming | Not Started | — | |
| 63 | Unique Paths II | Medium | Dynamic Programming | Not Started | — | |
| 62 | Unique Paths | Medium | Dynamic Programming | Not Started | — | |
| 70 | Count Ways to Reach Nth Stair | Easy | Dynamic Programming | Not Started | — | |
| 0 | Ninja's Training | Medium | Dynamic Programming | Not Started | — | |
| 213 | House Robber II | Medium | Dynamic Programming | Not Started | — | |
| 198 | House Robber | Medium | Dynamic Programming | Not Started | — | |
| 0 | Maximum Sum of Non-Adjacent Elements | Medium | Dynamic Programming | Not Started | — | |
| 0 | Frog Jump with K Distances | Medium | Dynamic Programming | Not Started | — | |
| 0 | Frog Jump | Easy | Dynamic Programming | Not Started | — | |
| 70 | Climbing Stairs | Easy | Dynamic Programming | Not Started | — | |
| 1584 | Minimum Cost to Connect All Points | Medium | Graphs | Not Started | — | |
| 743 | Network Delay Time | Medium | Graphs | Not Started | — | |
| 684 | Redundant Connection | Medium | Graphs | Not Started | — | |
| 133 | Clone Graph | Medium | Graphs | Not Started | — | |
| 417 | Pacific Atlantic Water Flow | Medium | Graphs | Not Started | — | |
| 130 | Surrounded Regions | Medium | Graphs | Not Started | — | |
| 542 | 01 Matrix | Medium | Graphs | Not Started | — | |
| 1971 | Check if Path Exists in Graph | Easy | Graphs | Not Started | — | |
| 778 | Swimming in Rising Water | Hard | Graphs | Not Started | — | |
| 305 | Number of Islands II (DSU) | Hard | Graphs | Not Started | — | |
| 0 | Articulation Points | Hard | Graphs | Not Started | — | |
| 1192 | Bridges in a Graph (Tarjan's) | Hard | Graphs | Not Started | — | |
| 0 | Strongly Connected Components (Kosaraju's) | Hard | Graphs | Not Started | — | |
| 947 | Most Stones Removed with Same Row or Column | Medium | Graphs | Not Started | — | |
| 990 | Satisfiability of Equality Equations | Medium | Graphs | Not Started | — | |
| 323 | Number of Connected Components | Medium | Graphs | Not Started | — | |
| 0 | Path Compression | Easy | Graphs | Not Started | — | |
| 0 | Union by Rank | Easy | Graphs | Not Started | — | |
| 0 | Disjoint Set Union (Union-Find) Basics | Easy | Graphs | Not Started | — | |
| 827 | Making a Large Island | Hard | Graphs | Not Started | — | |
| 721 | Accounts Merge | Medium | Graphs | Not Started | — | |
| 1319 | Number of Operations to Make Connected | Medium | Graphs | Not Started | — | |
| 0 | Minimum Spanning Tree (Kruskal's) | Medium | Graphs | Not Started | — | |
| 0 | Minimum Spanning Tree (Prim's) | Medium | Graphs | Not Started | — | |
| 1334 | City with Smallest Number of Neighbors | Medium | Graphs | Not Started | — | |
| 0 | Floyd-Warshall Algorithm | Medium | Graphs | Not Started | — | |
| 0 | Bellman-Ford Algorithm | Medium | Graphs | Not Started | — | |
| 0 | Minimum Multiplications to Reach End | Medium | Graphs | Not Started | — | |
| 1976 | Number of Ways to Arrive at Destination | Medium | Graphs | Not Started | — | |
| 787 | Cheapest Flights Within K Stops | Medium | Graphs | Not Started | — | |
| 1631 | Path with Minimum Effort | Medium | Graphs | Not Started | — | |
| 743 | Dijkstra's Algorithm | Medium | Graphs | Not Started | — | |
| 126 | Word Ladder II | Hard | Graphs | Not Started | — | |
| 127 | Word Ladder I | Hard | Graphs | Not Started | — | |
| 0 | Shortest Path in DAG | Medium | Graphs | Not Started | — | |
| 0 | Shortest Path in Undirected Graph | Medium | Graphs | Not Started | — | |
| 785 | Check Bipartite Graph | Medium | Graphs | Not Started | — | |
| 269 | Alien Dictionary | Hard | Graphs | Not Started | — | |
| 802 | Find Eventual Safe States | Medium | Graphs | Not Started | — | |
| 210 | Course Schedule II | Medium | Graphs | Not Started | — | |
| 207 | Course Schedule I | Medium | Graphs | Not Started | — | |
| 0 | Topological Sort (Kahn's BFS) | Medium | Graphs | Not Started | — | |
| 0 | Topological Sort (DFS) | Medium | Graphs | Not Started | — | |
| 0 | Detect Cycle in Directed Graph (BFS/Kahn's) | Medium | Graphs | Not Started | — | |
| 0 | Detect Cycle in Directed Graph (DFS) | Medium | Graphs | Not Started | — | |
| 0 | Detect Cycle in Undirected Graph (DFS) | Medium | Graphs | Not Started | — | |
| 0 | Detect Cycle in Undirected Graph (BFS) | Medium | Graphs | Not Started | — | |
| 994 | Rotten Oranges | Medium | Graphs | Not Started | — | |
| 733 | Flood Fill | Easy | Graphs | Not Started | — | |
| 200 | Number of Islands | Medium | Graphs | Not Started | — | |
| 547 | Number of Provinces | Medium | Graphs | Not Started | — | |
| 0 | DFS of Graph | Easy | Graphs | Not Started | — | |
| 0 | BFS of Graph | Easy | Graphs | Not Started | — | |
| 0 | Graph and Types | Easy | Graphs | Not Started | — | |
| 653 | Find a Pair with Given Sum in BST | Easy | Binary Search Trees | Not Started | — | |
| 0 | Check if BT is BST | Medium | Binary Search Trees | Not Started | — | |
| 235 | Lowest Common Ancestor of BST | Medium | Binary Search Trees | Not Started | — | |
| 98 | Validate Binary Search Tree | Medium | Binary Search Trees | Not Started | — | |
| 653 | Two Sum in BST | Easy | Binary Search Trees | Not Started | — | |
| 1038 | BST to Greater Sum Tree | Medium | Binary Search Trees | Not Started | — | |
| 285 | Inorder Successor in BST | Medium | Binary Search Trees | Not Started | — | |
| 1008 | Construct BST from Preorder Traversal | Medium | Binary Search Trees | Not Started | — | |
| 0 | Largest BST in Binary Tree | Hard | Binary Search Trees | Not Started | — | |
| 0 | Kth Largest Element in BST | Medium | Binary Search Trees | Not Started | — | |
| 230 | Kth Smallest Element in BST | Medium | Binary Search Trees | Not Started | — | |
| 450 | Delete Node in a BST | Medium | Binary Search Trees | Not Started | — | |
| 701 | Insert into a BST | Medium | Binary Search Trees | Not Started | — | |
| 0 | Floor in a BST | Medium | Binary Search Trees | Not Started | — | |
| 0 | Ceil in a BST | Medium | Binary Search Trees | Not Started | — | |
| 700 | Search in a Binary Search Tree | Easy | Binary Search Trees | Not Started | — | |
| 113 | Path Sum II | Medium | Binary Trees | Not Started | — | |
| 129 | Sum Root to Leaf Numbers | Medium | Binary Trees | Not Started | — | |
| 652 | Find Duplicate Subtrees | Medium | Binary Trees | Not Started | — | |
| 99 | Recover Binary Search Tree | Medium | Binary Trees | Not Started | — | |
| 96 | Unique Binary Trees (Catalan Number) | Medium | Binary Trees | Not Started | — | |
| 222 | Count Nodes in Complete Binary Tree | Easy | Binary Trees | Not Started | — | |
| 0 | Requirements to Construct Unique BT | Medium | Binary Trees | Not Started | — | |
| 0 | Minimum Time to Burn Binary Tree | Hard | Binary Trees | Not Started | — | |
| 0 | Check Children Sum Property | Medium | Binary Trees | Not Started | — | |
| 114 | Flatten Binary Tree to Linked List | Medium | Binary Trees | Not Started | — | |
| 236 | Lowest Common Ancestor of BT | Medium | Binary Trees | Not Started | — | |
| 297 | Serialize and Deserialize Binary Tree | Hard | Binary Trees | Not Started | — | |
| 106 | Construct BT from Inorder and Postorder | Medium | Binary Trees | Not Started | — | |
| 105 | Construct BT from Inorder and Preorder | Medium | Binary Trees | Not Started | — | |
| 222 | Count Total Nodes in Complete BT | Easy | Binary Trees | Not Started | — | |
| 863 | All Nodes at Distance K | Medium | Binary Trees | Not Started | — | |
| 662 | Maximum Width of Binary Tree | Medium | Binary Trees | Not Started | — | |
| 0 | Path to Root Node | Medium | Binary Trees | Not Started | — | |
| 101 | Symmetric Tree | Easy | Binary Trees | Not Started | — | |
| 199 | Right Side View of Binary Tree | Medium | Binary Trees | Not Started | — | |
| 0 | Bottom View of Binary Tree | Medium | Binary Trees | Not Started | — | |
| 0 | Top View of Binary Tree | Medium | Binary Trees | Not Started | — | |
| 987 | Vertical Order Traversal | Hard | Binary Trees | Not Started | — | |
| 0 | Boundary Traversal of Binary Tree | Medium | Binary Trees | Not Started | — | |
| 103 | Zigzag Level Order Traversal | Medium | Binary Trees | Not Started | — | |
| 100 | Same Tree | Easy | Binary Trees | Not Started | — | |
| 124 | Binary Tree Maximum Path Sum | Hard | Binary Trees | Not Started | — | |
| 543 | Diameter of Binary Tree | Easy | Binary Trees | Not Started | — | |
| 110 | Check if Binary Tree is Balanced | Easy | Binary Trees | Not Started | — | |
| 104 | Maximum Depth of Binary Tree | Easy | Binary Trees | Not Started | — | |
| 144 | Morris Preorder Traversal | Medium | Binary Trees | Not Started | — | |
| 94 | Morris Inorder Traversal | Medium | Binary Trees | Not Started | — | |
| 145 | Iterative Postorder Traversal | Medium | Binary Trees | Not Started | — | |
| 144 | Iterative Preorder Traversal (2 Stacks) | Medium | Binary Trees | Not Started | — | |
| 94 | Iterative Inorder Traversal | Medium | Binary Trees | Not Started | — | |
| 102 | Level Order Traversal | Medium | Binary Trees | Not Started | — | |
| 145 | Binary Tree Postorder Traversal | Easy | Binary Trees | Not Started | — | |
| 144 | Binary Tree Preorder Traversal | Easy | Binary Trees | Not Started | — | |
| 94 | Binary Tree Inorder Traversal | Easy | Binary Trees | Not Started | — | |
| 0 | Shortest Job First (CPU Scheduling) | Medium | Greedy | Not Started | — | |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | Greedy | Not Started | — | |
| 57 | Insert Interval | Medium | Greedy | Not Started | — | |
| 56 | Merge Intervals (Greedy) | Medium | Greedy | Not Started | — | |
| 435 | Non-overlapping Intervals | Medium | Greedy | Not Started | — | |
| 135 | Candy | Hard | Greedy | Not Started | — | |
| 0 | Job Sequencing Problem | Medium | Greedy | Not Started | — | |
| 0 | Minimum Number of Platforms Required | Medium | Greedy | Not Started | — | |
| 45 | Jump Game II | Medium | Greedy | Not Started | — | |
| 55 | Jump Game | Medium | Greedy | Not Started | — | |
| 0 | N Meetings in One Room | Easy | Greedy | Not Started | — | |
| 678 | Valid Parenthesis String | Medium | Greedy | Not Started | — | |
| 860 | Lemonade Change | Easy | Greedy | Not Started | — | |
| 0 | Minimum Number of Coins | Easy | Greedy | Not Started | — | |
| 0 | Fractional Knapsack | Medium | Greedy | Not Started | — | |
| 455 | Assign Cookies | Easy | Greedy | Not Started | — | |
| 264 | Ugly Number II | Medium | Heaps | Not Started | — | |
| 632 | Smallest Range Covering Elements from K Lists | Hard | Heaps | Not Started | — | |
| 0 | Convert Min Heap to Max Heap | Easy | Heaps | Not Started | — | |
| 1167 | Minimum Cost to Connect Ropes | Medium | Heaps | Not Started | — | |
| 0 | Maximum Sum Combinations | Hard | Heaps | Not Started | — | |
| 973 | K Closest Points to Origin | Medium | Heaps | Not Started | — | |
| 295 | Find Median from Data Stream | Hard | Heaps | Not Started | — | |
| 347 | Top K Frequent Elements | Medium | Heaps | Not Started | — | |
| 23 | Merge K Sorted Lists (Heap) | Hard | Heaps | Not Started | — | |
| 767 | Reorganize String | Medium | Heaps | Not Started | — | |
| 846 | Hand of Straights | Medium | Heaps | Not Started | — | |
| 621 | Task Scheduler | Medium | Heaps | Not Started | — | |
| 658 | K Closest Elements | Medium | Heaps | Not Started | — | |
| 703 | Kth Smallest Element in Array | Easy | Heaps | Not Started | — | |
| 215 | Kth Largest Element in Array | Medium | Heaps | Not Started | — | |
| 0 | Min Heap and Max Heap Implementation | Easy | Heaps | Not Started | — | |
| 0 | Introduction to Priority Queue | Easy | Heaps | Not Started | — | |
| 0 | Count Subarrays where Max >= K | Hard | Sliding Window & Two Pointers | Not Started | — | |
| 11 | Container with Most Water | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 42 | Trapping Rain Water (Two Pointer) | Hard | Sliding Window & Two Pointers | Not Started | — | |
| 16 | 3Sum Closest (Two Pointer) | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 167 | Two Sum II - Sorted Input (Two Pointer) | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 1004 | Longest Subarray with Ones after Replacement | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 992 | Subarray with K Different Integers | Hard | Sliding Window & Two Pointers | Not Started | — | |
| 713 | Subarray Product Less Than K | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 209 | Minimum Size Subarray Sum | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 76 | Minimum Window Substring | Hard | Sliding Window & Two Pointers | Not Started | — | |
| 567 | Permutation in String | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 1358 | Number of Substrings Containing All Three Characters | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 1248 | Count Number of Nice Subarrays | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 930 | Binary Subarrays with Sum | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 424 | Longest Repeating Character Replacement | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 904 | Fruit Into Baskets | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 1004 | Max Consecutive Ones III | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 3 | Longest Substring Without Repeating Characters | Medium | Sliding Window & Two Pointers | Not Started | — | |
| 460 | LFU Cache (Stack/Queue) | Hard | Stack & Queues | Not Started | — | |
| 146 | LRU Cache (Stack/Queue) | Medium | Stack & Queues | Not Started | — | |
| 277 | The Celebrity Problem | Medium | Stack & Queues | Not Started | — | |
| 155 | Min Stack | Medium | Stack & Queues | Not Started | — | |
| 0 | Maximum of Minimum for Every Window Size | Hard | Stack & Queues | Not Started | — | |
| 901 | Stock Span Problem | Medium | Stack & Queues | Not Started | — | |
| 239 | Sliding Window Maximum | Hard | Stack & Queues | Not Started | — | |
| 0 | Sort a Stack | Medium | Stack & Queues | Not Started | — | |
| 85 | Maximal Rectangle | Hard | Stack & Queues | Not Started | — | |
| 84 | Largest Rectangle in Histogram | Hard | Stack & Queues | Not Started | — | |
| 402 | Remove K Digits | Medium | Stack & Queues | Not Started | — | |
| 2104 | Sum of Subarray Ranges | Medium | Stack & Queues | Not Started | — | |
| 735 | Asteroid Collision | Medium | Stack & Queues | Not Started | — | |
| 907 | Sum of Subarray Minimums | Medium | Stack & Queues | Not Started | — | |
| 42 | Trapping Rain Water | Hard | Stack & Queues | Not Started | — | |
| 0 | Number of NGEs to the Right | Medium | Stack & Queues | Not Started | — | |
| 0 | Next Smaller Element | Medium | Stack & Queues | Not Started | — | |
| 503 | Next Greater Element II | Medium | Stack & Queues | Not Started | — | |
| 496 | Next Greater Element I | Easy | Stack & Queues | Not Started | — | |
| 0 | Infix to Prefix Conversion | Medium | Stack & Queues | Not Started | — | |
| 0 | Postfix to Infix Conversion | Medium | Stack & Queues | Not Started | — | |
| 0 | Postfix to Prefix Conversion | Medium | Stack & Queues | Not Started | — | |
| 0 | Prefix to Postfix Conversion | Medium | Stack & Queues | Not Started | — | |
| 0 | Prefix to Infix Conversion | Medium | Stack & Queues | Not Started | — | |
| 0 | Infix to Postfix Conversion | Medium | Stack & Queues | Not Started | — | |
| 20 | Check for Balanced Parentheses | Easy | Stack & Queues | Not Started | — | |
| 232 | Implement Queue using Stack | Easy | Stack & Queues | Not Started | — | |
| 225 | Implement Stack using Queue | Easy | Stack & Queues | Not Started | — | |
| 0 | Implement Queue using Arrays | Easy | Stack & Queues | Not Started | — | |
| 0 | Implement Stack using Arrays | Easy | Stack & Queues | Not Started | — | |
| 1835 | XOR of Numbers in a Range | Hard | Bit Manipulation | Not Started | — | |
| 2220 | Minimum Bit Flips to Convert Number | Easy | Bit Manipulation | Not Started | — | |
| 0 | Count Total Set Bits from 1 to N | Medium | Bit Manipulation | Not Started | — | |
| 0 | Find XOR from L to R | Medium | Bit Manipulation | Not Started | — | |
| 78 | Power Set using Bit Manipulation | Medium | Bit Manipulation | Not Started | — | |
| 260 | Two Non-Repeating Elements | Medium | Bit Manipulation | Not Started | — | |
| 260 | Single Number III | Medium | Bit Manipulation | Not Started | — | |
| 137 | Single Number II | Medium | Bit Manipulation | Not Started | — | |
| 136 | Single Number I | Easy | Bit Manipulation | Not Started | — | |
| 190 | Reverse Bits | Easy | Bit Manipulation | Not Started | — | |
| 29 | Divide Two Integers without Multiply or Divide | Medium | Bit Manipulation | Not Started | — | |
| 0 | Swap Two Numbers without extra variable | Easy | Bit Manipulation | Not Started | — | |
| 0 | Set, Unset and Toggle Bits | Easy | Bit Manipulation | Not Started | — | |
| 191 | Count Number of Set Bits | Easy | Bit Manipulation | Not Started | — | |
| 231 | Check if Number is Power of 2 | Easy | Bit Manipulation | Not Started | — | |
| 0 | Check if Number is Odd or Even | Easy | Bit Manipulation | Not Started | — | |
| 0 | Check if ith bit is Set | Easy | Bit Manipulation | Not Started | — | |
| 0 | Introduction to Bit Manipulation | Easy | Bit Manipulation | Not Started | — | |
| 526 | Beautiful Arrangement | Medium | Recursion | Not Started | — | |
| 282 | Expression Add Operators | Hard | Recursion | Not Started | — | |
| 140 | Word Break II | Hard | Recursion | Not Started | — | |
| 0 | Rat in a Maze | Medium | Recursion | Not Started | — | |
| 0 | M-Coloring Problem | Medium | Recursion | Not Started | — | |
| 37 | Sudoku Solver | Hard | Recursion | Not Started | — | |
| 52 | N-Queens II | Hard | Recursion | Not Started | — | |
| 51 | N-Queens | Hard | Recursion | Not Started | — | |
| 79 | Word Search | Medium | Recursion | Not Started | — | |
| 131 | Palindrome Partitioning | Medium | Recursion | Not Started | — | |
| 17 | Letter Combinations of Phone Number | Medium | Recursion | Not Started | — | |
| 216 | Combination Sum III | Medium | Recursion | Not Started | — | |
| 90 | Subset Sum II | Medium | Recursion | Not Started | — | |
| 0 | Subset Sum I | Medium | Recursion | Not Started | — | |
| 40 | Combination Sum II | Medium | Recursion | Not Started | — | |
| 39 | Combination Sum I | Medium | Recursion | Not Started | — | |
| 78 | Print All Subsequences (Power Set) | Medium | Recursion | Not Started | — | |
| 22 | Generate Parentheses | Medium | Recursion | Not Started | — | |
| 0 | Generate All Binary Strings | Medium | Recursion | Not Started | — | |
| 779 | Kth Symbol in Grammar | Medium | Recursion | Not Started | — | |
| 0 | Reverse a Stack using Recursion | Medium | Recursion | Not Started | — | |
| 0 | Sort a Stack using Recursion | Medium | Recursion | Not Started | — | |
| 1922 | Count Good Numbers | Medium | Recursion | Not Started | — | |
| 50 | Pow(x, n) - Recursion | Medium | Recursion | Not Started | — | |
| 0 | Recursive implementation of atoi | Medium | Recursion | Not Started | — | |
| 23 | Merge K Sorted Lists | Hard | Linked List | Not Started | — | |
| 460 | LFU Cache | Hard | Linked List | Not Started | — | |
| 146 | LRU Cache | Medium | Linked List | Not Started | — | |
| 1472 | Design Browser History | Medium | Linked List | Not Started | — | |
| 138 | Clone Linked List with Random Pointer | Medium | Linked List | Not Started | — | |
| 0 | Flattening a Linked List | Hard | Linked List | Not Started | — | |
| 61 | Rotate Linked List | Medium | Linked List | Not Started | — | |
| 25 | Reverse LL in Groups of K | Hard | Linked List | Not Started | — | |
| 0 | Delete All Occurrences of Key in DLL | Medium | Linked List | Not Started | — | |
| 2 | Add Two Numbers | Medium | Linked List | Not Started | — | |
| 0 | Add 1 to Number Represented as LL | Medium | Linked List | Not Started | — | |
| 160 | Find Intersection Point of Two LL | Easy | Linked List | Not Started | — | |
| 0 | Find Pairs with Given Sum in DLL | Medium | Linked List | Not Started | — | |
| 0 | Reverse a DLL | Easy | Linked List | Not Started | — | |
| 0 | Delete Node in DLL | Easy | Linked List | Not Started | — | |
| 0 | Introduction to Doubly Linked List | Easy | Linked List | Not Started | — | |
| 0 | Sort LL of 0s, 1s and 2s | Easy | Linked List | Not Started | — | |
| 148 | Sort LL | Medium | Linked List | Not Started | — | |
| 2095 | Delete the Middle Node of LL | Medium | Linked List | Not Started | — | |
| 19 | Remove Nth Node from End of LL | Medium | Linked List | Not Started | — | |
| 328 | Segregate Odd and Even Nodes in LL | Medium | Linked List | Not Started | — | |
| 234 | Check if LL is Palindrome | Easy | Linked List | Not Started | — | |
| 142 | Find Starting Point of Loop in LL | Medium | Linked List | Not Started | — | |
| 141 | Detect a Loop in LL | Easy | Linked List | Not Started | — | |
| 206 | Reverse a Linked List | Easy | Linked List | Not Started | — | |
| 876 | Find the Middle of LL | Easy | Linked List | Not Started | — | |
| 0 | Search in Linked List | Easy | Linked List | Not Started | — | |
| 0 | Delete Last Node of LL | Easy | Linked List | Not Started | — | |
| 0 | Array to Linked List | Easy | Linked List | Not Started | — | |
| 707 | Insert at Beginning / Tail of LL | Easy | Linked List | Not Started | — | |
| 707 | Introduction to Linked List | Easy | Linked List | Not Started | — | |
| 1781 | Sum of Beauty of All Substrings | Medium | Strings | Not Started | — | |
| 5 | Longest Palindromic Substring | Medium | Strings | Not Started | — | |
| 38 | Count and Say | Medium | Strings | Not Started | — | |
| 8 | String to Integer (atoi) | Medium | Strings | Not Started | — | |
| 12 | Integer to Roman | Medium | Strings | Not Started | — | |
| 13 | Roman to Integer | Easy | Strings | Not Started | — | |
| 1614 | Maximum Nesting Depth of Parentheses | Easy | Strings | Not Started | — | |
| 451 | Sort Characters By Frequency | Medium | Strings | Not Started | — | |
| 242 | Check if Two Strings are Anagrams | Easy | Strings | Not Started | — | |
| 796 | Check if Strings are Rotation of Each Other | Easy | Strings | Not Started | — | |
| 205 | Isomorphic Strings | Easy | Strings | Not Started | — | |
| 14 | Longest Common Prefix | Easy | Strings | Not Started | — | |
| 1903 | Largest Odd Number in String | Easy | Strings | Not Started | — | |
| 151 | Reverse Words in a String | Medium | Strings | Not Started | — | |
| 1021 | Remove Outermost Parentheses | Easy | Strings | Not Started | — | |
| 0 | Matrix Median | Hard | Binary Search | Not Started | — | |
| 0 | Median in Row-Wise Sorted Matrix | Hard | Binary Search | Not Started | — | |
| 1901 | Find Peak Element II (2D) | Medium | Binary Search | Not Started | — | |
| 240 | Search in 2D Matrix II | Medium | Binary Search | Not Started | — | |
| 74 | Search a 2D Matrix | Medium | Binary Search | Not Started | — | |
| 0 | Row with Maximum 1s in Binary Matrix | Easy | Binary Search | Not Started | — | |
| 0 | Find K-th Element of Two Sorted Arrays | Hard | Binary Search | Not Started | — | |
| 69 | Square Root of a Number | Easy | Binary Search | Not Started | — | |
| 4 | Median of Two Sorted Arrays | Hard | Binary Search | Not Started | — | |
| 774 | Minimize Max Distance to Gas Station | Hard | Binary Search | Not Started | — | |
| 0 | Painter's Partition Problem | Hard | Binary Search | Not Started | — | |
| 410 | Split Array Largest Sum | Hard | Binary Search | Not Started | — | |
| 0 | Allocate Minimum Number of Pages (Books) | Hard | Binary Search | Not Started | — | |
| 0 | Aggressive Cows | Hard | Binary Search | Not Started | — | |
| 0 | Nth Root of a Number | Medium | Binary Search | Not Started | — | |
| 1011 | Capacity to Ship Packages Within D Days | Medium | Binary Search | Not Started | — | |
| 1283 | Find Smallest Divisor Given Threshold | Medium | Binary Search | Not Started | — | |
| 1482 | Minimum Days to Make M Bouquets | Medium | Binary Search | Not Started | — | |
| 875 | Koko Eating Bananas | Medium | Binary Search | Not Started | — | |
| 1539 | Kth Missing Positive Number | Easy | Binary Search | Not Started | — | |
| 162 | Find Peak Element | Medium | Binary Search | Not Started | — | |
| 540 | Single Element in Sorted Array | Medium | Binary Search | Not Started | — | |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | Binary Search | Not Started | — | |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Binary Search | Not Started | — | |
| 81 | Search in Rotated Sorted Array II | Medium | Binary Search | Not Started | — | |
| 33 | Search in Rotated Sorted Array | Medium | Binary Search | Not Started | — | |
| 0 | Count Occurrences in Sorted Array | Easy | Binary Search | Not Started | — | |
| 34 | First and Last Position of Element | Medium | Binary Search | Not Started | — | |
| 0 | Floor and Ceil in Sorted Array | Easy | Binary Search | Not Started | — | |
| 0 | Upper Bound | Easy | Binary Search | Not Started | — | |
| 35 | Lower Bound | Easy | Binary Search | Not Started | — | |
| 704 | Binary Search | Easy | Binary Search | Not Started | — | |
| 62 | Grid Unique Paths (Arrays) | Medium | Arrays | Not Started | — | |
| 152 | Maximum Product Subarray | Medium | Arrays | Not Started | — | |
| 493 | Reverse Pairs | Hard | Arrays | Not Started | — | |
| 0 | Count Inversions in Array | Hard | Arrays | Not Started | — | |
| 0 | Find Missing and Repeating Number | Hard | Arrays | Not Started | — | |
| 0 | Count Subarrays with XOR = K | Hard | Arrays | Not Started | — | |
| 0 | Largest Subarray with 0 Sum | Medium | Arrays | Not Started | — | |
| 15 | 3Sum | Medium | Arrays | Needs Revisit | — | |
| 560 | Count Subarrays with Sum K | Medium | Arrays | Needs Revisit | — | |
| 54 | Spiral Matrix | Medium | Arrays | Needs Revisit | — | |
| 0 | Leaders in an Array | Easy | Arrays | Not Started | — | |
| 31 | Next Permutation | Medium | Arrays | Needs Revisit | — | |
| 2149 | Rearrange Array Elements by Sign | Medium | Arrays | Not Started | — | |
| 122 | Best Time to Buy and Sell Stock II | Medium | Arrays | Not Started | — | |
| 53 | Maximum Subarray (Kadane's Algorithm) | Medium | Arrays | Needs Revisit | — | |
| 75 | Sort Colors (Dutch National Flag) | Medium | Arrays | Needs Revisit | — | |
| 0 | Longest Subarray with Sum K (Positives + Negatives) | Medium | Arrays | Not Started | — | |
| 189 | Rotate Array by K Places | Medium | Arrays | Needs Revisit | — | |
| 1752 | Check if Array is Sorted and Rotated | Easy | Arrays | Not Started | — | |
| 0 | Recursive Insertion Sort | Easy | Sorting | Needs Revisit | — | |
| 0 | Recursive Bubble Sort | Easy | Sorting | Needs Revisit | — | |
| 912 | Quick Sort | Medium | Sorting | Needs Revisit | — | |
| 912 | Merge Sort | Medium | Sorting | Needs Revisit | — | |
| 0 | Insertion Sort | Easy | Sorting | Needs Revisit | — | |
| 0 | Bubble Sort | Easy | Sorting | Needs Revisit | — | |
| 0 | Selection Sort | Easy | Sorting | Needs Revisit | — | |
| 189 | Left Rotate Array by D Places | Medium | Basics | Needs Revisit | — | |
| 0 | Left Rotate Array by One Place | Easy | Basics | Not Started | — | |
| 0 | Second Largest Element in Array | Easy | Basics | Needs Revisit | — | |
| 0 | Largest Element in Array | Easy | Basics | Needs Revisit | — | |
| 0 | Find Highest and Lowest Frequency Element | Easy | Basics | Needs Revisit | — | |
| 78 | Multiple Recursion Calls - Subsets | Medium | Basics | Not Started | — | |
| 50 | Pow(x, n) | Medium | Basics | Attempted | — | |
| 0 | Check if String is Palindrome (Recursion) | Easy | Basics | Needs Revisit | — | |
| 0 | Reverse an Array using Recursion | Easy | Basics | Needs Revisit | — | |
| 204 | Count Primes | Medium | Basics | Not Started | — | |
| 0 | Print all Divisors | Easy | Basics | Not Started | — | |
| 0 | Armstrong Numbers | Easy | Basics | Not Started | — | |
| 1979 | GCD or HCF of Two Numbers | Easy | Basics | Not Started | — |