{"id":20821348,"url":"https://github.com/prakharjadaun/dsa","last_synced_at":"2025-05-07T16:22:49.365Z","repository":{"id":53898879,"uuid":"513027775","full_name":"prakharjadaun/DSA","owner":"prakharjadaun","description":"Repository contains implementation of different data structures and problems related to them.","archived":false,"fork":false,"pushed_at":"2024-04-06T05:25:43.000Z","size":582,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-31T11:51:14.206Z","etag":null,"topics":["competitive-programming","data-structures","dsa-learning-series","dynamic-programming","implementation-of-algorithms","interview","leetcode-solutions","placement-preparation","problem-solving"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/prakharjadaun.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-07-12T06:38:04.000Z","updated_at":"2023-09-16T09:34:43.000Z","dependencies_parsed_at":"2024-01-13T10:03:40.772Z","dependency_job_id":"8651923c-6315-47a9-b15c-ab8cbb54504f","html_url":"https://github.com/prakharjadaun/DSA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prakharjadaun%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prakharjadaun%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prakharjadaun%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/prakharjadaun%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/prakharjadaun","download_url":"https://codeload.github.com/prakharjadaun/DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252913265,"owners_count":21824128,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["competitive-programming","data-structures","dsa-learning-series","dynamic-programming","implementation-of-algorithms","interview","leetcode-solutions","placement-preparation","problem-solving"],"created_at":"2024-11-17T22:12:00.389Z","updated_at":"2025-05-07T16:22:49.344Z","avatar_url":"https://github.com/prakharjadaun.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n  \u003cbr\u003e \n  \u003cimg src=\"https://svg-banners.vercel.app/api?type=glitch\u0026text1=DSA🔥\u0026width=1100\u0026height=400\" alt=\"Markdownify\" width=\"800\" height=\"300\"\u003e\u003c/a\u003e\n  \u003cbr\u003e\n    Master Data Structures and Algorithms with ease\n  \u003cbr\u003e\n\u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"#Arrays\"\u003eArrays\u003c/a\u003e •\n  \u003ca href=\"#Strings\"\u003eStrings\u003c/a\u003e •\n  \u003ca href=\"#Bitwise-Operations\"\u003eBitwise Manip.\u003c/a\u003e •\n  \u003ca href=\"#Linked-List\"\u003eLinked List\u003c/a\u003e •\n  \u003ca href=\"#Queue\"\u003eQueue\u003c/a\u003e •\n  \u003ca href=\"#Stack\"\u003eStack\u003c/a\u003e •\n  \u003ca href=\"#Hash-Table\"\u003eHash Table\u003c/a\u003e •\n  \u003ca href=\"#Sorting\"\u003eSorting\u003c/a\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n    \u003ca href=\"#Searching\"\u003eSearching\u003c/a\u003e •\n    \u003ca href=\"#Recursion\"\u003eRecursion\u003c/a\u003e •\n    \u003ca href=\"#Binary-Tree\"\u003eBinary Tree\u003c/a\u003e •\n    \u003ca href=\"#Binary-Search-Tree\"\u003eBinary Search Tree\u003c/a\u003e •\n    \u003ca href=\"#Graph\"\u003eGraph\u003c/a\u003e •\n    \u003ca href=\"#Dynamic-Programming\"\u003eDynamic Programming\u003c/a\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n    \u003ca href=\"#Numbers\"\u003eNumbers\u003c/a\u003e •\n    \u003ca href=\"#Favorites\"\u003e\u003cb\u003eFavorites\u003c/b\u003e\u003c/a\u003e\n    \u003cbr\u003eCount : 471\u003c/br\u003e\n\u003c/p\u003e\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eNumbers\u003c/b\u003e\u003c/h2\u003e\n\n- [Ugly Numbers](https://leetcode.com/problems/ugly-number/description/)\n- [Power of x^n](https://leetcode.com/problems/powx-n/)\n- [Insert Interval](https://leetcode.com/problems/insert-interval/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Minimum number of arrows to burst balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Max points on a line](https://leetcode.com/problems/max-points-on-a-line/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eArrays\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Programs**\n\n- Reverse an array.\n- Maximum and minimum element in the array.\n- Kth Smallest Element of Array\n- Sort an array of 0s, 1s and 2s\n- Sort an array of 0s, 1s and 2s (two pointer approach)\n- Move all negative numbers to beginning and positive to end.\n- Find the count of union of the two arrays\n- Rotate an array by 1 in the clockwise direction\n- Print all permutations of array\n- [Kids with the greatest number of candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/description/)\n- [Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/description/)\n- [Decompress run length encoded list](https://leetcode.com/problems/decompress-run-length-encoded-list/description/)\n- [Count items matching a rule](https://leetcode.com/problems/count-items-matching-a-rule/description/)\n- [Widest vertical area between two points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/description/)\n- [Rearranging the array elements by sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/description/)\n- [Largest Altitude of biker](https://leetcode.com/problems/find-the-highest-altitude/description/)\n- [Count Number of Distinct Integers After Reverse](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/)\n- [Triangular Sum of an array](https://leetcode.com/problems/find-triangular-sum-of-an-array/description/)\n- [Jewels in Stones](https://leetcode.com/problems/jewels-and-stones/description/)\n- [Minimum Sum of four digits number after splitting](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/description/)\n- [Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/description/)\n- [Move Zeros](https://leetcode.com/problems/move-zeroes/description/)\n- [Matrix Diagonal sum](https://leetcode.com/problems/matrix-diagonal-sum/description/)\n- [Flip an image](https://leetcode.com/problems/flipping-an-image/description/)\n- [Missing number](https://leetcode.com/problems/missing-number/description/)\n- [Happy number](https://leetcode.com/problems/happy-number/description/)\n- [Maximum ice cream](https://leetcode.com/problems/maximum-ice-cream-bars/description/)\n- [N unique integers which sum up to zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/description/)\n- [Monotonic Array](https://leetcode.com/problems/monotonic-array/description/)\n- [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/description/)\n- [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/description/)\n- [Sort array by parity](https://leetcode.com/problems/sort-array-by-parity/description/)\n- [Separate Digits in array](https://leetcode.com/problems/separate-the-digits-in-an-array/description/)\n- [Third max number](https://leetcode.com/problems/third-maximum-number/description/)\n- [Is subarray Exists with sum 0](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0)\n- [Lonely Numbers in the array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/description/)\n- [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/description/)\n- [Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/description/)\n- [Shuffle an array](https://leetcode.com/problems/shuffle-an-array/description/)\n- [Find winner on a tic tac toe game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/description/)\n- [Check if every row and column contains all numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/description/)\n- [Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/)\n- [Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/description/)\n- [Peak Index in a mountain array](https://leetcode.com/problems/peak-index-in-a-mountain-array/description/)\n- [Find a peak element](https://leetcode.com/problems/find-peak-element/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n\n#### **Problems**\n\n- Largest Sum Contiguous Subarray (Kadane’s Algorithm)\n- Difference of two arrays\n- Intersection of two arrays\n- [3 Sum](https://leetcode.com/problems/3sum/description/)\n- [2 Sum](https://leetcode.com/problems/two-sum/description/)\n- [4 Sum](https://leetcode.com/problems/4sum/description/)\n- [Palindrome](https://leetcode.com/problems/palindrome-number/description/)\n- [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)\n- [Length of last word](https://leetcode.com/problems/length-of-last-word/description/)\n- [Plus One (adding one to an array representing a large number)](https://leetcode.com/problems/plus-one/description/)\n- [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)\n- [Valid Palindrome String](https://leetcode.com/problems/valid-palindrome/description/)\n- [Middle Of Threee](https://practice.geeksforgeeks.org/problems/middle-of-three2926/1?page=1\u0026category[]=Numbers\u0026sortBy=submissions)\n- [Median of two sorted arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/description/)\n- [Reverse Integer](https://leetcode.com/problems/reverse-integer/description/)\n- [Remove element](https://leetcode.com/problems/remove-element/description/)\n- [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/description/)\n- [3 sum closest](https://leetcode.com/problems/3sum-closest/description/)\n- [Word Pattern](https://leetcode.com/problems/word-pattern/description/)\n- [Sort Colors](https://leetcode.com/problems/sort-colors/description/)\n- [Build array from permutation](https://leetcode.com/problems/build-array-from-permutation/description/)\n- [Shuffle the array](https://leetcode.com/problems/shuffle-the-array/description/)\n- [Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/description/)\n- [Strictly Palidromic Number](https://leetcode.com/problems/strictly-palindromic-number/)\n- [Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/description/)\n- [Squares of a sorted array](https://leetcode.com/problems/squares-of-a-sorted-array/description/)\n- [Rotate image](https://leetcode.com/problems/rotate-image/description/)\n- [Merge Intervals](https://leetcode.com/problems/merge-intervals/description/)\n- [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/description/)\n- [Sort the students](https://leetcode.com/problems/sort-the-students-by-their-kth-score/description/)\n- [Largest Number](https://leetcode.com/problems/largest-number/description/)\n- [Sort the number of 1 bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/description/)\n- [Check if matrix is X-matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/description/)\n- [Group anagrams](https://leetcode.com/problems/group-anagrams/description/)\n- [Add to array form](https://leetcode.com/problems/add-to-array-form-of-integer/description/)\n- [Find all the numbers that disappeared in an array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/)\n- [Rotate the array](https://leetcode.com/problems/rotate-array/description/)\n- [Find lucky number](https://leetcode.com/problems/find-lucky-integer-in-an-array/description/)\n- [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/description/)\n- Disarrange Balls\n- [Count rows with max 1](https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1)\n- [Relative Sort Array](https://leetcode.com/problems/relative-sort-array/description/)\n- [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/description/)\n- [Successful pairs of potions and spells](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/)\n- [Valid mountain array](https://leetcode.com/problems/valid-mountain-array/)\n- [Longest mountain array](https://leetcode.com/problems/longest-mountain-in-array/description/)\n\n#### **Matrix**\n\n- [Matrix rotation by 90 degree](https://leetcode.com/problems/rotate-image/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Set Matrix Zeros](https://leetcode.com/problems/set-matrix-zeroes/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Reshape the matrix](https://leetcode.com/problems/reshape-the-matrix/description/)\n- [Search in a matrix](https://leetcode.com/problems/search-a-2d-matrix/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Is Valid Sudoku](https://leetcode.com/problems/valid-sudoku/submissions/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Sort the matrix diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eStrings\u003c/b\u003e\u003c/h2\u003e\n\n- String Basics\n- Print all permutations of the string\n- Subsequences of string\n- Longest recurring subsequence of a string\n- [Add Binary](https://leetcode.com/problems/add-binary/description/)\n- [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/)\n- [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)\n- [Maximum number of words found in a sentence](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/description/)\n- [Defang Ip address](https://leetcode.com/problems/defanging-an-ip-address/description/)\n- [Restore strings](https://leetcode.com/problems/shuffle-string/description/)\n- [Interpret Goal](https://leetcode.com/problems/goal-parser-interpretation/description/)\n- [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/description/)\n- [Merge strings alternatively](https://leetcode.com/problems/merge-strings-alternately/description/)\n- [Valid anagram](https://leetcode.com/problems/valid-anagram/description/)\n- [Find the difference](https://leetcode.com/problems/find-the-difference/description/)\n- [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/description/)\n- [Number of good ways to split a string](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/description/)\n- [Counting words with a given prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/)\n- [Greatest common divisor of strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/description/)\n- [Check distance between same letters](https://leetcode.com/problems/check-distances-between-same-letters/description/)\n- [Number of different integers in the string](https://leetcode.com/problems/number-of-different-integers-in-a-string/description/)\n- [Check whether two string are rotation of each other or not](https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/)\n- [Longest Palindromic Substring](https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string3411/1)\n- [Most common words](https://leetcode.com/problems/most-common-word/description/)\n- [DI String match](https://leetcode.com/problems/di-string-match/description/)\n- [Count prefixes of a given string](https://leetcode.com/problems/count-prefixes-of-a-given-string/description/)\n- [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/description/)\n- [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/description/)\n- [Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/description/)\n- [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/description/)\n- [Percentage of a letter](https://leetcode.com/problems/percentage-of-letter-in-string/description/)\n- [Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/description/)\n- [Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/description/)\n- [Circular Sentence](https://leetcode.com/problems/circular-sentence/description/)\n- [Isomorphic strings](https://leetcode.com/problems/isomorphic-strings/description/)\n- [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/)\n- [Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/description/)\n- [Second largest digit in a string](https://leetcode.com/problems/second-largest-digit-in-a-string/description/)\n- [Sort a sentence](https://leetcode.com/problems/sorting-the-sentence/description/)\n- [Summary ranges](https://leetcode.com/problems/summary-ranges/description/)\n- [Robot return to origin](https://leetcode.com/problems/robot-return-to-origin/description/)\n- [Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/description/)\n- [Reverse prefix of word](https://leetcode.com/problems/reverse-prefix-of-word/description/)\n- [Determine color of a chessboard square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/description/)\n- [Partition String](https://leetcode.com/problems/optimal-partition-of-string/description/)\n- [Minimum number of steps to make two strings anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/description/)\n- [Goat Latin](https://leetcode.com/problems/goat-latin/description/)\n- [Smallest string with a given numeric value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/description/)\n- [Check if a word occurs as a prefix of any word in a sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/description/)\n- [Count pairs of similar strings](https://leetcode.com/problems/count-pairs-of-similar-strings/description/)\n- [Add string](https://leetcode.com/problems/add-strings/description/)\n- [Is Subsequence](https://leetcode.com/problems/is-subsequence/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Buddy Strings](https://leetcode.com/problems/buddy-strings/description/)\n- [Bulls and cows](https://leetcode.com/problems/bulls-and-cows/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eBitwise Operations\u003c/b\u003e\u003c/h2\u003e\n\n- Understanding Bitwise operators.\n- Binary Representation of number.\n- [Find the number that appears once.](https://leetcode.com/problems/single-number/description/)\n- [Detect if two integers have opposite signs](https://www.geeksforgeeks.org/detect-if-two-integers-have-opposite-signs/)\n- [Add 1 to a number when all the arithmetic operators are not allowed](https://www.geeksforgeeks.org/add-1-to-a-given-number/)\n- [Mutliply with 3.5 without 'x' and '/' operator](https://www.geeksforgeeks.org/multiply-an-integer-with-3-5/)\n- [Turn off the rightmost set bit](https://www.geeksforgeeks.org/turn-off-the-rightmost-set-bit/)\n- [Find whether a given number is a power of 4 or not](https://www.geeksforgeeks.org/find-whether-a-given-number-is-a-power-of-4-or-not/#discuss)\n- [Compute modulus division by a power-of-2-number](https://www.geeksforgeeks.org/compute-modulus-division-by-a-power-of-2-number/)\n- [Rotate Bits](https://practice.geeksforgeeks.org/problems/rotate-bits4524/1?utm_source=gfg)\n- [Hamming weights (Number of 1 bits)](https://leetcode.com/problems/number-of-1-bits/description/)\n- [Reverse Bits](https://leetcode.com/problems/reverse-bits/description/)\n- [Power Of two](https://leetcode.com/problems/power-of-two/description/)\n- [Bitwise \u0026 of numbers in range](https://leetcode.com/problems/bitwise-and-of-numbers-range/description/)\n- [Find the duplicate number](https://leetcode.com/problems/find-the-duplicate-number/)\n- [Party of couples (Find number with odd frequency)](https://practice.geeksforgeeks.org/problems/alone-in-couple5507/1)\n- [Check for Integer Overflow](https://www.geeksforgeeks.org/check-for-integer-overflow/)\n- [Count bit flips(Number of bits to be changed to convert one number to another)](https://practice.geeksforgeeks.org/problems/bit-difference-1587115620/1)\n- [Efficient way to multiply by 7](https://www.geeksforgeeks.org/efficient-way-to-multiply-with-7/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eLinked List\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Programs**\n\n- Insertion at the end.\n- Insertion at the beginning.\n- Insertion at the middle of the linked list.\n- Deleting the last node.\n- Deleting the first node.\n- Deleting the middle node.\n- Calculating the length of list using iteration and the recursion.\n- Searching an item using iteration and recursion.\n- Implementation of doubly linked list.\n\n#### **Circular Linked List**\n\n- Creating a circular linked list from scratch.\n- Inserting at end and beginning of the circular linked list\n- Deleting the last and the first element of the circular linked list.\n\n#### **Problems**\n\n- Get the Nth node from the last.\n- Detecting a loop in a linked list.\n- Detecting the length of loop in a linked list. (Using Floyd's Cycle detection algorithm)\n- Detect and remove loop from the linked list.\n- Check if single linked list is palindrome or not.\n- Removing Duplicate elements from unsorted linked list.\n- Swapping nodes in a linked list.\n- Merge two sorted linked list.\n- Add two numbers represented by linked list.\n- Rotate a linked list.\n- Find the nth node of the linked list from the end.\n- Convert binary number in a linked list to an integer.\n- [Merge nodes in between zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)\n- [Maximum twin sum](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/description/)\n- [Odd even linked list](https://leetcode.com/problems/odd-even-linked-list/description/)\n- [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/description/)\n- [Design linked list](https://leetcode.com/problems/design-linked-list/description/)\n- [Reorder List](https://leetcode.com/problems/reorder-list/description/)\n- [Swap nodes in pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/)\n- [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/)\n- [Copy Linked list with Random Head](https://leetcode.com/problems/copy-list-with-random-pointer/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Intersection of two linked list](https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1)\n- [Remove nth node from the end of linked list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/)\n- [Reverse List in K Groups](https://leetcode.com/problems/reverse-nodes-in-k-group/submissions/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Flatten a multilevel doubly linked list](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/description/)\n- [Next Greater Node in the Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/description/)\n- [Double a number represented by a linked list](https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eQueue\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Program**\n\n- Basic operations of queue\n- Queue using stack.\n- Priority Queue using STL.\n- Priority Queue using linked list.\n\n#### **Problems**\n\n- [Kth Smallest element in a matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/)\n- [Design a circular queue](https://leetcode.com/problems/design-circular-deque/)\n\n\u003c/details\u003e\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eHash Table\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Programs**\n\n- [Create Hashset](https://leetcode.com/problems/design-hashset/)\n- [Create Hashmap](https://leetcode.com/problems/design-hashmap/description/)\n- [Most Frequent number of following key in an array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/description/)\n- [Keyboard Row](https://leetcode.com/problems/keyboard-row/description/)\n- [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/description/)\n- [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/)\n- [Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/description/)\n\n#### **Problems**\n\n- Find whether an array is a subset of another array\n- Union and Intersection of two linked list.\n- Given an array A[] and a number x, check for pair in A[] with sum as x\n- Minimum delete operations to make all elements of array same.\n- Minimum operations to make all elements equal in array.\n- Maximum distance between two occurrences of same element in array\n- Find duplicates in a given array when elements are not limited to a range\n- Smallest subarray with all occurrences of a most frequent element.\n- Find elements which are present in first array and not in second array.\n- How to check if two subsets are disjoint.\n- Non-overlapping sum of two sets.\n- Find missing elements of a range.\n- Find the kth missing element in increasing sequence which is not present in a given sequence\n- Find pair with greatest pair in array.\n- Minimum number of subsets with distinct elements\n- Remove minimum number of elements such that no common element exist in both array.\n- Count items common to both the lists but with different prices.\n- Ransom Note : check whether string 1 can be constructed from string 2\n- [Decode the message](https://leetcode.com/problems/decode-the-message/description/)\n- [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/description/)\n- [Check if a string is pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/description/)\n- [Merge similar items](https://leetcode.com/problems/merge-similar-items/description/)\n- [Maximum number of balls in a box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/description/)\n- [Two out of three](https://leetcode.com/problems/two-out-of-three/description/)\n- [Sort array by increaing frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/description/)\n- [Top K frequent elements](https://leetcode.com/problems/top-k-frequent-elements/description/)\n- [https://leetcode.com/problems/count-vowel-substrings-of-a-string/description/](https://leetcode.com/problems/count-vowel-substrings-of-a-string/description/)\n- [Replace words](https://leetcode.com/problems/replace-words/description/)\n- [Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/)\n- [Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/description/)\n- [Rings and Rods](https://leetcode.com/problems/rings-and-rods/description/)\n- [Finding the user active minutes](https://leetcode.com/problems/finding-the-users-active-minutes/description/)\n- [Subdomain Visit Counts](https://leetcode.com/problems/subdomain-visit-count/description/)\n- [Players with zero or one losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/description/)\n- [Equal row and column pairs](https://leetcode.com/problems/equal-row-and-column-pairs/description/)\n- [Check whether two strings are almost equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/description/)\n- [Distribute candies](https://leetcode.com/problems/distribute-candies/description/)\n- [Smallest number in infinite set](https://leetcode.com/problems/smallest-number-in-infinite-set/description/)\n- [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Insert delete get random in O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/description/)\n- [Design Underground System](https://leetcode.com/problems/design-underground-system/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eStack\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic programs**\n\n- Basic operations of stack.\n- Implementing stack using queues.\n- Reverse a string using stack.\n\n#### **Problems**\n\n- Find the middle element of the stack in O(1) complexity.\n- Implement stack using a single queue.\n- Reverse individual words.\n- Next Greater Element\n- [Next Smaller Element](https://www.codingninjas.com/codestudio/problems/next-smaller-element_1112581?leftPanelTab=0)\n- Valid parenthesis\n- [Minimum remove to make valid parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/?envType=daily-question\u0026envId=2024-04-06)\n- [Design a stack with increment operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/description/)\n- [Baseball game](https://leetcode.com/problems/baseball-game/description/)\n- [Min stack](https://leetcode.com/problems/min-stack/description/)\n- [Removing stars from a string](https://leetcode.com/problems/removing-stars-from-a-string/description/)\n- [Simply Path](https://leetcode.com/problems/simplify-path/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Remove outer parentheses](https://leetcode.com/problems/remove-outermost-parentheses/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eSorting\u003c/b\u003e\u003c/h2\u003e\n\n#### **Types of Sorting Algo and their uses**\n\n- Bubble Sort\n- Insertion Sort\n- Heap Sort\n- [Merge Sort](https://www.codingninjas.com/studio/problems/merge-sort_920442)\n- [Quick sort](https://www.codingninjas.com/studio/problems/quick-sort_983625)\n\n#### **Problems**\n\n- [Smaller number than current](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/description/)\n- [H index](https://leetcode.com/problems/h-index/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Count Inversions (Merge Sort)](https://www.codingninjas.com/studio/problems/count-inversions_615?leftPanelTab=0)\n\n\u003c/details\u003e\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eSearching\u003c/b\u003e\u003c/h2\u003e\n\n- Unordered Linear Search\n- Ordered Linear Search\n- Binary Search\n- Interpolation search\n\n#### **Problems**\n\n- Maximum frequency of an element in array\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eRecursion\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Programs**\n\n- Factorial using recursion\n- Print numbers 1 to N in backwards\n- Fibonacci Series\n- Binary Search\n\n#### **Problems**\n\n- [N Queens problem I](https://leetcode.com/problems/n-queens/description/)\n- [Combination sum](https://leetcode.com/problems/combination-sum/description/)\n- [Fair Distribution of Cookies](https://leetcode.com/problems/fair-distribution-of-cookies/description/)\n- [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eBacktracking\u003c/b\u003e\u003c/h2\u003e\n\n#### **Problems**\n\n- Max Num Of Requests\n- [Letter combination of phone numbers](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/)\n- [Combinations](https://leetcode.com/problems/combinations/description/)\n- [Combination sum II](https://leetcode.com/problems/combination-sum-ii/description/)\n- [Subsets](https://leetcode.com/problems/subsets/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eBinary Tree\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Operations**\n\n- Creation of Binary Tree\n- Traversal in trees : PreOrder, Inorder and Postorder\n- Number of nodes in tree\n- Level Order Traversal Using Queue\n- Deleting a binary tree\n- Compute the height of the binary tree using recursion.\n- Compute the height of the binary tree without recursion.\n- Number of leaf nodes in a binary tree.\n- [Diameter Of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/description/)\n- [PreOrder Traversal without recursion](https://leetcode.com/problems/binary-tree-preorder-traversal/description/)\n- [Level order traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/)\n- [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/description/)\n- [Deepest Leave Sum](https://leetcode.com/problems/deepest-leaves-sum/description/)\n- [To sum tree](https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1)\n- [Boundary Traversal](https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/0)\n- [Top view](https://www.codingninjas.com/codestudio/problems/top-view-of-the-tree_799401?leftPanelTab=0)\n- [Bottom View](https://www.codingninjas.com/codestudio/problems/bottom-view-of-binary-tree_893110?leftPanelTab=0)\n- [Diagonal traversal](https://www.codingninjas.com/studio/problems/diagonal-traversal-of-a-binary-tree_920477?leftPanelTab=0)\n- [Leaf at same level](https://practice.geeksforgeeks.org/problems/leaf-at-same-level/1)\n  \n#### **Problems**\n\n- Mirror of the tree.\n- Preorder Traversal Without Recursion.\n- Find the maximum element of the binary tree using recursion.\n- Find the maximum element of the bianry tree without recursion.\n- Algorithm to search an element in a bianry tree.\n- Algorithm to search an element in a binary tree without recursion.\n- Finding the deepest node in a binary tree.\n- Deletion in binary tree.\n- Check if two binary trees are structurally identical.\n- Find level with max sum.\n- Find the sum of all the nodes in a binary tree.\n- Check if two binary trees are mirror of each other.\n- Print All Ancestors of a node.\n- Print right view of the tree using level order traversal\n- [Zigzag level order traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/)\n- [Flatten binary tree to linked list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/)\n- [Construct string from binary tree(Parethesis)](https://leetcode.com/problems/construct-string-from-binary-tree/description/)\n- [Reverse odd levels](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/description/)\n- [Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/description/)\n- [Remove leaf nodes with a given value](https://leetcode.com/problems/delete-leaves-with-a-given-value/description/)\n- [Evaluate a boolean binary tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/description/)\n- [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/description/)\n- [Average of levels of binary tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/description/)\n- [Leaf similar trees](https://leetcode.com/problems/leaf-similar-trees/description/)\n- [Binary Tree tilt](https://leetcode.com/problems/binary-tree-tilt/description/)\n- [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/description/)\n- [Has Path Sum](https://leetcode.com/problems/path-sum/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Sum of left leaves](https://leetcode.com/problems/sum-of-left-leaves/description/)\n- [Binary Trees Max Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/description/)\n- [Lowest Common Ancestor](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/)\n- [Minimum Depth of binary tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/)\n- [All nodes distance k in binary tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/)\n- [Count complete tree nodes](https://leetcode.com/problems/count-complete-tree-nodes/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Count Nodes Equal to Average of subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eBinary Search Tree\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic Operations**\n\n- Creating a binary search tree.\n- Find the maximum and the minimum element of the binary search tree\n- Searching in the binary search tree\n- Printing the InOrder Predecessor and Successor of an element.\n\n#### **Problems**\n\n- [Validate BST](https://leetcode.com/problems/validate-binary-search-tree/)\n- [Convert Sorted Array to BST](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)\n- [Kth Smallest element in BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/)\n- [Mode in BST](https://leetcode.com/problems/find-mode-in-binary-search-tree/description/)\n- [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/)\n- [Combining elements of two BST in ascending order](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)\n- [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/description/)\n- [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/description/)\n- [Unique BSTs (catalan numbers)](https://leetcode.com/problems/unique-binary-search-trees/description/)\n- [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eGraph\u003c/b\u003e\u003c/h2\u003e\n\n#### **Basic programs**\n\n- Creation of adjacency matrix\n- Creation of adjacency list\n- Using adjacency list to store the weights\n- Tranpose of adjacency list\n- Breadth first search implementation using queue \u0026 adjacency matrix\n- Depth first search implementation using stack\n- BFS using adjacency list\n- DFS using adjacency list\n- [Prims Algo](https://www.codingninjas.com/codestudio/problem-details/prim-s-mst_1095633)\n- [Detect Cycle in directed graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1)\n- [Detect Cycle in directed graph (Using Topological Sort)](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1)\n- [Find the center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/description/)\n- [Dijsktra Algo using priority queue](https://www.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1)\n- [Dijsktra Algo using set](https://www.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1)\n- [Bellman ford algo](https://www.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1)\n- [Floyd warshall algo](https://www.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1)\n\n#### **Problems**\n\n- Connected Components\n- [Number of provinces](https://leetcode.com/problems/number-of-provinces/description/)\n- [Number of islands](https://leetcode.com/problems/number-of-islands/description/)\n- [Flood Fill](https://leetcode.com/problems/flood-fill/description/)\n- [Rotten Oranges](https://leetcode.com/problems/rotting-oranges/description/)\n- [Detect a cycle in undirected graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1)\n- [01 Matrix (distance to nearest 0)](https://leetcode.com/problems/01-matrix/description/)\n- [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/description/)\n- [Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/description/)\n- [Number of unique islands](https://practice.geeksforgeeks.org/problems/number-of-distinct-islands/1)\n- [Eventual Safe State](https://practice.geeksforgeeks.org/problems/eventual-safe-states/1)\n- [Topological Sort Using DFS](https://practice.geeksforgeeks.org/problems/topological-sort/1?utm_source=gfg\u0026utm_medium=article\u0026utm_campaign=bottom_sticky_on_article)\n- [Topological Sort using Kahns Algo (BFS)](https://practice.geeksforgeeks.org/problems/topological-sort/1?utm_source=gfg\u0026utm_medium=article\u0026utm_campaign=bottom_sticky_on_article)\n- [Course Schedule (Topological Sort)](https://leetcode.com/problems/course-schedule/description/)\n- [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/description/)\n- [Alien Dictionary](https://practice.geeksforgeeks.org/problems/alien-dictionary/1)\n- [Shortest Path in Direct Acyclic Graph(toposort approach)](https://practice.geeksforgeeks.org/problems/shortest-path-in-undirected-graph/1)\n- [Shortest path in undirected graph having unit distance](https://www.geeksforgeeks.org/problems/shortest-path-in-undirected-graph-having-unit-distance/1)\n- [All path from source](https://leetcode.com/problems/all-paths-from-source-to-target/description/)\n- [Can Visit All Rooms](https://leetcode.com/problems/keys-and-rooms/description/)\n- [Word Search](https://leetcode.com/problems/word-search/description/)\n- [Word Ladder](https://leetcode.com/problems/word-ladder/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eDynamic Programming\u003c/b\u003e\u003c/h2\u003e\n\n- Fibonacci Numbers\n  - Recursive approach\n  - Memoization approach\n  - Dynamic approach\n  - Space optimized approach\n- Catalan Numbers\n  - Recursive approach  \n  - DP approach\n  - Binomial coefficient approach\n  - [Nth Catalan number](https://practice.geeksforgeeks.org/problems/nth-catalan-number0817/1)\n- Minimum operations\n  - [Minimum steps to reach k from 0](https://www.geeksforgeeks.org/minimize-steps-to-reach-k-from-0-by-adding-1-or-doubling-at-each-step/)\n  - [Minimum steps to reach 0 from k](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)\n- Coin change\n  - [Recursive Approach](https://www.geeksforgeeks.org/coin-change-dp-7/)\n  - [Space Optimized Approach](https://www.geeksforgeeks.org/coin-change-dp-7/)\n- Permutations\n  - [Recursive Approach](https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/)\n  - [STL C++ Approach](https://www.geeksforgeeks.org/stdnext_permutation-prev_permutation-c/)\n- [Number of ways to cover distance](https://practice.geeksforgeeks.org/problems/count-number-of-hops-1587115620/1?utm_source=gfg\u0026utm_medium=article\u0026utm_campaign=bottom_sticky_on_article)\n  - [Recursive approach](https://www.geeksforgeeks.org/count-number-of-ways-to-cover-a-distance/)\n  - [Dynamic approach](https://www.geeksforgeeks.org/count-number-of-ways-to-cover-a-distance/)\n  - [More efficient approach (using array of 3)](https://www.geeksforgeeks.org/count-number-of-ways-to-cover-a-distance/)\n- Longest Common Subsequence\n  - [Min Insertions and deletions to make strings equal](https://www.geeksforgeeks.org/minimum-number-deletions-insertions-transform-one-string-another/)\n  - [Longest Common subsequence - leetcode](https://leetcode.com/problems/longest-common-subsequence/description/)\n- [Frog Jump](https://www.codingninjas.com/codestudio/problem-details/frog-jump_3621012)\n  - Recursive approach\n  - Memoization approach\n  - Dynamic approach\n  - Space optimized approach\n\n#### **Problems**\n\n- [Nth Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/)\n- [Min cost climbing stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)\n- [Jump Game](https://leetcode.com/problems/jump-game/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [Put Marbles in Bags](https://leetcode.com/problems/put-marbles-in-bags/description/)\n\n\u003ch2 align=\"center\"\u003e\u003cb\u003eFavorites\u003c/b\u003e\u003c/h2\u003e\n\n- [Find Duplicates](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/)\n- [Xor Beauty](https://leetcode.com/problems/find-xor-beauty-of-array/description/)\n- ['Verifying an alien dictionary'](https://leetcode.com/problems/verifying-an-alien-dictionary/description/)\n- [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/description/)\n- [Permutations in string](https://leetcode.com/problems/permutation-in-string/description/)\n- [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/description/)\n- [Total fruits](https://leetcode.com/problems/fruit-into-baskets/description/)\n- [Maximum number of balloons](https://leetcode.com/problems/maximum-number-of-balloons/description/)\n- [Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)\n- [Naming a company](https://leetcode.com/problems/naming-a-company/description/)\n- [As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/description/)\n- [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/description/)\n- [Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/description/)\n- [Missing Number](https://practice.geeksforgeeks.org/problems/missing-number-in-array1416/1)\n- [Max Product Of Subarray](https://leetcode.com/problems/maximum-product-subarray/description/)\n- [Boats to save people](https://leetcode.com/problems/boats-to-save-people/description/)\n- [Minimize \u0026 maximum of array](https://leetcode.com/problems/minimize-maximum-of-array/description/)\n- [Teemo Attacking](https://leetcode.com/problems/teemo-attacking/description/)\n- [Divisor Game](https://leetcode.com/problems/divisor-game/description/)\n- [Sqrt(x)](https://leetcode.com/problems/sqrtx/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [LRU Cache](https://leetcode.com/problems/lru-cache/description/?envType=study-plan-v2\u0026envId=top-interview-150)\n- [First missing positive](https://leetcode.com/problems/first-missing-positive/description/)\n- [Frequency of limited range elements](https://practice.geeksforgeeks.org/problems/frequency-of-array-elements-1587115620/1)\n- [wo Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)\n- [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/description/)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprakharjadaun%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fprakharjadaun%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprakharjadaun%2Fdsa/lists"}