[ { "title": "Reverse an Array/String", "url": "https://leetcode.com/problems/reverse-string/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Reverse+an+Array+String+lovebabbar", "textSolution": "" }, { "title": "Find the maximum and minimum element in an array", "url": "https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/", "difficulty": "easy", "tag": "Array", "pattern": [ "Basic" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": false, "count": 2, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Find+maximum+and+minimum+element+in+array+lovebabbar", "textSolution": "" }, { "title": "Kth Largest Element in an Array", "url": "https://leetcode.com/problems/kth-largest-element-in-an-array/", "difficulty": "medium", "tag": "Array", "pattern": [ "Heap", "QuickSelect" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": true, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Kth+Largest+Element+in+an+Array+neetcode", "textSolution": "" }, { "title": "Sort Colors (Sort 0s, 1s and 2s)", "url": "https://leetcode.com/problems/sort-colors/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer", "Dutch National Flag" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": true, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Sort+Colors+striver", "textSolution": "" }, { "title": "Move all the negative elements to one side", "url": "https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Move+all+negative+elements+to+one+side+lovebabbar", "textSolution": "" }, { "title": "Find the Union and Intersection of two sorted arrays", "url": "https://www.geeksforgeeks.org/union-and-intersection-of-two-sorted-arrays-2/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer", "HashSet" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Union+and+Intersection+of+two+sorted+arrays+lovebabbar", "textSolution": "" }, { "title": "Cyclically rotate an array by one", "url": "https://www.geeksforgeeks.org/c-program-cyclically-rotate-array-one/", "difficulty": "easy", "tag": "Array", "pattern": [ "Array" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Cyclically+rotate+an+array+by+one+lovebabbar", "textSolution": "" }, { "title": "Maximum Subarray (Kadane's Algorithm)", "url": "https://leetcode.com/problems/maximum-subarray/", "difficulty": "medium", "tag": "Array", "pattern": [ "Kadane's Algorithm", "Dynamic Programming" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 8, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": true, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Kadane's+Algorithm+striver", "textSolution": "" }, { "title": "Minimize the Heights II", "url": "https://www.geeksforgeeks.org/minimize-the-maximum-difference-between-the-heights/", "difficulty": "medium", "tag": "Array", "pattern": [ "Greedy", "Sorting" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Minimize+the+Heights+II+lovebabbar", "textSolution": "" }, { "title": "Jump Game II (Minimum jumps)", "url": "https://leetcode.com/problems/jump-game-ii/", "difficulty": "medium", "tag": "Array", "pattern": [ "Greedy", "DP" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Minimum+jumps+to+reach+end+lovebabbar", "textSolution": "" }, { "title": "Find the Duplicate Number", "url": "https://leetcode.com/problems/find-the-duplicate-number/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer", "Floyd's Cycle Finding" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Find+the+Duplicate+Number+striver", "textSolution": "" }, { "title": "Merge Sorted Array", "url": "https://leetcode.com/problems/merge-sorted-array/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer", "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Merge+Sorted+Array+striver", "textSolution": "" }, { "title": "Merge Intervals", "url": "https://leetcode.com/problems/merge-intervals/", "difficulty": "medium", "tag": "Interval", "pattern": [ "Intervals", "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Merge+Intervals+striver", "textSolution": "" }, { "title": "Next Permutation", "url": "https://leetcode.com/problems/next-permutation/", "difficulty": "medium", "tag": "Array", "pattern": [ "Array", "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Next+Permutation+striver", "textSolution": "" }, { "title": "Count Inversions", "url": "https://www.geeksforgeeks.org/counting-inversions/", "difficulty": "medium", "tag": "Array", "pattern": [ "Divide and Conquer", "Merge Sort" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Count+Inversions+striver", "textSolution": "" }, { "title": "Best Time to Buy and Sell Stock", "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/", "difficulty": "easy", "tag": "Array", "pattern": [ "Sliding Window", "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 8, "top100": true, "lovebabbar": true, "striver": true, "neetcode": true, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Best+Time+to+Buy+and+Sell+Stock+neetcode", "textSolution": "" }, { "title": "Two Sum", "url": "https://leetcode.com/problems/two-sum/", "difficulty": "easy", "tag": "Array", "pattern": [ "HashMap" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 8, "top100": true, "lovebabbar": true, "striver": true, "neetcode": true, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": true, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Two+Sum+neetcode", "textSolution": "" }, { "title": "Find common elements in three sorted arrays", "url": "https://www.geeksforgeeks.org/find-common-elements-three-sorted-arrays/", "difficulty": "easy", "tag": "Array", "pattern": [ "Three Pointer" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Find+common+elements+in+three+sorted+arrays+lovebabbar", "textSolution": "" }, { "title": "Rearrange Array Elements by Sign", "url": "https://leetcode.com/problems/rearrange-array-elements-by-sign/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Rearrange+Array+Elements+by+Sign+lovebabbar", "textSolution": "" }, { "title": "Subarray with 0 Sum", "url": "https://www.geeksforgeeks.org/find-if-there-is-a-subarray-with-0-sum/", "difficulty": "medium", "tag": "Array", "pattern": [ "HashMap", "Prefix Sum" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Subarray+with+0+Sum+lovebabbar", "textSolution": "" }, { "title": "Factorial of a Large Number", "url": "https://www.geeksforgeeks.org/factorial-large-number/", "difficulty": "medium", "tag": "Array", "pattern": [ "Math", "Array" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Factorial+of+a+Large+Number+lovebabbar", "textSolution": "" }, { "title": "Maximum Product Subarray", "url": "https://leetcode.com/problems/maximum-product-subarray/", "difficulty": "medium", "tag": "Array", "pattern": [ "Dynamic Programming" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": true, "striver": false, "neetcode": true, "blind75": true, "grind75": false, "apnaCollege": true, "algoPrep": true, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Maximum+Product+Subarray+blind75", "textSolution": "" }, { "title": "Longest Consecutive Sequence", "url": "https://leetcode.com/problems/longest-consecutive-sequence/", "difficulty": "medium", "tag": "Array", "pattern": [ "HashSet", "Union Find" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 5, "top100": true, "lovebabbar": true, "striver": true, "neetcode": true, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": true, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Longest+Consecutive+Sequence+neetcode", "textSolution": "" }, { "title": "Majority Element II (Elements appearing more than n/k times)", "url": "https://leetcode.com/problems/majority-element-ii/", "difficulty": "medium", "tag": "Array", "pattern": [ "Boyer-Moore Voting Algorithm" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": false, "grind75": true, "apnaCollege": false, "algoPrep": true, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Majority+Element+II+striver", "textSolution": "" }, { "title": "Best Time to Buy and Sell Stock III", "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/", "difficulty": "hard", "tag": "Array", "pattern": [ "Dynamic Programming" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Best+Time+to+Buy+and+Sell+Stock+III+lovebabbar", "textSolution": "" }, { "title": "Array Subset of Another Array", "url": "https://www.geeksforgeeks.org/find-whether-an-array-is-subset-of-another-array-set-1/", "difficulty": "easy", "tag": "Array", "pattern": [ "HashMap", "Sorting" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Array+Subset+of+Another+Array+lovebabbar", "textSolution": "" }, { "title": "3Sum", "url": "https://leetcode.com/problems/3sum/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer", "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 7, "top100": true, "lovebabbar": true, "striver": true, "neetcode": true, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=3Sum+neetcode", "textSolution": "" }, { "title": "Trapping Rain Water", "url": "https://leetcode.com/problems/trapping-rain-water/", "difficulty": "hard", "tag": "Array", "pattern": [ "Two Pointer", "Stack", "Dynamic Programming" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": true, "striver": false, "neetcode": true, "blind75": false, "grind75": true, "apnaCollege": true, "algoPrep": true, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Trapping+Rain+Water+neetcode", "textSolution": "" }, { "title": "Chocolate Distribution Problem", "url": "https://www.geeksforgeeks.org/chocolate-distribution-problem/", "difficulty": "easy", "tag": "Array", "pattern": [ "Sorting", "Sliding Window" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 3, "top100": true, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Chocolate+Distribution+Problem+lovebabbar", "textSolution": "" }, { "title": "Minimum Size Subarray Sum", "url": "https://leetcode.com/problems/minimum-size-subarray-sum/", "difficulty": "medium", "tag": "Array", "pattern": [ "Sliding Window", "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Minimum+Size+Subarray+Sum+lovebabbar", "textSolution": "" }, { "title": "Three Way Partitioning", "url": "https://www.geeksforgeeks.org/three-way-partitioning-of-an-array-around-a-given-range/", "difficulty": "easy", "tag": "Array", "pattern": [ "Dutch National Flag" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Three+way+partitioning+lovebabbar", "textSolution": "" }, { "title": "Minimum Swaps to Group All 1s Together", "url": "https://www.geeksforgeeks.org/minimum-swaps-required-group-1s-together/", "difficulty": "medium", "tag": "Array", "pattern": [ "Sliding Window" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Minimum+swaps+required+bring+elements+less+equal+K+together+lovebabbar", "textSolution": "" }, { "title": "Minimum operations to make an array palindrome", "url": "https://www.geeksforgeeks.org/find-minimum-number-of-merge-operations-to-make-an-array-palindrome/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Minimum+operations+to+make+array+palindrome+lovebabbar", "textSolution": "" }, { "title": "Median of Two Sorted Arrays", "url": "https://leetcode.com/problems/median-of-two-sorted-arrays/", "difficulty": "hard", "tag": "Array", "pattern": [ "Binary Search" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 3, "top100": true, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": true, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Median+of+Two+Sorted+Arrays+lovebabbar", "textSolution": "" }, { "title": "Median of Two Sorted Arrays (Equal Size)", "url": "https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/", "difficulty": "hard", "tag": "Array", "pattern": [ "Binary Search" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": true, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Median+of+2+sorted+arrays+of+equal+size+lovebabbar", "textSolution": "" }, { "title": "Remove Duplicates from Sorted Array", "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Remove+Duplicates+from+Sorted+Array+arsh", "textSolution": "" }, { "title": "Set Matrix Zeroes", "url": "https://leetcode.com/problems/set-matrix-zeroes/", "difficulty": "medium", "tag": "Matrix", "pattern": [ "Matrix" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Set+Matrix+Zeroes+striver", "textSolution": "" }, { "title": "Move Zeroes", "url": "https://leetcode.com/problems/move-zeroes/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Move+Zeroes+arsh", "textSolution": "" }, { "title": "Best Time to Buy and Sell Stock II", "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/", "difficulty": "medium", "tag": "Array", "pattern": [ "Greedy", "Peak Valley" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 3, "top100": true, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Best+Time+to+Buy+and+Sell+Stock+II+striver", "textSolution": "" }, { "title": "Maximum Points You Can Obtain from Cards", "url": "https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/", "difficulty": "medium", "tag": "Array", "pattern": [ "Sliding Window" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Maximum+Points+You+Can+Obtain+from+Cards+arsh", "textSolution": "" }, { "title": "Jump Game", "url": "https://leetcode.com/problems/jump-game/", "difficulty": "medium", "tag": "Array", "pattern": [ "Greedy", "DP" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 3, "top100": true, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Jump+Game+arsh", "textSolution": "" }, { "title": "Reverse Pairs", "url": "https://leetcode.com/problems/reverse-pairs/", "difficulty": "hard", "tag": "Array", "pattern": [ "Merge Sort", "Divide and Conquer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Reverse+Pairs+striver", "textSolution": "" }, { "title": "Print all possible combinations of r elements in a given array", "url": "https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/", "difficulty": "medium", "tag": "Array", "pattern": [ "Backtracking", "Recursion" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Print+all+possible+combinations+of+r+elements+arsh", "textSolution": "" }, { "title": "Game of Life", "url": "https://leetcode.com/problems/game-of-life/", "difficulty": "medium", "tag": "Matrix", "pattern": [ "Simulation", "Matrix" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": false, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Game+of+Life+arsh", "textSolution": "" }, { "title": "Max Value of Equation", "url": "https://leetcode.com/problems/max-value-of-equation/", "difficulty": "hard", "tag": "Array", "pattern": [ "Heap", "Sliding Window" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Max+Value+of+Equation+arsh", "textSolution": "" }, { "title": "Insert Delete GetRandom O(1) - Duplicates allowed", "url": "https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/", "difficulty": "hard", "tag": "Array", "pattern": [ "HashMap", "ArrayList" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Insert+Delete+GetRandom+O(1)+Duplicates+allowed+arsh", "textSolution": "" }, { "title": "Largest Rectangle in Histogram", "url": "https://leetcode.com/problems/largest-rectangle-in-histogram/", "difficulty": "hard", "tag": "Stack", "pattern": [ "Monotonic Stack" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Largest+Rectangle+in+Histogram+arsh", "textSolution": "" }, { "title": "Search in Rotated Sorted Array", "url": "https://leetcode.com/problems/search-in-rotated-sorted-array/", "difficulty": "medium", "tag": "Array", "pattern": [ "Binary Search" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 5, "top100": true, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": true, "grind75": false, "apnaCollege": true, "algoPrep": true, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Search+in+Rotated+Sorted+Array+striver", "textSolution": "" }, { "title": "Repeat and Missing Number Array", "url": "https://www.geeksforgeeks.org/find-a-repeating-and-a-missing-number/", "difficulty": "medium", "tag": "Array", "pattern": [ "Math", "Bit Manipulation" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Repeat+and+Missing+Number+Array+striver", "textSolution": "" }, { "title": "Product of Array Except Self", "url": "https://leetcode.com/problems/product-of-array-except-self/", "difficulty": "medium", "tag": "Array", "pattern": [ "Prefix Sum", "Array" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Product+of+Array+Except+Self+neetcode", "textSolution": "" }, { "title": "Find Minimum in Rotated Sorted Array", "url": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/", "difficulty": "medium", "tag": "Array", "pattern": [ "Binary Search" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": true, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Find+Minimum+in+Rotated+Sorted+Array+blind75", "textSolution": "" }, { "title": "Find Pair with Sum in Sorted & Rotated Array", "url": "https://www.geeksforgeeks.org/given-a-sorted-and-rotated-array-find-if-there-is-a-pair-with-a-given-sum/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer", "Binary Search" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Find+Pair+with+Sum+in+Sorted+&+Rotated+Array+apnaCollege", "textSolution": "" }, { "title": "4Sum", "url": "https://leetcode.com/problems/4sum/", "difficulty": "medium", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": true, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=4Sum+striver", "textSolution": "" }, { "title": "Given Sum Pair (Two Sum)", "url": "https://leetcode.com/problems/two-sum/", "difficulty": "easy", "tag": "Array", "pattern": [ "HashMap" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 8, "top100": true, "lovebabbar": true, "striver": true, "neetcode": true, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": true, "arshDSASheet": true, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Given+Sum+Pair+apnaCollege", "textSolution": "" }, { "title": "Kth Smallest Element in a Sorted Matrix", "url": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/", "difficulty": "medium", "tag": "Array", "pattern": [ "Binary Search", "Heap" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Kth+Smallest+Element+apnaCollege", "textSolution": "" }, { "title": "Merge Overlapping Intervals", "url": "https://leetcode.com/problems/merge-intervals/", "difficulty": "medium", "tag": "Interval", "pattern": [ "Intervals" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 6, "top100": true, "lovebabbar": true, "striver": true, "neetcode": false, "blind75": true, "grind75": true, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Merge+Overlapping+Intervals+apnaCollege", "textSolution": "" }, { "title": "Largest Number (Arrange Numbers to Form Biggest Number)", "url": "https://leetcode.com/problems/largest-number/", "difficulty": "medium", "tag": "Array", "pattern": [ "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Arrange+Numbers+to+Form+Biggest+Number+apnaCollege", "textSolution": "" }, { "title": "Space Optimization Using Bit Manipulations", "url": "https://www.geeksforgeeks.org/space-optimization-using-bit-manipulations/", "difficulty": "easy", "tag": "Bit Manipulation", "pattern": [ "Bit Manipulation" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": false, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Space+Optimization+Using+Bit+Manipulations+apnaCollege", "textSolution": "" }, { "title": "Subarray Sums Divisible by K", "url": "https://leetcode.com/problems/subarray-sums-divisible-by-k/", "difficulty": "medium", "tag": "Array", "pattern": [ "Prefix Sum", "HashMap" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 4, "top100": true, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": true, "arshDSASheet": true, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Subarray+Sum+Divisible+K+apnaCollege", "textSolution": "" }, { "title": "Mo's Algorithm", "url": "https://www.geeksforgeeks.org/mos-algorithm-query-square-root-decomposition-set-1-introduction/", "difficulty": "hard", "tag": "Array", "pattern": [ "Square Root Decomposition" ], "revision": false, "solved": false, "leetcode": false, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": true, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Mo's+Algorithm+apnaCollege", "textSolution": "" }, { "title": "Group Anagrams", "url": "https://leetcode.com/problems/group-anagrams/", "difficulty": "medium", "tag": "String", "pattern": [ "HashMap", "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Group+Anagrams+neetcode", "textSolution": "" }, { "title": "Top K Frequent Elements", "url": "https://leetcode.com/problems/top-k-frequent-elements/", "difficulty": "medium", "tag": "Heap", "pattern": [ "Heap", "Bucket Sort" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Top+K+Frequent+Elements+neetcode", "textSolution": "" }, { "title": "Valid Sudoku", "url": "https://leetcode.com/problems/valid-sudoku/", "difficulty": "medium", "tag": "Matrix", "pattern": [ "HashMap", "Matrix" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 2, "top100": false, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": true, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Valid+Sudoku+neetcode", "textSolution": "" }, { "title": "Encode and Decode Strings", "url": "https://leetcode.com/problems/encode-and-decode-strings/", "difficulty": "medium", "tag": "String", "pattern": [ "String" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Encode+and+Decode+Strings+neetcode", "textSolution": "" }, { "title": "Valid Anagram", "url": "https://leetcode.com/problems/valid-anagram/", "difficulty": "easy", "tag": "String", "pattern": [ "HashMap", "Sorting" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": true, "blind75": true, "grind75": false, "apnaCollege": false, "algoPrep": false, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Valid+Anagram+neetcode", "textSolution": "" }, { "title": "Squares of a Sorted Array", "url": "https://leetcode.com/problems/squares-of-a-sorted-array/", "difficulty": "easy", "tag": "Array", "pattern": [ "Two Pointer" ], "revision": false, "solved": false, "leetcode": true, "geeksforgeeks": true, "interviewbit": true, "count": 1, "top100": false, "lovebabbar": false, "striver": false, "neetcode": false, "blind75": false, "grind75": false, "apnaCollege": false, "algoPrep": true, "arshDSASheet": false, "algoMaster": false, "instabyte": false, "interviewMemoryTrick": "", "notes": "", "videoSolution": "https://www.youtube.com/results?search_query=Squares+of+a+sorted+array+algoPrep", "textSolution": "" } ]