This is A complete DSA preparation Course. A DSA self-paced course for ultimate Interview and Placement Preparation
LEETCODE | GEEKSFORGEEKS | INTERVIEWBIT
- Mathematics
- Bits Manipulation
- Recursion
- Arrays
- Searching
- Sorting
- Matrix
- Hashing
- String
- Linked List
- Stack
- Queue
- Tree
- Binary Search Tree
- Heap
- Graph
- Greedy
- Backtracking
- Dynamic Programming
- Trie
π© π§ π₯
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 | Subarray with given sum | code | π© |
2 | Missing number in array | code | π© |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 | Is binary tree heap | code | π© |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
# | Title | Code | Difficulty |
---|---|---|---|
1 | Longest Palindrome | code | π© |
2 | Array Partition | code | π© |
3 | Container With Most Water | code | π§ |
4 | Jump Game | code | π§ |
5 | Gas Station | code | π§ |
# | Title | Code | Difficulty |
---|---|---|---|
1 | Binary Tree Paths | code | π© |
2 | Binary Watch | code | π© |
3 | Sum of All Subset XOR Totals | code | π© |
4 | Maximum Rows Covered by Columns | code | π§ |
5 | Fair Distribution of Cookies | code | π§ |
6 | Maximum Good People Based on Statements | code | π₯ |
7 | Maximum Path Quality of a Graph | code | π₯ |
8 | Number of Valid Move Combinations On Chessboard | code | π₯ |
9 | Maximize Score After N Operations | code | π₯ |
10 | Find Minimum Time to Finish All Jobs | code | π₯ |
# | Title | Code | Difficulty |
---|---|---|---|
1 | Climbing Stairs | code | π© |
2 | Min Cost Climbing Stairs | code | π© |
3 | House Robber | code | π§ |
4 | House Robber II | code | π§ |
5 | Longest Palindromic Substring | code | π§ |
6 | Palindromic Substrings | code | π§ |
7 | Maximum Product Subarray | code | π§ |
8 | Longest Increasing Subsequence | code | π§ |
9 | Longest Common Subsequence | code | π§ |
# | Title | Code | Difficulty |
---|---|---|---|
1 |
Adding your name in the Contributors file [After your contribution is accepted]
-
Open the contributors.md file
-
Mind your number.
-
Do not change the detail of any other contributors.
-
Follow the format - {1. [Your name](link to your gitHub profile)} at the last of the file.
-
Save it.
-
Commit the changes.
-
Make the Pull Request.
CTRL+click
the GIF below
Do star, fork and share the repo to show your support, it would help others too!
β€οΈ Thank you all for Forking this repository β€οΈ