Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Arsh Goyal
Arsh Goyal DSA Sheet
A focused interview preparation challenge across core topics.
300 practice entries · Source checked
0 / 300 completed0%
About this source edition
Creator-published challenge spreadsheet
“Source checked” is when this edition was retrieved, not a claim that the creator updated it then.
Original sheet ↗Arrays
0 / 28
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Find The Duplicate Number | Easy | Open ↗ | — | |
| Sort Colors | Easy | Open ↗ | — | |
| Remove Duplicates From Sorted Array | Easy | Open ↗ | — | |
| Set Matrix Zeroes | Easy | Open ↗ | — | |
| Move Zeroes | Easy | Open ↗ | — | |
| Best Time To Buy And Sell Stock | Easy | Open ↗ | — | |
| Chocolate Distribution Problem | Easy | Open ↗ | — | |
| Two Sum | Easy | Open ↗ | — | |
| Best Time To Buy And Sell Stock Ii | Easy | Open ↗ | — | |
| Subarray Sums Divisible By K | Medium | Open ↗ | — | |
| Find All Duplicates In An Array | Medium | Open ↗ | — | |
| Container With Most Water | Medium | Open ↗ | — | |
| 3Sum | Medium | Open ↗ | — | |
| 4Sum | Medium | Open ↗ | — | |
| Maximum Points You Can Obtain From Cards | Medium | Open ↗ | — | |
| Subarray Sum Equals K | Medium | Open ↗ | — | |
| Spiral Matrix | Medium | Open ↗ | — | |
| Word Search | Medium | Open ↗ | — | |
| Jump Game | Medium | Open ↗ | — | |
| Merge Sorted Array | Medium | Open ↗ | — | |
| Majority Element | Medium | Open ↗ | — | |
| Reverse Pairs | Medium | Open ↗ | — | |
| Print All Possible Combinations Of R Elements In A Given Array Of Size N | Medium | Open ↗ | — | |
| Game Of Life | Medium | Open ↗ | — | |
| Max Value Of Equation | Hard | Open ↗ | — | |
| Insert Delete Getrandom O1 Duplicates Allowed | Hard | Open ↗ | — | |
| Largest Rectangle In Histogram | Hard | Open ↗ | — | |
| Max Value Of Equation | Hard | Open ↗ | — |
Strings
0 / 20
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Valid Parentheses | Easy | Open ↗ | — | |
| Print All The Duplicates In The Input String | Easy | Open ↗ | — | |
| Implement Strstr | Easy | Open ↗ | — | |
| Longest Common Prefix | Easy | Open ↗ | — | |
| Valid Palindrome Ii | Easy | Open ↗ | — | |
| Integer To Roman | Medium | Open ↗ | — | |
| Generate Parentheses | Medium | Open ↗ | — | |
| Simplify Path | Medium | Open ↗ | — | |
| Smallest Window In A String Containing All The Characters Of Another String | Medium | Open ↗ | — | |
| Reverse Words In A String | Medium | Open ↗ | — | |
| Rabin Karp Algorithm For Pattern Searching | Medium | Open ↗ | — | |
| Group Anagrams | Medium | Open ↗ | — | |
| Word Wrap1646 | Medium | Open ↗ | — | |
| Basic Calculator Ii | Medium | Open ↗ | — | |
| Valid Number | Hard | Open ↗ | — | |
| Integer To English Words | Hard | Open ↗ | — | |
| Minimum Window Substring | Hard | Open ↗ | — | |
| Text Justification | Hard | Open ↗ | — | |
| Boyer Moore Algorithm For Pattern Searching | Hard | Open ↗ | — | |
| Distinct Subsequences | Hard | Open ↗ | — |
Matrix Problems
0 / 5
Mathematical Problems
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Minimum Moves To Equal Array Elements | Easy | Open ↗ | — | |
| Add Binary | Easy | Open ↗ | — | |
| Maximum Product Of Three Numbers | Easy | Open ↗ | — | |
| Excel Sheet Column Title | Easy | Open ↗ | — | |
| Happy Number | Easy | Open ↗ | — | |
| Palindrome Number | Easy | Open ↗ | — | |
| Missing Number | Easy | Open ↗ | — | |
| Reverse Integer | Easy | Open ↗ | — | |
| Power Of Two | Easy | Open ↗ | — | |
| Max Points On A Line | Medium | Open ↗ | — | |
| Valid Square | Medium | Open ↗ | — | |
| The Kth Factor Of N | Medium | Open ↗ | — |
Sorting and Searching
0 / 15
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Permute Two Arrays Sum Every Pair Greater Equal K | Easy | Open ↗ | — | |
| Ceiling In A Sorted Array | Easy | Open ↗ | — | |
| Find A Pair With The Given Difference | Easy | Open ↗ | — | |
| Permute Two Arrays Sum Every Pair Greater Equal K | Easy | Open ↗ | — | |
| Check Reversing Sub Array Make Array Sorted | Medium | Open ↗ | — | |
| Radix Sort | Medium | Open ↗ | — | |
| A Product Array Puzzle | Medium | Open ↗ | — | |
| Make Array Elements Equal Minimum Cost | Medium | Open ↗ | — | |
| Find Peak Element | Medium | Open ↗ | — | |
| Allocate Minimum Number Of Pages0937 | Hard | Open ↗ | — | |
| Minimum Number Swaps Required Sort Array | Hard | Open ↗ | — | |
| Aggrcow | Hard | Open ↗ | — | |
| Search In Rotated Sorted Array | Hard | Open ↗ | — | |
| Count Of Smaller Numbers After Self | Hard | Open ↗ | — | |
| Split Array Largest Sum | Hard | Open ↗ | — |
Linked List
0 / 30
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Middle Of The Linked List | Easy | Open ↗ | — | |
| Linked List Cycle | Easy | Open ↗ | — | |
| Convert Binary Number In A Linked List To Integer | Easy | Open ↗ | — | |
| Remove Duplicates From Sorted List | Easy | Open ↗ | — | |
| Sort A Linked List Of 0S 1S Or 2S | Easy | Open ↗ | — | |
| Remove Linked List Elements | Easy | Open ↗ | — | |
| Merge Two Sorted Lists | Easy | Open ↗ | — | |
| Multiply Two Numbers Represented Linked Lists | Easy | Open ↗ | — | |
| Intersection Of Two Linked Lists | Easy | Open ↗ | — | |
| Given Only A Pointer To A Node To Be Deleted In A Singly Linked List How Do You Delete It | Easy | Open ↗ | — | |
| Palindrome Linked List | Easy | Open ↗ | — | |
| Reverse Linked List | Easy | Open ↗ | — | |
| Add Two Numbers | Medium | Open ↗ | — | |
| Copy List With Random Pointer | Medium | Open ↗ | — | |
| Add Two Numbers Ii | Medium | Open ↗ | — | |
| Reverse Linked List Ii | Medium | Open ↗ | — | |
| Reorder List | Medium | Open ↗ | — | |
| Remove Nth Node From End Of List | Medium | Open ↗ | — | |
| Flatten A Multilevel Doubly Linked List | Medium | Open ↗ | — | |
| Partition List | Medium | Open ↗ | — | |
| Remove Duplicates From Sorted List Ii | Medium | Open ↗ | — | |
| Linked List In Zig Zag Fashion | Medium | Open ↗ | — | |
| Sort List | Medium | Open ↗ | — | |
| Segregate Even And Odd Elements In A Linked List | Medium | Open ↗ | — | |
| Rearrange A Given Linked List In Place | Medium | Open ↗ | — | |
| Merge K Sorted Lists | Hard | Open ↗ | — | |
| Reverse Nodes In K Group | Hard | Open ↗ | — | |
| Merge Sort For Linked List | Hard | Open ↗ | — | |
| Flattening A Linked List | Hard | Open ↗ | — | |
| Subtract Two Numbers Represented As Linked Lists | Hard | Open ↗ | — |
Stacks and Queues
0 / 20
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Implement Queue Using Stacks | Easy | Open ↗ | — | |
| Backspace String Compare | Easy | Open ↗ | — | |
| Implement Stack Using Queues | Easy | Open ↗ | — | |
| Implement Stack Queue Using Deque | Easy | Open ↗ | — | |
| Next Greater Element I | Easy | Open ↗ | — | |
| Stack Set 4 Evaluation Postfix Expression | Easy | Open ↗ | — | |
| Implement Two Stacks In An Array | Easy | Open ↗ | — | |
| Minimum Cost Tree From Leaf Values | Medium | Open ↗ | — | |
| Daily Temperatures | Medium | Open ↗ | — | |
| Distance Of Nearest Cell Having 1 | Medium | Open ↗ | — | |
| Online Stock Span | Medium | Open ↗ | — | |
| Rotten Oranges2536 | Medium | Open ↗ | — | |
| Sum Of Subarray Minimums | Medium | Open ↗ | — | |
| Evaluate Reverse Polish Notation | Medium | Open ↗ | — | |
| Circular Tour | Medium | Open ↗ | — | |
| Implement Stack Using Queues | Medium | Open ↗ | — | |
| Flatten Nested List Iterator | Medium | Open ↗ | — | |
| Find The Maximum Of Minimums For Every Window Size In A Given Array | Hard | Open ↗ | — | |
| Lru Cache Implementation | Hard | Open ↗ | — | |
| The Celebrity Problem | Hard | Open ↗ | — |
Trees
0 / 48
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Diameter Of Binary Tree | Easy | Open ↗ | — | |
| Invert Binary Tree | Easy | Open ↗ | — | |
| Subtree Of Another Tree | Easy | Open ↗ | — | |
| Range Sum Of Bst | Easy | Open ↗ | — | |
| Symmetric Tree | Easy | Open ↗ | — | |
| Convert Sorted Array To Binary Search Tree | Easy | Open ↗ | — | |
| Merge Two Binary Trees | Easy | Open ↗ | — | |
| Maximum Depth Of Binary Tree | Easy | Open ↗ | — | |
| Binary Tree Paths | Easy | Open ↗ | — | |
| Same Tree | Easy | Open ↗ | — | |
| Lowest Common Ancestor Of A Binary Search Tree | Easy | Open ↗ | — | |
| Path Sum | Easy | Open ↗ | — | |
| Minimum Absolute Difference In Bst | Easy | Open ↗ | — | |
| Sum Of Left Leaves | Easy | Open ↗ | — | |
| Balanced Binary Tree | Easy | Open ↗ | — | |
| Predecessor And Successor | Easy | Open ↗ | — | |
| Binary Tree Inorder Traversal | Easy | Open ↗ | — | |
| Check Whether Bst Contains Dead End | Easy | Open ↗ | — | |
| Binary Search Tree Iterator | Medium | Open ↗ | — | |
| Lowest Common Ancestor Of A Binary Tree | Medium | Open ↗ | — | |
| Unique Binary Search Trees Ii | Medium | Open ↗ | — | |
| All Nodes Distance K In Binary Tree | Medium | Open ↗ | — | |
| Validate Binary Search Tree | Medium | Open ↗ | — | |
| Binary Tree Right Side View | Medium | Open ↗ | — | |
| Redundant Connection | Medium | Open ↗ | — | |
| Binary Tree Level Order Traversal | Medium | Open ↗ | — | |
| Path Sum Iii | Medium | Open ↗ | — | |
| Construct Binary Tree From Preorder And Postorder Traversal | Medium | Open ↗ | — | |
| Unique Binary Search Trees | Medium | Open ↗ | — | |
| Recover Binary Search Tree | Medium | Open ↗ | — | |
| Populating Next Right Pointers In Each Node | Medium | Open ↗ | — | |
| Flatten Binary Tree To Linked List | Medium | Open ↗ | — | |
| Maximum Width Of Binary Tree | Medium | Open ↗ | — | |
| Min Distance Between Two Given Nodes Of A Binary Tree | Medium | Open ↗ | — | |
| Kth Smallest Element In A Bst | Medium | Open ↗ | — | |
| Binary Tree Zigzag Level Order Traversal | Medium | Open ↗ | — | |
| Count Bst Nodes That Lie In A Given Range | Medium | Open ↗ | — | |
| Preorder To Postorder4423 | Medium | Open ↗ | — | |
| Binary Tree To Dll | Hard | Open ↗ | — | |
| Binary Tree Maximum Path Sum | Hard | Open ↗ | — | |
| Sum Of Distances In Tree | Hard | Open ↗ | — | |
| Binary Tree Cameras | Hard | Open ↗ | — | |
| Vertical Order Traversal Of A Binary Tree | Hard | Open ↗ | — | |
| Print K Sum Paths Binary Tree | Hard | Open ↗ | — | |
| Serialize And Deserialize Binary Tree | Hard | Open ↗ | — | |
| Find Median Bst Time O1 Space | Hard | Open ↗ | — | |
| Largest Bst Binary Tree Set 2 | Hard | Open ↗ | — | |
| Construct Bst From Given Preorder Traversa | Hard | Open ↗ | — |
GRAPHS
0 / 37
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Bfs Traversal Of Graph | Easy | Open ↗ | — | |
| Depth First Search Or Dfs For A Graph | Easy | Open ↗ | — | |
| Number Of Islands | Easy | Open ↗ | — | |
| Flood Fill | Easy | Open ↗ | — | |
| Rat In A Maze Problem | Easy | Open ↗ | — | |
| Detect Cycle In An Undirected Graph | Easy | Open ↗ | — | |
| Detect Cycle In A Graph | Easy | Open ↗ | — | |
| Steps By Knight5927 | Medium | Open ↗ | — | |
| Decode String | Medium | Open ↗ | — | |
| Shortest Bridge | Medium | Open ↗ | — | |
| Number Of Operations To Make Network Connected | Medium | Open ↗ | — | |
| Find Eventual Safe States | Medium | Open ↗ | — | |
| Strongly Connected Components Kosarajus Algo | Medium | Open ↗ | — | |
| Time Needed To Inform All Employees | Medium | Open ↗ | — | |
| Graph Coloring Applications | Medium | Open ↗ | — | |
| Most Stones Removed With Same Row Or Column | Medium | Open ↗ | — | |
| As Far From Land As Possible | Medium | Open ↗ | — | |
| Find The City With The Smallest Number Of Neighbors At A Threshold Distance | Medium | Open ↗ | — | |
| Find Whether It Is Possible To Finish All Tasks Or Not From Given Dependencies | Medium | Open ↗ | — | |
| Prims Minimum Spanning Tree Mst Greedy Algo 5 | Medium | Open ↗ | — | |
| Implementing Floyd Warshall2042 | Medium | Open ↗ | — | |
| Evaluate Division | Medium | Open ↗ | — | |
| Snakes And Ladders | Medium | Open ↗ | — | |
| Topological Sort | Medium | Open ↗ | — | |
| Description | Medium | Open ↗ | — | |
| Detect Negative Cycle Graph Bellman Ford | Medium | Open ↗ | — | |
| Bipartite Graph | Medium | Open ↗ | — | |
| Longest Increasing Path In A Matrix | Hard | Open ↗ | — | |
| Making A Large Island | Hard | Open ↗ | — | |
| Remove Boxes | Hard | Open ↗ | — | |
| Critical Connections In A Network | Hard | Open ↗ | — | |
| Alien Dictionary | Hard | Open ↗ | — | |
| Water Jug Problem Using Bfs | Hard | Open ↗ | — | |
| Travelling Salesman Problem Set 1 | Hard | Open ↗ | — | |
| Total Number Spanning Trees Graph | Hard | Open ↗ | — | |
| Word Ladder | Hard | Open ↗ | — | |
| Minimize Cash Flow Among Given Set Friends Borrowed Money | Hard | Open ↗ | — |
Tries
0 / 6
Heaps / PQs
0 / 14
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Top K Frequent Elements | Easy/Medium | Open ↗ | — | |
| Kth Largest Element In An Array | Easy/Medium | Open ↗ | — | |
| Ugly Number Ii | Easy/Medium | Open ↗ | — | |
| Furthest Building You Can Reach | Easy/Medium | Open ↗ | — | |
| Kth Smallest Element In A Sorted Matrix | Easy/Medium | Open ↗ | — | |
| Reorganize String | Easy/Medium | Open ↗ | — | |
| Find The Most Competitive Subsequence | Easy/Medium | Open ↗ | — | |
| Smallest Positive Missing Number | Easy/Medium | Open ↗ | — | |
| Largest Subarray With 0 Sum | Easy/Medium | Open ↗ | — | |
| K Closest Points To Origin | Easy/Medium | Open ↗ | — | |
| Minimum Number Of Refueling Stops | Hard | Open ↗ | — | |
| Minimum Cost To Hire K Workers | Hard | Open ↗ | — | |
| Swim In Rising Water | Hard | Open ↗ | — | |
| Sliding Window Maximum | Hard | Open ↗ | — |
Dynamic Programming
0 / 30
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Climbing Stairs | Easy | Open ↗ | — | |
| Maximum Product Subarray | Easy | Open ↗ | — | |
| Ones And Zeroes | Easy | Open ↗ | — | |
| Counting Bits | Easy | Open ↗ | — | |
| Knight Dialer | Medium | Open ↗ | — | |
| Cutted Segments1642 | Medium | Open ↗ | — | |
| Unique Paths | Medium | Open ↗ | — | |
| Minimum Path Sum | Medium | Open ↗ | — | |
| Coin Change | Medium | Open ↗ | — | |
| Decode Ways | Medium | Open ↗ | — | |
| Maximum Length Of Repeated Subarray | Medium | Open ↗ | — | |
| Longest Increasing Subsequence | Medium | Open ↗ | — | |
| Longest Common Substring1452 | Medium | Open ↗ | — | |
| Count Square Submatrices With All Ones | Medium | Open ↗ | — | |
| Maximal Square | Medium | Open ↗ | — | |
| Mobile Numeric Keypad5456 | Medium | Open ↗ | — | |
| Weighted Job Scheduling | Medium | Open ↗ | — | |
| Delete And Earn | Medium | Open ↗ | — | |
| Range Sum Query 2D Immutable | Medium | Open ↗ | — | |
| Optimal Binary Search Tree Dp 24 | Hard | Open ↗ | — | |
| Frog Jump | Hard | Open ↗ | — | |
| Best Time To Buy And Sell Stock Iv | Hard | Open ↗ | — | |
| Minimum Insertion Steps To Make A String Palindrome | Hard | Open ↗ | — | |
| Url | Hard | Open ↗ | — | |
| Trapping Rain Water | Hard | Open ↗ | — | |
| Minimum Cost To Merge Stones | Hard | Open ↗ | — | |
| Count Different Palindromic Subsequences | Hard | Open ↗ | — | |
| Maximal Rectangle | Hard | Open ↗ | — | |
| Burst Balloons | Hard | Open ↗ | — | |
| Super Egg Drop | Hard | Open ↗ | — |
Two Pointer Approach
0 / 3
Greedy Algorithms
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Gas Station | Easy/Medium | Open ↗ | — | |
| Minimum Cost For Acquiring All Coins With K Extra Coins Allowed With Every Coin | Easy/Medium | Open ↗ | — | |
| Restore The Array From Adjacent Pairs | Easy/Medium | Open ↗ | — | |
| Task Scheduler | Easy/Medium | Open ↗ | — | |
| Minimum Deletions To Make Character Frequencies Unique | Easy/Medium | Open ↗ | — | |
| Remove K Digits | Easy/Medium | Open ↗ | — | |
| Chocola | Easy/Medium | Open ↗ | — | |
| Non Overlapping Intervals | Easy/Medium | Open ↗ | — | |
| Minimum Deletion Cost To Avoid Repeating Letters | Easy/Medium | Open ↗ | — | |
| Minimum Sum Two Numbers Formed Digits Array 2 | Easy/Medium | Open ↗ | — |
Backtracking
0 / 18
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Combination Sum Ii | Medium | Open ↗ | — | |
| Url | Medium | Open ↗ | — | |
| Combinations | Medium | Open ↗ | — | |
| Subsets Ii | Medium | Open ↗ | — | |
| Url | Medium | Open ↗ | — | |
| Beautiful Arrangement | Medium | Open ↗ | — | |
| Palindrome Partitioning | Medium | Open ↗ | — | |
| Permutations Ii | Medium | Open ↗ | — | |
| Subsets | Hard | Open ↗ | — | |
| Sudoku Solver | Hard | Open ↗ | — | |
| N Queens | Hard | Open ↗ | — | |
| Unique Paths Iii | Hard | Open ↗ | — | |
| Find Maximum Number Possible By Doing At Most K Swaps | Hard | Open ↗ | — | |
| Partition Set K Subsets Equal Sum | Hard | Open ↗ | — | |
| Tug Of War | Hard | Open ↗ | — | |
| Find Paths From Corner Cell To Middle Cell In Maze | Hard | Open ↗ | — | |
| Solving Cryptarithmetic Puzzles Backtracking 8 | Hard | Open ↗ | — | |
| Print Palindromic Partitions String | Hard | Open ↗ | — |