DSA-CRACKER

KO | EN

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #cli #open-source #ai #claude-code #codex #deepseek-harness #dsh-plugin #react #windows #developer-tools

★ 108 Open GitHub ↗

This is an attempt to solve 450 questions carefully curated by Love Babbar.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# DSA-CRACKER

**_If you appreciate my work, please 🌟 this repository. It motivates me. :rocket: :rocket:_**

**DSA CRACKER sheet : [link](https://drive.google.com/file/d/1FMdN_OCfOI0iAeDlqswCiC2DZzD4nPsb/view)**

#### :red_circle: :red_circle: IMPORTANT : If you forked this repo and want to be updated with the changes made to this repo refer [How do I update a GitHub forked repository?](https://stackoverflow.com/questions/7244321/how-do-i-update-a-github-forked-repository)

### :arrow_forward: Update Corner

- Added **Clone A Graph** problem in the [Graphs](#graphs) topic.

# :gift: You Can Contribute.

#### Make a pull request :

- If you think you have the better optimal solution.
- If you have the solution to the unsolved problem marked with "red-cross".

### Hello, folks! <img src="https://raw.githubusercontent.com/MartinHeinz/MartinHeinz/master/wave.gif" width="30px">

This is an attempt to solve 450 questions carefully curated by our very own **[Love Babbar](https://www.youtube.com/watch?v=4iFALQ1ACdA)**.

## Topics

- [Array](#array)
- [Matrix](#matrix)
- [Stack & Queue](#stackqueue)
- [Backtracking](#backtracking)
- [Graphs](#graphs)
- [Linked List](#linkedlist)

## Array

| #   | Title                                                                                                                                                                                                              | Solution           | Time | Space | Difficulty | Note               |
| --- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | ------------------ | ---- | ----- | ---------- | ------------------ |
| 1   | [Reverse an Array](https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/)                                                                                                                   | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 2   | [Find the maximum and minimum element in an array](https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/)                                                                                                 | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 3   | [Find the "Kth" max and min element of an array](https://practice.geeksforgeeks.org/problems/kth-smallest-element/0)                                                                                               | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 4   | [Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0)                                     | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 5   | [Move all the negative elements to one side of the array ](https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space//)                                                      | :heavy_check_mark: | _-_  | -     | -          |
| 6   | [Find the Union and Intersection of the two sorted arrays.](https://practice.geeksforgeeks.org/problems/union-of-two-arrays/0)                                                                                     | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 7   | [Write a program to cyclically rotate an array by one.](https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one/0)                                                                           | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 8   | [find Largest sum contiguous Subarray V. IMP](https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0)                                                                                                     | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 9   | [Minimise the maximum difference between heights V.IMP](https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1)                                                                                    | :heavy_check_mark: | _-_  | _-_   | -          | Revisit            |
| 10  | [Minimum no. of Jumps to reach end of an array](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0)                                                                                             | :heavy_check_mark: | _-_  | _-_   | -          | Revisit            |
| 11  | [find duplicate in an array of N+1 Integers](https://leetcode.com/problems/find-the-duplicate-number/)                                                                                                             | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 12  | [Merge 2 sorted arrays without using Extra space.](https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1)                                                                                      | :heavy_check_mark: | _-_  | _-_   | -          | Revisit            |
| 13  | [Kadane's Algo [V.V.V.V.V IMP]](https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0)                                                                                                                   | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 14  | [Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                                                                                                                                  | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 15  | [Next Permutation ](https://leetcode.com/problems/next-permutation/)                                                                                                                                               | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 16  | [Count Inversion](https://practice.geeksforgeeks.org/problems/inversion-of-array/0)                                                                                                                                | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 17  | [Best time to buy and Sell stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)                                                                                                                  | :heavy_check_mark: | _-_  | _-_   | -          | Pending variations |
| 18  | [find all pairs on integer array whose sum is equal to given number](https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1)                                                                 | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 19  | [find common elements In 3 sorted arrays](https://practice.geeksforgeeks.org/problems/common-elements1132/1)                                                                                                       | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 20  | [Rearrange the array in alternating positive and negative items with O(1) extra space](https://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/)                          | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 21  | [Find if there is any subarray with sum equal to 0](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0)                                                                                             | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 22  | [Find factorial of a large number](https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0)                                                                                                      | :heavy_check_mark: | _-_  | _-_   | -          |                    |
| 23  | [find maximum product subarray ](https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1)                                                                                                       | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 24  | [Find longest coinsecutive subsequence](https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0)                                                                                             | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 25  | [Given an array of size n and a number k, fin all elements that appear more than " n/k " times.](https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/) | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 26  | [Maximum profit by buying and selling a share atmost twice](https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/)                                                             | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 27  | [Find whether an array is a subset of another array](https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0)                                                                                  | :heavy_check_mark: | _-_  | _-_   | -          |
| 28  | [Find the triplet that sum to a given value](https://practice.geeksforgeeks.org/problems/triplet-sum-in-array/0)                                                                                                   | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 29  | [Trapping Rain water problem](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)                                                                                                                   | :heavy_check_mark: | _-_  | _-_   | -          | Revisit            |
| 30  | [Chocolate Distribution problem](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0)                                                                                                     | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 31  | [Smallest Subarray with sum greater than a given value](https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x/0)                                                                   | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 32  | [Three way partitioning of an array around a given value](https://practice.geeksforgeeks.org/problems/three-way-partitioning/1)                                                                                    | :heavy_check_mark: | _-_  | _-_   | -          |                    |
| 33  | [Minimum swaps required bring elements less equal K together ](https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0)                        | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 34  | [Minimum no. of operations required to make an array palindrome](https://practice.geeksforgeeks.org/problems/palindromic-array/0)                                                                                  | :heavy_check_mark: | _-_  | _-_   | -          | -                  |
| 35  | [Median of 2 sorted arrays of equal size](https://www.geeksforgeeks.org/median-of-two-sorted-arrays/)                                                                                                              | :heavy_check_mark: | _-_  | _-_   | -          | Revisit            |
| 36  | [Median of 2 sorted arrays of different size](https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/)                                                                                       | :heavy_check_mark: | _-_  | _-_   | -          | -                  |

## Matrix

| #   | Title                                                                                                                           | Solution           | Time | Space | Difficulty | Note |
| --- | ------------------------------------------------------------------------------------------------------------------------------- | ------------------ | ---- | ----- | ---------- | ---- |
| 1   | [Spiral traversal on a Matrix](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0)                      | :heavy_check_mark: |
| 2   | [Search an element in a matriix](https://leetcode.com/problems/search-a-2d-matrix/)                                             | :heavy_check_mark: |
| 3   | [Find median in a row wise sorted matrix](https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1) | :heavy_check_mark: |
| 4   | [Find row with maximum no. of 1's](https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1)                           | :heavy_check_mark: |
| 5   | [Print elements in sorted order using row-column wise sorted matrix](https://practice.geeksforgeeks.org/problems/sorted-matrix2333/1)                           | :heavy_check_mark: |

## StackQueue

## Backtracking

| #   | Title                                                                                                              | Solution           | Time   | Space | Difficulty | Note |
| --- | ------------------------------------------------------------------------------------------------------------------ | ------------------ | ------ | ----- | ---------- | ---- |
| 1   | [ Rat In A Maze](https://github.com/tarunsinghdev/DSA-CRACKER/blob/main/Backtracking/1_RatInAMazeBacktracking.cpp) | :heavy_check_mark: | _-_    | _-_   | -          |
| 2   | [ N Queens Problem](https://github.com/tarunsinghdev/DSA-CRACKER/blob/main/Backtracking/2_NQueenProblem.cpp)       | :heavy_check_mark: | _-_    | _-_   | -          |
| 3   | [ M coloring Problem](https://github.com/tarunsinghdev/DSA-CRACKER/blob/main/Backtracking/3_ColoringProblem.cpp)   | :heavy_check_mark: | O(n^m) | O(n)  | -          |
| 5   | [ Sudoku Solver](https://github.com/tarunsinghdev/DSA-CRACKER/blob/main/Backtracking/5_SudokuSolver.cpp)           | :heavy_check_mark: | _-_    | _-_   | -          |

## Graphs

## Binary Tree

| #   | Title                                                                                               | Solution           | Time | Space     | Difficulty | Note |
| --- | --------------------------------------------------------------------------------------------------- | ------------------ | ---- | --------- | ---------- | ---- |
| 1   | [Right View of Binary Tree](https://leetcode.com/problems/binary-tree-right-side-view/description/) | :heavy_check_mark: | o(n) | O(n)      | Medium     |
| 2   | [Height of Binary Tree](https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1)        | :heavy_check_mark: | O(N) | O(N)      | Medium     |
| 3   | [Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1)    | :heavy_check_mark: | O(N) | O(log(N)) | Easy       |
| 4   | [Check for Balanced Tree](https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1)    | :heavy_check_mark: | O(N) | O(log(N)) | Easy       |
| 5   | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | :heavy_check_mark: | O(n) | O(n)      | Easy
| 6   | [Bottom View of Binary Tree](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1) | :heavy_check_mark: | O(n) | O(n)      | Medium  |
<br/>
<div align="right">
    <b><a href="#topics">⬆️ Back to Top</a></b>
</div>
<br/>

## Arrays In Javascript Implementation

## LinkedList

| #   | Title                                                                                               | Solution           | Time | Space     | Difficulty | Note |
| --- | --------------------------------------------------------------------------------------------------- | ------------------ | ---- | --------- | ---------- | ---- |
| 1   | [Write a program to Detect loop in a linked list.](https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1) | :heavy_check_mark: | _-_ | _-_      | Easy     | - |
| 2   | [Write a Program to check whether the Singly Linked list is a palindrome or not.](https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1) | :heavy_check_mark: | O(n) | O(n)      | Easy     | - |
| 3   | [Write a Program to Remove duplicate element from sorted Linked List.](https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1) | :heavy_check_mark: | O(n) | O(1)      | Easy     | - |

> You can find me on [![LinkedIn][2.2]][2] to stay updated and follow along with my journey.

[2.2]: https://raw.githubusercontent.com/MartinHeinz/MartinHeinz/master/linkedin-3-16.png

[2]: https://www.linkedin.com/in/tarun-singh-981547191/

DSA-CRACKER

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README