Solutions to the algorithmic problems in LeetCode, GeeksForGeeks, Hackerrank, Interviewbit and Codeforces written in C++ and JAVA
We have solved quite a number of problems from several topics. See the below table for further details.
- Fork the repository
- Do the desired changes (add/delete/modify)
- Make a pull request
If you want to update the readme file as well, you have to install Java and Jsoup. Then you can run the UpdateReadme.java file to update the readme file.
- If there is no solution to a problem in the main branch
- If your solution is asymptotically faster than the one in the main branch
- If your algorithm is of the same time complexity but with reduced code size (In this case, comment out the original solution and make a pull request with your solution.)
- If you have another method of solving the problem which is asymptotically slower than the original method (In this case, comment your solution in the main file and make a pull request.)
- If you want to update the UpdateReadme.java file
- Paste the link for the question within comments.
- Paste the solution.
- Save with proper extension name.
UpdateReadme.java is the main file. It reads information (that are obtained online) from OnlineInfo.csv file. If you have updated the readme file with some online information without adding into csv file, then you need to run OnlineToCSV.java file to read that from readme and store in the csv file.
For difficulty level, csv file is already updated. For other online information columns you'll have to update it.
Number of Problems Solved (25-Jul-2022 22:45:53)
Topic Name | Java | CPP |
---|---|---|
Arrays | 106 | 44 |
BackTracking | 28 | 5 |
Bit-Magic | 28 | 21 |
Codeforces | 76 | 1 |
Disjoint-Set | 4 | 0 |
Dynamic-Programming | 123 | 15 |
Graph | 64 | 19 |
Greedy | 25 | 7 |
Hashing | 43 | 9 |
Heap | 23 | 9 |
Linked-List | 57 | 20 |
Matrix | 44 | 20 |
Miscellaneous | 65 | 3 |
Queue | 6 | 6 |
Recursion | 13 | 12 |
Searching | 36 | 31 |
Segment-Tree | 2 | 0 |
Sorting | 11 | 7 |
Stack | 24 | 7 |
Strings | 79 | 14 |
Tree | 149 | 26 |
Trie | 13 | 2 |
Total | 1019 | 278 |
- C++
- JAVA
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Rearrange Array Alternately 1587115620 | GFG | Java | Medium | O(n) | |
2 | 3sum With Multiplicity | LC | Java | O(n2) | ||
3 | Arithmetic Sequences | BS | Java | O(n2) | ||
4 | Dropped Sensor Metric | BS | CPP | O(1) | ||
5 | K Distinct Window | BS | Java | O(n) | ||
6 | Largest Sublist Sum | BS LC | Java | O(n) | ||
7 | Largest And Smallest Difference | BS | Java | O(n) | ||
8 | Majority Vote | BS LC | Java | O(n) | ||
9 | Maximum Absolute Value Of Sublist | BS | Java | O(n) | ||
10 | Number Of K Length Sublists With Average At Least Target | BS | Java | O(n) | ||
11 | Rain Catcher | BS LC | Java | O(n) | ||
12 | Remove Duplicates Occurring More Than Twice | BS LC | CPP Java | O(n) | ||
13 | Set Split | BS | Java | O(n) | ||
14 | Split String With Same Distinct Counts | BS LC | Java | O(n) | ||
15 | Submajority Vote | BS LC | Java | O(n) | ||
16 | XOR Range Queries | BS | Java | O(n) | ||
17 | Array Of Alternate Ve And Ve Nos1401 | GFG | Java | Easy | O(n2) | |
18 | Bag Of Tokens | LC | Java | O(n) | ||
19 | Best Time To Buy And Sell Stock | LC | CPP | O(1) | ||
20 | Best Time To Buy And Sell Stock Ii | LC GFG | Java | Medium | O(n) | |
21 | Binary Subarrays With Sum | LC | Java | O(n) | ||
22 | Boats To Save People | LC | Java | O(n) | ||
23 | Chocolate Distribution Problem3825 | GFG | Java | Easy | O(n) | |
24 | Common Elements1132 | GFG | Java | Easy | O(n) | |
25 | Contiguous Array | LC | CPP Java | O(n) | ||
26 | Count Number Of Nice Subarrays | LC | Java | O(n) | ||
27 | Count Pairs With Given Sum5022 | GFG | Java | Easy | O(n) | |
28 | Count Smaller Elements2214 | GFG | Java | null | O(n) | |
29 | Count Subarrays With Equal Number Of 1s And 0s 1587115620 | GFG | CPP Java | Medium | O(1) | |
30 | Count Subarrays With Score Less Than K | LC | Java | O(n2) | ||
31 | Count The Subarrays Having Product Less Than K1708 | GFG | Java | Hard | O(n2) | |
32 | Crush | HR | Java | O(n) | ||
33 | Cyclically Rotate An Array By One2614 | GFG | CPP Java | Basic | O(1) | |
34 | Distinct Absolute Array Elements4529 | GFG | CPP Java | Easy | O(n2) | |
35 | Factorials Of Large Numbers2508 | GFG | Java | Medium | O(n2) | |
36 | Find Missing Observations | LC | Java | O(n) | ||
37 | Find Pivot Index | LC GFG | CPP Java | Easy | O(n) | |
38 | Find Target Indices After Sorting Array | LC | Java | O(n) | ||
39 | Find The Duplicate Number | LC | CPP Java | O(n) | ||
40 | Fruit Into Baskets | LC | Java | O(n2) | ||
41 | Insert Interval | LC | CPP Java | O(n) | ||
42 | Intersection Of Two Arrays Ii | LC LC GFG | CPP Java | Easy | O(1) | |
43 | Inversion Of Array 1587115620 | GFG | Java | Medium | O(n) | |
44 | Jump Game | GFG | Java | Medium | O(n) | |
45 | K Divisible Elements Subarrays | LC | Java | O(n) | ||
46 | Kth Smallest Element5635 | GFG | CPP Java | Medium | O(1) | |
47 | Large Factorial4721 | GFG | Java | Medium | O(n) | |
48 | Largest Number Formed From An Array1117 | GFG | Java | Medium | O(n) | |
49 | Leaders In An Array 1587115620 | GFG | CPP Java | Easy | O(1) | |
50 | Longest Consecutive Sequence | LC GFG | Java | Medium | O(n2) | |
51 | Longest Continuous Subarray With Absolute Diff Less Than Or Equal To Limit | LC | Java | O(n2) | ||
52 | Majority Element | LC GFG | CPP | Medium | O(1) | |
53 | Majority Element Ii | LC | CPP | O(1) | ||
54 | Max Circular Subarray Sum 1587115620 | GFG | Java | Hard | O(n) | |
55 | Max Consecutive Ones Iii | LC | Java | O(n2) | ||
56 | Max Distance Between Same Elements | GFG | Java | Easy | O(n) | |
57 | Max Sum Subarray Of Size K5313 | GFG | CPP Java | Basic | O(1) | |
58 | Maximize Number Of 1s0905 | GFG | Java | Medium | O(n) | |
59 | Maximum Difference Of Zeros And Ones In Binary String4111 | GFG | CPP Java | Easy | O(1) | |
60 | Maximum Index 1587115620 | GFG | Java | Medium | O(n2) | |
61 | Maximum Product Subarray3604 | GFG | Java | Medium | O(n) | |
62 | Maximum Product Subset Of An Array | GFG | Java | Medium | O(n) | |
63 | Maximum Subarray | LC GFG | CPP | Medium | O(1) | |
64 | Median Of 2 Sorted Arrays Of Different Sizes | GFG | Java | Hard | O(n) | |
65 | Merge Intervals | LC GFG | CPP Java | Medium | O(1) | |
66 | Merge Two Sorted Arrays5135 | GFG | CPP Java | Hard | O(1) | |
67 | Minimize Maximum Pair Sum In Array | LC | Java | O(n2) | ||
68 | Minimize The Heights3351 | GFG | Java | Medium | O(n) | |
69 | Minimum Number Of Jumps 1587115620 | GFG | Java | Medium | O(n) | |
70 | Minimum Size Subarray Sum | LC | CPP Java | O(1) | ||
71 | Move All Negative Elements To End1813 | GFG | CPP Java | Easy | O(1) | |
72 | Move Zeroes | LC | Java | O(n2) | ||
73 | Next Higher Palindromic Number Using The Same Set Of Digits5859 | GFG | Java | Medium | O(n) | |
74 | Next Permutation | LC | CPP Java | O(1) | ||
75 | Number Of Good Ways To Split A String | LC | CPP | O(1) | ||
76 | Number Of Sub Arrays Of Size K And Average Greater Than Or Equal To Threshold | LC | CPP Java | O(1) | ||
77 | Number Of Subsequences That Satisfy The Given Sum Condition | LC | Java | O(n) | ||
78 | Number Of Zero Filled Subarrays | LC | Java | O(n) | ||
79 | Pairs Of Songs With Total Durations Divisible By 60 | LC | Java | O(n) | ||
80 | Palindrome String0817 | GFG | Java | Easy | O(1) | |
81 | Partition Array Into Three Parts With Equal Sum | LC | CPP Java | O(1) | ||
82 | Partition Array Such That Maximum Difference Is K | LC | Java | O(n) | ||
83 | Partitions | IB | Java | O(n2) | ||
84 | Pick From Both Sides | IB | Java | O(n) | ||
85 | Plus One | GFG | Java | Easy | O(n) | |
86 | Product Of Array Except Self | LC | CPP Java | O(1) | ||
87 | Rearrange An Array With O1 Extra Space3142 | GFG | Java | Medium | O(n2) | |
88 | Remove Duplicates From Sorted Array | LC | CPP Java | O(1) | ||
89 | Replace Elements With Greatest Element On Right Side | LC | Java | O(n2) | ||
90 | Reverse An Array | GFG | CPP Java | School | O(1) | |
91 | Rotate And Delete 1587115621 | GFG | Java | Medium | O(n) | |
92 | Rotate Array | LC | CPP Java | O(1) | ||
93 | Shortest Subarray With Sum At Least K | LC | Java | O(n2) | ||
94 | Shortest Unsorted Continuous Subarray | LC | Java | O(n) | ||
95 | Smallest Subarray With Sum Greater Than X5651 | GFG | Java | null | O(n2) | |
96 | Smallest Subset With Greater Sum | GFG | Java | Easy | O(n) | |
97 | Smallest Sum Contiguous Subarray | GFG | Java | Medium | O(n) | |
98 | Sort An Array Of 0s 1s And 2s4231 | GFG | CPP Java | Easy | O(1) | |
99 | Sort Colors | LC | CPP Java | O(1) | ||
100 | Stickler Theif 1587115621 | GFG | CPP | Easy | O(1) | |
101 | Stock Buy And Sell 1587115621 | GFG | CPP | Medium | O(1) | |
102 | Subarray Sum Equals K | LC | CPP Java | O(1) | ||
103 | Subarray With 0 Sum 1587115621 | GFG | CPP Java | Easy | O(1) | |
104 | Subarray With Given Sum 1587115621 | GFG | CPP Java | Easy | O(1) | |
105 | Subarrays With K Different Integers | LC | Java | O(n) | ||
106 | Sum Of All Odd Length Subarrays | LC | Java | O(n2) | ||
107 | Sum Of Middle Elements Of Two Sorted Arrays2305 | GFG | Java | Medium | O(n) | |
108 | Summary Ranges | LC | Java | O(n) | ||
109 | Three Way Partitioning | GFG | Java | Easy | O(n) | |
110 | Trapping Rain Water | LC | CPP | O(1) | ||
111 | Triplet Sum In Array 1587115621 | GFG | CPP | Medium | O(1) | |
112 | Union Of Two Arrays3538 | GFG | CPP Java | Basic | O(1) | |
113 | Union Of Two Sorted Arrays | GFG | CPP Java | Easy | O(1) | |
114 | Wave Array 1587115621 | GFG | Java | Easy | O(n) | |
115 | Ways To Make A Fair Array | LC | Java | O(n) | ||
116 | Zero Sum Subarrays1825 | GFG | CPP Java | Medium | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Additive Number | LC | Java | O(n) | ||
2 | All Unique Permutations Of An Array | GFG | Java | Medium | O(n) | |
3 | Combination Sum | LC GFG | Java | Medium | O(n) | |
4 | Combination Sum Ii | LC | Java | O(n) | ||
5 | Combination Sum Iii | LC | Java | O(n) | ||
6 | Combination Sum Iv | LC | Java | O(n) | ||
7 | Design Add And Search Words Data Structure | LC | Java | O(n2) | ||
8 | Fair Distribution Of Cookies | LC | Java | O(n) | ||
9 | Find Whether Path Exist5238 | GFG | Java | Medium | O(n2) | |
10 | Generate Parentheses | LC | CPP Java | O(n) | ||
11 | Largest Number In K Swaps 1587115620 | GFG | Java | Medium | O(n2) | |
12 | N Queens | LC | Java | O(n2) | ||
13 | Number Of Paths0926 | GFG | CPP Java | Easy | O(1) | |
14 | Palindrome Partitioning | LC GFG | Java | Hard | O(n) | |
15 | Palindrome Partitioning Ii | LC | Java | O(n) | ||
16 | Partition A Set Into Two Subsets Such That The Difference Of Subset Sums Is Minimum Set 2 | GFG | Java | Hard | O(1) | |
17 | Partition Array To K Subsets | GFG | Java | Hard | O(n) | |
18 | Permutations | LC GFG | CPP Java | Easy | O(1) | |
19 | Permutations Ii | LC | CPP Java | O(n) | ||
20 | Rat In A Maze Problem | GFG | CPP Java | Medium | O(1) | |
21 | Remove Invalid Parentheses | LC | Java | O(n) | ||
22 | Solve The Sudoku 1587115621 | GFG | Java | Hard | O(n2) | |
23 | Split Array Into Fibonacci Sequence | LC | Java | O(n) | ||
24 | Subset Sums Between The Given Range | GFG | Java | Hard | O(1) | |
25 | Travelling Salesman Problem2732 | GFG | Java | Hard | O(n) | |
26 | Word Break Part 23249 | GFG | Java | Hard | O(n2) | |
27 | Word Search | LC | Java | O(n2) | ||
28 | Word Search Ii | LC | Java | O(n2) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Longest Consecutive Run Of 1s In Binary | BS GFG | CPP Java | Easy | O(1) | |
2 | Minimum Updates To Make Bitwise OR Equal To Target | BS | Java | O(n) | ||
3 | Add Binary | LC | CPP Java | O(n) | ||
4 | Bit Difference 1587115620 | GFG | CPP Java | Basic | O(n) | |
5 | Check Whether K Th Bit Is Set Or Not 1587115620 | GFG | CPP Java | Easy | O(n) | |
6 | Count Total Set Bits 1587115620 | GFG | CPP Java | Medium | O(n) | |
7 | Find Position Of Set Bit3706 | GFG | CPP Java | Basic | O(1) | |
8 | Finding The Numbers0215 | GFG | Java | Easy | O(n) | |
9 | Geek And Function V | GFG | Java | Easy | O(n2) | |
10 | Jump Game | GFG | CPP | Medium | O(1) | |
11 | Maximum Subset Xor | GFG | Java | Hard | O(n2) | |
12 | Maximum Xor After Operations | LC | Java | O(n) | ||
13 | Missing Number In Array1416 | GFG | CPP Java | Easy | O(n2) | |
14 | Nth Natural Number | GFG | CPP Java | Hard | O(1) | |
15 | Number Of 1 Bits | LC | CPP Java | O(1) | ||
16 | Number Of Excellent Pairs | LC | Java | O(n) | ||
17 | Permutation Sequence | LC | CPP Java | O(n) | ||
18 | Power Of Two | LC | CPP Java | O(1) | ||
19 | Reverse Bits | LC GFG | CPP Java | Easy | O(1) | |
20 | Single Number | LC | CPP Java | O(n) | ||
21 | Single Number Iii | LC | CPP Java | O(1) | ||
22 | Sort By Set Bit Count1153 | GFG | Java | Easy | O(n) | |
23 | Sum Of Two Integers | LC | CPP Java | O(1) | ||
24 | Sum Of Two Numbers Without Using Arithmetic Operators | GFG | CPP Java | Easy | O(1) | |
25 | Trailing Zeroes In Factorial5134 | GFG | CPP Java | Easy | O(1) | |
26 | Ugly Number | LC | CPP Java | O(1) | ||
27 | Ugly Number Ii | LC | CPP Java | O(1) | ||
28 | X Xor A Is Minimum And Set Bits In X B | GFG | Java | Hard | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 112 A | CF | Java | O(n) | ||
2 | 1141 B | CF | Java | O(n) | ||
3 | 1144 B | CF | Java | O(n) | ||
4 | 115 A | CF | Java | O(n) | ||
5 | 1208 A | CF | Java | O(n) | ||
6 | 1283 A | CF | Java | O(n) | ||
7 | 129 A | CF | Java | O(n) | ||
8 | 1294 A | CF | Java | O(n) | ||
9 | 1296 B | CF | Java | O(n2) | ||
10 | 1311 A | CF | Java | O(n) | ||
11 | 1324 A | CF | Java | O(n2) | ||
12 | 1325 B | CF | Java | O(n2) | ||
13 | 1326 B | CF | Java | O(n) | ||
14 | 1335 B | CF | Java | O(n2) | ||
15 | 1337 B | CF | Java | O(n2) | ||
16 | 1343 B | CF | Java | O(n2) | ||
17 | 1350 A | CF | Java | O(n2) | ||
18 | 1353 B | CF | Java | O(n2) | ||
19 | 1367 B | CF | Java | O(n2) | ||
20 | 1368 A | CF | Java | O(n2) | ||
21 | 1370 A | CF | CPP Java | O(1) | ||
22 | 1374 B | CF | Java | O(n) | ||
23 | 1385 B | CF | Java | O(n2) | ||
24 | 1401 A | CF | Java | O(n) | ||
25 | 141 A | CF | Java | O(n) | ||
26 | 1426 B | CF | Java | O(n4) | ||
27 | 1430 A | CF | Java | O(n) | ||
28 | 1462 C | CF | Java | O(n2) | ||
29 | 1475 B | CF | Java | O(n) | ||
30 | 148 A | CF | Java | O(n) | ||
31 | 1525 B | CF | Java | O(n2) | ||
32 | 1543 B | CF | Java | O(n2) | ||
33 | 1559 B | CF | Java | O(n2) | ||
34 | 1560 B | CF | Java | O(n) | ||
35 | 158 A | CF | Java | O(1) | ||
36 | 1607 H | CF | Java | O(n2) | ||
37 | 1624 B | CF | Java | O(n) | ||
38 | 200 B | CF | Java | O(n) | ||
39 | 231 A | CF | Java | O(n) | ||
40 | 236 A | CF | Java | O(n) | ||
41 | 263 A | CF | Java | O(n2) | ||
42 | 266 B | CF | Java | O(n2) | ||
43 | 282 A | CF | Java | O(n) | ||
44 | 318 A | CF | Java | O(1) | ||
45 | 32 B | CF | Java | O(n) | ||
46 | 320 A | CF | Java | O(n) | ||
47 | 339 A | CF | Java | O(n) | ||
48 | 34 B | CF | Java | O(n) | ||
49 | 4 A | CF | Java | O(1) | ||
50 | 41 A | CF | Java | O(n) | ||
51 | 432 A | CF | Java | O(n) | ||
52 | 439 A | CF | Java | O(n) | ||
53 | 443 A | CF | Java | O(n) | ||
54 | 469 A | CF | Java | O(n) | ||
55 | 474 A | CF | Java | O(n) | ||
56 | 490 A | CF | Java | O(n) | ||
57 | 496 A | CF | Java | O(n) | ||
58 | 50 A | CF | Java | O(1) | ||
59 | 546 A | CF | Java | O(1) | ||
60 | 580 A | CF | Java | O(n) | ||
61 | 59 A | CF | Java | O(n) | ||
62 | 617 A | CF | Java | O(1) | ||
63 | 677 A | CF | Java | O(n) | ||
64 | 702 A | CF | Java | O(n) | ||
65 | 709 A | CF | Java | O(n) | ||
66 | 71 A | CF | Java | O(n) | ||
67 | 711 A | CF | Java | O(n) | ||
68 | 732 A | CF | Java | O(1) | ||
69 | 746 B | CF | Java | O(n) | ||
70 | 749 A | CF | Java | O(n) | ||
71 | 750 A | CF | Java | O(n) | ||
72 | 768 A | CF | Java | O(n) | ||
73 | 977 B | CF | Java | O(n) | ||
74 | 978 B | CF | Java | O(n) | ||
75 | 991 B | CF | Java | O(n) | ||
76 | 999 B | CF | Java | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Accounts Merge | LC | Java | O(n) | ||
2 | Number Of Operations To Make Network Connected | LC | Java | O(n) | ||
3 | Number Of Provinces | LC GFG | Java | Medium | O(n3) | |
4 | Redundant Connection | LC | Java | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 0 1 Knapsack Problem0945 | GFG | CPP Java | Medium | O(n2) | |
2 | Collecting Coins | BS | Java | O(n) | ||
3 | Count Square Submatrices | BS | Java | O(n2) | ||
4 | Delete Characters To Equalize Strings | BS | Java | O(n2) | ||
5 | Equal Partitions | BS LC | Java | O(n) | ||
6 | Largest Sum Of Non Adjacent Numbers | BS | Java | O(n) | ||
7 | Longest Bitonic Subsequence | BS | Java | O(n) | ||
8 | Longest Common Substring | BS GFG | Java | Medium | O(n) | |
9 | Longest Increasing Subsequence | BS GFG | Java | Medium | O(n2) | |
10 | Longest Sign Alternating Subsequence | BS | Java | O(n2) | ||
11 | Multiset Sum | BS | Java | O(n) | ||
12 | Palindrome Splitting | BS | Java | O(n) | ||
13 | Rod Cutting | BS | Java | O(n) | ||
14 | Skip Tasks To Minimize Work | BS | Java | O(n) | ||
15 | All Possible Full Binary Trees | LC | Java | O(n2) | ||
16 | Arithmetic Slices | LC | CPP Java | O(n2) | ||
17 | Bbt Counter4914 | GFG | CPP Java | Easy | O(n) | |
18 | Beautiful Arrangement | LC | Java | O(n) | ||
19 | Best Time To Buy And Sell Stock Iv | LC GFG | Java | Hard | O(n2) | |
20 | Box Stacking | GFG | Java | Medium | O(n2) | |
21 | Brackets In Matrix Chain Multiplication1024 | GFG | Java | Hard | O(n) | |
22 | Cherry Pickup Ii | LC | Java | O(n5) | ||
23 | Climbing Stairs | LC GFG | Java | Medium | O(n) | |
24 | Coin Change | LC GFG | Java | Medium | O(n2) | |
25 | Count Digit Groupings Of A Number1520 | GFG | Java | Medium | O(n) | |
26 | Count Number Of Teams | LC | Java | O(n3) | ||
27 | Count Number Of Ways To Place Houses | LC | Java | O(n) | ||
28 | Count Numbers With Unique Digits | LC | Java | O(n2) | ||
29 | Count Palindromic Subsequences | GFG | Java | Medium | O(n2) | |
30 | Count Primes | LC | Java | O(n2) | ||
31 | Count Sorted Vowel Strings | LC | Java | O(n2) | ||
32 | Count Square Submatrices With All Ones | LC | CPP Java | O(n2) | ||
33 | Counting Bits | LC | CPP Java | O(n2) | ||
34 | Cutted Segments1642 | GFG | Java | Medium | O(n) | |
35 | Decode Ways | LC | Java | O(n) | ||
36 | Different Ways To Add Parentheses | LC | Java | O(n3) | ||
37 | Distinct Subsequences | LC | Java | O(n) | ||
38 | Edit Distance3702 | GFG | Java | Medium | O(n2) | |
39 | Friends Pairing Problem5425 | GFG | Java | Easy | O(n) | |
40 | Get Maximum In Generated Array | LC | Java | O(n) | ||
41 | Get Minimum Squares0538 | GFG | Java | Medium | O(n2) | |
42 | Gold Mine Problem2608 | GFG | Java | Easy | O(n2) | |
43 | House Robber | LC | CPP Java | O(n) | ||
44 | House Robber Ii | LC | Java | O(n) | ||
45 | House Robber Iii | LC GFG | Java | Medium | O(1) | |
46 | Integer Break | LC | Java | O(n2) | ||
47 | Integer Replacement | LC | Java | O(n) | ||
48 | Interleaving String | LC | Java | O(n2) | ||
49 | Intersecting Intervals | GFG | Java | Hard | O(n) | |
50 | Is Subsequence | LC | Java | O(n) | ||
51 | K Palindrome | GFG | Java | Easy | O(n2) | |
52 | Knapsack With Duplicate Items4201 | GFG | CPP Java | Easy | O(1) | |
53 | Largest Divisible Subset | LC | Java | O(n2) | ||
54 | Largest Square Formed In A Matrix0806 | GFG | Java | Medium | O(n) | |
55 | Lcs Of Three Strings0028 | GFG | CPP Java | Medium | O(1) | |
56 | Longest Arithmetic Subsequence Of Given Difference | LC | Java | O(n) | ||
57 | Longest Common Subsequence | LC GFG | Java | Medium | O(n3) | |
58 | Longest Common Subsequence 1587115620 | GFG | CPP | Medium | O(1) | |
59 | Longest Common Substring1452 | GFG | CPP | Medium | O(1) | |
60 | Longest Continuous Increasing Subsequence | LC | Java | O(n) | ||
61 | Longest Increasing Path In A Matrix | LC | Java | O(n) | ||
62 | Longest Palindromic Subsequence 1612327878 | GFG | Java | Medium | O(n2) | |
63 | Longest Palindromic Substring | LC | Java | O(n) | ||
64 | Longest Repeating Subsequence2004 | GFG | Java | Easy | O(n2) | |
65 | Matrix Block Sum | LC | Java | O(n3) | ||
66 | Matrix Chain Multiplication0303 | GFG | Java | Hard | O(n3) | |
67 | Maximum Length Of Repeated Subarray | LC | Java | O(n2) | ||
68 | Maximum Profit In Job Scheduling | LC | Java | O(n2) | ||
69 | Maximum Score Words Formed By Letters | LC | Java | O(n2) | ||
70 | Maximum Sum Increasing Subsequence4749 | GFG | Java | Medium | O(n2) | |
71 | Maximum Sum Of Elements Not Part Of Lis | GFG | Java | Medium | O(n2) | |
72 | Min Cost Climbing Stairs | LC | Java | O(n) | ||
73 | Minimize The Difference Between Target And Chosen Elements | LC | Java | O(n3) | ||
74 | Minimum Ascii Delete Sum For Two Strings | LC | Java | O(n2) | ||
75 | Minimum Cost For Tickets | LC | Java | O(n2) | ||
76 | Minimum Cost To Fill Given Weight In A Bag1956 | GFG | CPP Java | Medium | O(n2) | |
77 | Minimum Cost Tree From Leaf Values | LC | Java | O(n2) | ||
78 | Minimum Falling Path Sum | LC | CPP Java | O(1) | ||
79 | Minimum Falling Path Sum Ii | LC | Java | O(n) | ||
80 | Minimum Path Cost In A Grid | LC | Java | O(n2) | ||
81 | Minimum Path Sum | LC | CPP Java | O(1) | ||
82 | Minimum Sum Partition3317 | GFG | Java | Hard | O(n2) | |
83 | N Th Tribonacci Number | LC | Java | O(n) | ||
84 | Ncr1019 | GFG | Java | Medium | O(n2) | |
85 | Nth Catalan Number0817 | GFG | Java | Easy | O(n2) | |
86 | Number Of Coins1824 | GFG | Java | Medium | O(n2) | |
87 | Number Of Distinct Roll Sequences | LC | Java | O(n) | ||
88 | Number Of Longest Increasing Subsequence | LC | Java | O(n2) | ||
89 | Number Of Paths In A Matrix With K Coins2728 | GFG | Java | null | O(1) | |
90 | Number Of People Aware Of A Secret | LC | Java | O(n) | ||
91 | Number Of Ways2552 | GFG | Java | Medium | O(n) | |
92 | Ones And Zeroes | LC | Java | O(n2) | ||
93 | Paint House Iii | LC | Java | O(n) | ||
94 | Painting The Fence3727 | GFG | Java | Medium | O(n) | |
95 | Palindromic Substrings | LC | Java | O(n2) | ||
96 | Partition Array For Maximum Sum | LC | Java | O(n2) | ||
97 | Partition To K Equal Sum Subsets | LC | Java | O(n) | ||
98 | Path In Matrix3805 | GFG | Java | Medium | O(n2) | |
99 | Perfect Squares | LC | Java | O(n2) | ||
100 | Perfect Sum Problem5633 | GFG | Java | Medium | O(1) | |
101 | Predict The Winner | LC | Java | O(1) | ||
102 | Print All Lcs Sequences3413 | GFG | Java | Hard | O(n2) | |
103 | Reach A Given Score 1587115621 | GFG | Java | Easy | O(n) | |
104 | Regular Expression Matching | LC | Java | O(1) | ||
105 | Rotate Function | LC | Java | O(n) | ||
106 | Scramble String | LC | Java | O(n) | ||
107 | Shortest Common Supersequence0322 | GFG | Java | Medium | O(n2) | |
108 | Sort Integers By The Power Value | LC | Java | O(n) | ||
109 | Special Keyboard3018 | GFG | Java | Medium | O(n2) | |
110 | Stickler Theif 1587115621 | GFG | Java | Easy | O(n2) | |
111 | Subset Sum Problem 1611555638 | GFG | CPP Java | Medium | O(1) | |
112 | Subset Sum Problem2014 | GFG | Java | Medium | O(n) | |
113 | Sum Of Floored Pairs | LC | Java | O(n3) | ||
114 | Super Egg Drop | LC GFG | Java | Medium | O(n3) | |
115 | Super Ugly Number | LC | Java | O(n2) | ||
116 | Target Sum | LC GFG | Java | Medium | O(n2) | |
117 | Triangle | LC | Java | O(n) | ||
118 | Unique Paths | LC | Java | O(n2) | ||
119 | Unique Paths Ii | LC | Java | O(n2) | ||
120 | Wiggle Subsequence | LC | CPP Java | O(1) | ||
121 | Wildcard Pattern Matching | GFG | Java | Medium | O(n2) | |
122 | Wildcard String Matching1126 | GFG | Java | Hard | O(n) | |
123 | Word Break1352 | GFG | Java | Medium | O(n2) | |
124 | Word Wrap1646 | GFG | Java | Hard | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 269f61832b146dd5e6d89b4ca18cbd2a2654ebbe | GFG | Java | Medium | O(n2) | |
2 | Number Of Islands | BS GFG | Java | Medium | O(n) | |
3 | Reverse Graph | BS | Java | O(n2) | ||
4 | Unlock Rooms | BS | CPP Java | O(1) | ||
5 | Accounts Merge | LC | Java | O(n) | ||
6 | All Paths From Source To Target | LC | Java | O(n) | ||
7 | Articulation Point 1 | GFG | Java | Hard | O(n) | |
8 | As Far From Land As Possible | LC | Java | O(n2) | ||
9 | Bfs Traversal Of Graph | GFG | CPP Java | Easy | O(n2) | |
10 | Bridge Edge In Graph | GFG | Java | Medium | O(n) | |
11 | Cheapest Flights Within K Stops | LC | Java | O(n2) | ||
12 | Circle Of Strings4530 | GFG | Java | Medium | O(n) | |
13 | Clone Graph | LC | CPP Java | O(n2) | ||
14 | Coloring A Border | LC | Java | O(n) | ||
15 | Count Unreachable Pairs Of Nodes In An Undirected Graph | LC | Java | O(n) | ||
16 | Course Schedule | LC | CPP Java | O(n3) | ||
17 | Course Schedule Ii | LC | Java | O(n3) | ||
18 | Course Schedule Iv | LC | Java | O(n3) | ||
19 | Depth First Traversal For A Graph | GFG | CPP Java | Easy | O(n) | |
20 | Detect Cycle In A Directed Graph | GFG | CPP Java | Medium | O(n) | |
21 | Detect Cycle In An Undirected Graph | GFG | CPP Java | Medium | O(n) | |
22 | Distance From The Source Bellman Ford Algorithm | GFG GFG | CPP Java | Medium | O(n) | |
23 | Employee Importance | LC | CPP Java | O(n2) | ||
24 | Euler Circuit And Path | GFG | Java | Medium | O(n2) | |
25 | Euler Circuit In A Directed Graph | GFG | Java | Medium | O(n2) | |
26 | Evaluate Division | LC | Java | O(n) | ||
27 | Find Eventual Safe States | LC | Java | O(n) | ||
28 | Find The City With The Smallest Number Of Neighbors At A Threshold Distance | LC | Java | O(n2) | ||
29 | Find The Number Of Islands | GFG | CPP | Medium | O(1) | |
30 | Find The Town Judge | LC | CPP Java | O(n2) | ||
31 | Geekss Garden | GFG | Java | Easy | O(n4) | |
32 | Implementing Dijkstra Set 1 Adjacency Matrix | GFG | CPP Java | Medium | O(1) | |
33 | Implementing Floyd Warshall2042 | GFG | CPP Java | Medium | O(n) | |
34 | Is Graph Bipartite | LC GFG | Java | Medium | O(n3) | |
35 | Journey To The Moon | HR | Java | O(n) | ||
36 | Keys And Rooms | LC | Java | O(n) | ||
37 | Length Of Largest Region Of 1s 1587115620 | GFG | Java | Medium | O(n) | |
38 | Min Cost To Connect All Points | LC | Java | O(n) | ||
39 | Minimum Cost Path3833 | GFG | Java | Hard | O(n) | |
40 | Minimum Spanning Tree | GFG | CPP Java | Medium | O(1) | |
41 | Minimum Swaps | GFG | Java | Medium | O(n2) | |
42 | Network Delay Time | LC | Java | O(n2) | ||
43 | Number Of Closed Islands | LC GFG | Java | Hard | O(n) | |
44 | Number Of Operations To Make Network Connected | LC | Java | O(n) | ||
45 | Number Of Provinces | LC GFG | Java | Medium | O(n3) | |
46 | Parallel Courses Iii | LC | Java | O(n) | ||
47 | Possible Bipartition | LC | Java | O(n3) | ||
48 | Possible Paths Between 2 Vertices 1587115620 | GFG | Java | Medium | O(n) | |
49 | Prerequisite Tasks | GFG | Java | Medium | O(n2) | |
50 | Print Adjacency List 1587115620 | GFG | CPP Java | Easy | O(1) | |
51 | Redundant Connection | LC | Java | O(n) | ||
52 | Rotting Oranges | LC | CPP Java | O(1) | ||
53 | Shortest Path In Binary Matrix | LC | Java | O(n) | ||
54 | Shortest Source To Destination Path3544 | GFG | Java | Medium | O(n2) | |
55 | Steps By Knight5927 | GFG | Java | Medium | O(n) | |
56 | Strongly Connected Component Tarjanss Algo 1587115621 | GFG | Java | Hard | O(n) | |
57 | Strongly Connected Components Kosarajus Algo | GFG | CPP Java | Medium | O(1) | |
58 | Surrounded Regions | LC | Java | O(n) | ||
59 | Time Needed To Inform All Employees | LC | Java | O(n2) | ||
60 | Topological Sort | GFG | CPP Java | Medium | O(1) | |
61 | Water And Jug Problem | LC | Java | O(n3) | ||
62 | Where Will The Ball Fall | LC | Java | O(n2) | ||
63 | Word Boggle4143 | GFG | Java | Medium | O(n) | |
64 | Word Ladder | LC | Java | O(n4) | ||
65 | X Total Shapes3617 | GFG | Java | Medium | O(n3) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Chocolate Distribution Problem3825 | GFG | Java | Easy | O(n) | |
2 | Coin Piles5152 | GFG | Java | Medium | O(n2) | |
3 | Fractional Knapsack 1587115620 | GFG | CPP Java | Medium | O(n) | |
4 | Hand Of Straights | LC | Java | O(n2) | ||
5 | Huffman Encoding3345 | GFG | CPP Java | Medium | O(1) | |
6 | Job Sequencing Problem 1587115620 | GFG | CPP Java | Medium | O(1) | |
7 | Largest Number With Given Sum 1587115620 | GFG | Java | Easy | O(n) | |
8 | Max Length Chain | GFG | CPP Java | Medium | O(1) | |
9 | Maximize Sum After K Negations1149 | GFG | Java | Easy | O(n) | |
10 | Maximize Toys0331 | GFG | CPP Java | Easy | O(1) | |
11 | Maximum Area Of A Piece Of Cake After Horizontal And Vertical Cuts | LC | Java | O(n) | ||
12 | Merge Intervals | LC | CPP | O(n) | ||
13 | Minimum Cost Of Ropes 1587115620 | GFG | Java | Easy | O(n) | |
14 | Minimum Deletions To Make Array Divisible | LC | Java | O(n2) | ||
15 | Minimum Time To Make Rope Colorful | LC | Java | O(n2) | ||
16 | Most Profit Assigning Work | LC | Java | O(n2) | ||
17 | N Meetings In One Room 1587115620 | GFG | CPP Java | Easy | O(n) | |
18 | Pairs With Specific Difference1533 | GFG | Java | Easy | O(n) | |
19 | Queue Reconstruction By Height | LC | Java | O(n2) | ||
20 | Reducing Dishes | LC | Java | O(n) | ||
21 | Remove Digit From Number To Maximize Result | LC | Java | O(n) | ||
22 | Shop In Candy Store1145 | GFG | Java | Easy | O(n) | |
23 | Shortest Impossible Sequence Of Rolls | LC | Java | O(n) | ||
24 | Split The Binary String Into Substrings With Equal Number Of 0s And 1s | GFG | Java | Medium | O(n) | |
25 | Task Scheduler | LC | Java | O(n) | ||
26 | Water Connection Problem5822 | GFG | Java | Medium | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Palindromic Anagram | BS | Java | O(n) | ||
2 | Smallest Intersecting Element | BS | Java | O(n2) | ||
3 | Underground Tunnel | BS | CPP | O(1) | ||
4 | All Oone Data Structure | LC | Java | O(1) | ||
5 | Array Pair Sum Divisibility Problem3257 | GFG | Java | Easy | O(n) | |
6 | Array Subset Of Another Array2317 | GFG | Java | Easy | O(n) | |
7 | Bulls And Cows | LC | Java | O(n) | ||
8 | Check If A String Contains All Binary Codes Of Size K | LC | Java | O(n) | ||
9 | Continuous Subarray Sum | LC | Java | O(n2) | ||
10 | Count Element Occurences | GFG | Java | Medium | O(n) | |
11 | Count Good Meals | LC | Java | O(n2) | ||
12 | Count Pairs In Array Divisible By K | GFG | Java | Medium | O(n) | |
13 | Count Triplets 1 | HR | Java | O(n) | ||
14 | Ctci Ransom Note | HR | Java | O(n) | ||
15 | Degree Of An Array | LC | Java | O(n) | ||
16 | Design Hashmap | LC | CPP Java | O(n) | ||
17 | Design Hashset | LC | CPP Java | O(n) | ||
18 | Determine If String Halves Are Alike | LC | Java | O(n) | ||
19 | Find All Duplicates In An Array | LC | Java | O(n) | ||
20 | Find All Numbers Disappeared In An Array | LC | Java | O(n) | ||
21 | Find Common Characters | LC | Java | O(n2) | ||
22 | Find Unique Binary String | LC | Java | O(n2) | ||
23 | First Missing Positive | LC | Java | O(n) | ||
24 | First Non Repeating Character In A Stream1216 | GFG | Java | Medium | O(n2) | |
25 | Group Anagrams | LC | Java | O(n3) | ||
26 | In First But Second5423 | GFG | Java | Medium | O(n) | |
27 | Longest Palindrome By Concatenating Two Letter Words | LC | Java | O(n) | ||
28 | Longest Subarray With Sum Divisible By K1259 | GFG | Java | Medium | O(n2) | |
29 | Longest Substring Without Repeating Characters | LC | CPP Java | O(1) | ||
30 | Max Distance Between Same Elements | GFG | CPP | Easy | O(1) | |
31 | Max Sum Of A Pair With Equal Sum Of Digits | LC | Java | O(n2) | ||
32 | Maximum Number Of Pairs In Array | LC | Java | O(n) | ||
33 | Maximum Repeating Number4858 | GFG | CPP | Basic | O(1) | |
34 | Minimum Consecutive Cards To Pick Up | LC | Java | O(n) | ||
35 | Most Common Word | LC | Java | O(n) | ||
36 | Most Frequent Word In An Array Of Strings3528 | GFG | CPP Java | Medium | O(1) | |
37 | Partition Labels | LC | Java | O(n) | ||
38 | Points In Straight Line | GFG | Java | Hard | O(n2) | |
39 | Rank Transform Of An Array | LC | Java | O(n2) | ||
40 | Relative Sorting4323 | GFG | Java | Medium | O(n2) | |
41 | Repeated Dna Sequences | LC | Java | O(n) | ||
42 | Swapping Pairs Make Sum Equal4142 | GFG | Java | Easy | O(n) | |
43 | Top K Frequent Elements In Array | GFG | Java | Easy | O(n) | |
44 | Top K Frequent Words | LC | Java | O(n) | ||
45 | Uncommon Words From Two Sentences | LC | CPP Java | O(1) | ||
46 | Unique Email Addresses | LC | Java | O(n2) | ||
47 | Unique Number Of Occurrences | LC | CPP | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | K Unique String | BS | Java | O(n) | ||
2 | Optimal Decrement | BS | Java | O(n) | ||
3 | Chinky And Diamonds3340 | GFG | Java | Easy | O(n) | |
4 | Course Schedule Iii | LC | Java | O(n) | ||
5 | Find K Th Smallest Element In Given N Ranges | GFG | Java | Medium | O(n2) | |
6 | Find Median From Data Stream | LC GFG | CPP Java | Hard | O(1) | |
7 | Find Nearest Point That Has The Same X Or Y Coordinate | LC | CPP Java | O(1) | ||
8 | Find Smallest Range Containing Elements From K Lists | GFG | Java | Hard | O(n) | |
9 | Find Subsequence Of Length K With The Largest Sum | LC | Java | O(n) | ||
10 | Is Binary Tree Heap | GFG | Java | Easy | O(1) | |
11 | K Closest Points To Origin | LC | CPP Java | O(n) | ||
12 | K Largest Elements4206 | GFG | Java | Medium | O(n) | |
13 | K Th Largest Sum Contiguous Subarray | GFG | Java | Medium | O(n2) | |
14 | Kth Largest Element In A Stream | LC | Java | O(n) | ||
15 | Kth Largest Element In A Stream703. | LC | CPP | O(1) | ||
16 | Kth Largest Element In An Array | LC | CPP Java | O(n) | ||
17 | Kth Smallest Element5635 | GFG | CPP | Medium | O(1) | |
18 | Merge K Sorted Arrays | GFG | CPP Java | Medium | O(1) | |
19 | Merge K Sorted Lists | LC | CPP Java | O(1) | ||
20 | Merge Two Binary Max Heap0144 | GFG | Java | Easy | O(n2) | |
21 | Minimum Cost Of Ropes 1587115620 | GFG | Java | Easy | O(n) | |
22 | Minimum Sum4058 | GFG | Java | Medium | O(n) | |
23 | Single Threaded Cpu | LC | Java | O(n) | ||
24 | Sliding Window Median | LC | Java | O(n) | ||
25 | The K Weakest Rows In A Matrix | LC | Java | O(n) | ||
26 | Top K Frequent Words | LC | CPP | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 87f12e5c728d69a5322634776b54c75897d14daa | GFG | Java | Medium | O(n2) | |
2 | Central Linked List | BS LC GFG | CPP | Easy | O(n2) | |
3 | Interleaved Linked List | BS | Java | O(n) | ||
4 | Linked List Union | BS | Java | O(n) | ||
5 | Pairwise Linked List Swap | BS LC | Java | O(n) | ||
6 | Reverse A Linked List | BS LC | CPP Java | O(1) | ||
7 | Swap Kth Node Values | BS | Java | O(n) | ||
8 | Add 1 To A Number Represented As Linked List | GFG | Java | Easy | O(1) | |
9 | Add Two Numbers | LC | Java | O(n) | ||
10 | Add Two Numbers Ii | LC GFG | Java | Easy | O(n) | |
11 | Check If Linked List Is Pallindrome | GFG | Java | Easy | O(n) | |
12 | Circular Linked List | GFG | CPP Java | Basic | O(n) | |
13 | Convert Binary Number In A Linked List To Integer | LC | Java | O(1) | ||
14 | Copy List With Random Pointer | LC GFG | Java | Hard | O(n) | |
15 | Decimal Equivalent Of Binary Linked List | GFG | CPP Java | Easy | O(n) | |
16 | Delete Middle Of Linked List | GFG | CPP Java | Easy | O(n) | |
17 | Delete N Nodes After M Nodes Of A Linked List | GFG | CPP Java | Easy | O(1) | |
18 | Delete Nodes Having Greater Value On Right | GFG | Java | Medium | O(1) | |
19 | Deletion And Reverse In Linked List | GFG | Java | Easy | O(n) | |
20 | Flatten A Multilevel Doubly Linked List | LC GFG | Java | Medium | O(n) | |
21 | Given A Linked List Of 0s 1s And 2s Sort It | GFG | Java | Easy | O(n) | |
22 | Given A Linked List Reverse Alternate Nodes And Append At The End | GFG | Java | null | O(n) | |
23 | Implement Stack Using Queues | LC | CPP | O(1) | ||
24 | Intersection Of Two Linked List | GFG | Java | Easy | O(n) | |
25 | Intersection Of Two Sorted Linked Lists | GFG | Java | Easy | O(n) | |
26 | Length Of Longest Palindrome In Linked List | GFG | Java | Medium | O(n) | |
27 | Linked List Cycle | LC | CPP Java | O(n) | ||
28 | Linked List Cycle Ii | LC | CPP Java | O(1) | ||
29 | Linked List Of Strings Forms A Palindrome | GFG | Java | Easy | O(n) | |
30 | Linked List That Is Sorted Alternatingly | GFG | Java | Easy | O(n) | |
31 | Merge 2 Sorted Linked List In Reverse Order | GFG | Java | Easy | O(n) | |
32 | Merge Sort On Doubly Linked List | GFG | Java | Medium | O(n) | |
33 | Merge Two Sorted Lists | LC | Java | O(n) | ||
34 | Middle Of The Linked List | LC | Java | O(n) | ||
35 | Modify Linked List 1 | GFG | Java | Easy | O(n) | |
36 | Multiply Two Linked Lists | GFG | Java | Easy | O(n) | |
37 | Next Greater Node In Linked List | LC | Java | O(n) | ||
38 | Odd Even Linked List | LC | CPP Java | O(1) | ||
39 | Partition A Linked List Around A Given Value | GFG | CPP Java | Medium | O(1) | |
40 | Partition List | LC | Java | O(n) | ||
41 | Polynomial Addition | GFG | Java | Medium | O(n) | |
42 | Quick Sort On Linked List | GFG | Java | Medium | O(n) | |
43 | Remove All Occurences Of Duplicates In A Linked List | GFG | Java | Medium | O(n) | |
44 | Remove Duplicates From Sorted List | LC | Java | O(n) | ||
45 | Remove Duplicates From Sorted List Ii | LC | Java | O(n) | ||
46 | Remove Every Kth Node | GFG | Java | Easy | O(n) | |
47 | Remove Linked List Elements | LC | CPP Java | O(1) | ||
48 | Remove Loop In Linked List | GFG | CPP Java | Medium | O(1) | |
49 | Remove Nth Node From End Of List | LC GFG | CPP Java | Easy | O(1) | |
50 | Reorder List | LC | Java | O(n) | ||
51 | Reverse A Doubly Linked List | GFG | Java | Easy | O(n2) | |
52 | Reverse A Linked List In Groups Of Given Size | GFG | CPP | Medium | O(1) | |
53 | Reverse Linked List Ii | LC | Java | O(n) | ||
54 | Reverse Nodes In K Group | LC | CPP Java | O(1) | ||
55 | Rotate A Linked List | GFG | CPP Java | Medium | O(1) | |
56 | Rotate List | LC | CPP | O(1) | ||
57 | Segregate Even And Odd Nodes In A Linked List5035 | GFG | CPP Java | Easy | O(1) | |
58 | Sort A Linked List | GFG | Java | Medium | O(n) | |
59 | Sorted Insert For Circular Linked List | GFG | Java | Easy | O(n) | |
60 | Split A Circular Linked List Into Two Halves | GFG | Java | Easy | O(n) | |
61 | Swap Nodes In Pairs | LC | CPP | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Bomber Man | BS | CPP Java | O(n2) | ||
2 | Condo Developers | BS | Java | O(n2) | ||
3 | Conway's Game Of Life | BS | CPP Java | O(n2) | ||
4 | Enclosed Islands | BS LC | Java | O(n2) | ||
5 | Matrix Search | BS GFG | Java | Medium | O(n3) | |
6 | N Lexicographic Integers | BS | CPP | O(1) | ||
7 | Spiral Matrix | BS LC GFG | Java | Medium | O(n) | |
8 | Zero Matrix | BS | Java | O(n2) | ||
9 | Adventure In A Maze2051 | GFG | Java | null | O(n) | |
10 | Boolean Matrix Problem 1587115620 | GFG | CPP Java | Medium | O(n2) | |
11 | Boundary Elements Of Matrix1102 | GFG | CPP Java | Easy | O(n) | |
12 | Check If Matrix Is X Matrix | LC | Java | O(n) | ||
13 | Count Occurences Of A Given Word In A 2 D Array | GFG | Java | null | O(n) | |
14 | Count Servers That Communicate | LC | CPP Java | O(n2) | ||
15 | Equal Row And Column Pairs | LC | Java | O(n2) | ||
16 | Find Nth Element Of Spiral Matrix | GFG | CPP Java | Medium | O(1) | |
17 | Find The String In Grid0111 | GFG | Java | Medium | O(n) | |
18 | Flood Fill | LC | CPP | O(1) | ||
19 | Game Of Life | LC | Java | O(n2) | ||
20 | Island Perimeter | LC | Java | O(n2) | ||
21 | Kth Smallest Element In A Sorted Matrix | LC GFG | CPP | Medium | O(1) | |
22 | Largest Rectangular Sub Matrix Whose Sum Is 0 | GFG | Java | null | O(n3) | |
23 | Largest Zigzag Sequence5416 | GFG | Java | Easy | O(n3) | |
24 | Max Rectangle | GFG | Java | Medium | O(n2) | |
25 | Maximum Area Of Triangle | IB | Java | O(n2) | ||
26 | Maximum Difference Between Pair In A Matrix | GFG | Java | Hard | O(n2) | |
27 | Maximum Sum Rectangle2948 | GFG | Java | null | O(n3) | |
28 | Minesweeper | LC | Java | O(n2) | ||
29 | Number Of Palindromic Paths In A Matrix0819 | GFG | Java | Medium | O(n) | |
30 | Prettyprint | IB | Java | O(n2) | ||
31 | Print Diagonally1623 | GFG | Java | Medium | O(n2) | |
32 | Print Matrix In Diagonal Pattern | GFG | Java | Easy | O(n2) | |
33 | Rank Of Matrix | GFG | Java | Medium | O(n3) | |
34 | Reverse Spiral Form Of Matrix4033 | GFG | Java | Medium | O(n2) | |
35 | Rotate Image | LC | CPP Java | O(1) | ||
36 | Rotate Matrix Elements Clockwise2336 | GFG | Java | Easy | O(n2) | |
37 | Row With Max 1s0023 | GFG | CPP Java | Medium | O(1) | |
38 | Row With Minimum Number Of 1s5430 | GFG | Java | Easy | O(n2) | |
39 | Search A 2d Matrix | LC | CPP Java | O(1) | ||
40 | Search A 2d Matrix Ii | LC GFG | CPP Java | Medium | O(1) | |
41 | Set Matrix Zeroes | LC | CPP Java | O(n2) | ||
42 | Sort The Matrix Diagonally | LC GFG | CPP Java | Medium | O(1) | |
43 | Spiral Matrix | LC | CPP | O(1) | ||
44 | Spiral Matrix Ii | LC | CPP Java | O(1) | ||
45 | Spiral Matrix Iii | LC | Java | O(n2) | ||
46 | Spiral Matrix Iv | LC | Java | O(n2) | ||
47 | Transpose Matrix | LC | CPP Java | O(1) | ||
48 | Valid Sudoku | LC | CPP Java | O(n2) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Compressed Vector Product | BS | Java | O(n) | ||
2 | Contiguous Intervals | BS | Java | O(n) | ||
3 | Contiguously Increasing Numbers | BS | Java | O(n) | ||
4 | Dropped Sensor Metric | BS | Java | O(n) | ||
5 | Quadratic Application | BS | Java | O(n) | ||
6 | Roman Numeral To Integer | BS | Java | O(n) | ||
7 | The Auditor | BS LC | Java | O(n) | ||
8 | Underground Tunnel | BS | Java | O(n) | ||
9 | Virtually Cloneable Stacks | BS | Java | O(n) | ||
10 | Zipped Iterator | BS | CPP Java | O(1) | ||
11 | Array Of Doubled Pairs | LC | Java | O(n) | ||
12 | Basic Calculator | LC | Java | O(n2) | ||
13 | Basic Calculator Ii | LC | Java | O(n2) | ||
14 | Best Poker Hand | LC | Java | O(n) | ||
15 | Best Time To Buy And Sell Stock | LC | Java | O(n) | ||
16 | Best Time To Buy And Sell Stock Iii | LC GFG | Java | Medium | O(n) | |
17 | Binary Search | GFG | Java | Basic | O(n) | |
18 | Binary Searchable Elements | GFG | Java | Medium | O(n) | |
19 | Check If Number Has Equal Digit Count And Digit Value | LC | Java | O(n) | ||
20 | Convert A Sentence Into Its Equivalent Mobile Numeric Keypad Sequence0547 | GFG | Java | Easy | O(n2) | |
21 | Cosmic Number | GFG | Java | Easy | O(n2) | |
22 | Count Asterisks | LC | Java | O(n) | ||
23 | Count Items Matching A Rule | LC | Java | O(n) | ||
24 | Design A Food Rating System | LC | Java | O(n) | ||
25 | Design A Number Container System | LC | Java | O(1) | ||
26 | Design Underground System | LC | Java | O(n) | ||
27 | Elimination Game | LC | Java | O(n2) | ||
28 | Excel Sheet Column Title | LC | Java | O(n) | ||
29 | Geek And Bridges | GFG | Java | Easy | O(n3) | |
30 | Geek Onacci Number | GFG | Java | Easy | O(n2) | |
31 | Get Watched Videos By Your Friends | LC | Java | O(n3) | ||
32 | Happy Number | LC | Java | O(n2) | ||
33 | Insert Delete Getrandom O1 | LC | Java | O(n) | ||
34 | Integer To English Words | LC | Java | O(n) | ||
35 | Invalid Transactions | LC | Java | O(n2) | ||
36 | K Subarray Sum | GFG | Java | Easy | O(n2) | |
37 | Letter Combinations Of A Phone Number | LC | Java | O(n) | ||
38 | Longest Binary Subsequence Less Than Or Equal To K | LC | Java | O(n) | ||
39 | Longest Subarray With Atmost K Even Elements | GFG | Java | Easy | O(n2) | |
40 | Maximum Consecutive Floors Without Special Floors | LC | Java | O(n) | ||
41 | Maximum Difference Between Increasing Elements | LC | Java | O(n) | ||
42 | Min Number Of Flips3210 | GFG | Java | Easy | O(n) | |
43 | Minimum Amount Of Time To Fill Cups | LC | Java | O(n) | ||
44 | Minimum Depth Of Binary Tree | LC | Java | O(1) | ||
45 | Minimum Number Of Increments On Subarrays To Form A Target Array | LC | Java | O(n) | ||
46 | Minimum Operations To Reduce X To Zero | LC | Java | O(n2) | ||
47 | New Year Chaos | HR | Java | O(n) | ||
48 | Print Pattern3549 | GFG | Java | Easy | O(1) | |
49 | Query Kth Smallest Trimmed Number | LC | Java | O(n2) | ||
50 | Reach The Target | GFG | Java | Easy | O(n) | |
51 | Replace By X | GFG | Java | Easy | O(n) | |
52 | Replace Every Element With The Least Greater Element On Its Right | GFG | Java | Hard | O(n) | |
53 | Shortest Subarray To Be Removed To Make Array Sorted | LC | Java | O(n) | ||
54 | Slowest Key | LC | Java | O(n) | ||
55 | Smallest Factorial Number5929 | GFG | CPP Java | Easy | O(1) | |
56 | Smallest Number In Infinite Set | LC | Java | O(n) | ||
57 | Sorting Elements Of An Array By Frequency 1587115621 | GFG | Java | Medium | O(n2) | |
58 | Substring With Concatenation Of All Words | LC | Java | O(n2) | ||
59 | Sum Of Numbers With Units Digit K | LC | Java | O(n) | ||
60 | Sum Of Square Numbers | LC | Java | O(n2) | ||
61 | Sum Of Two Numbers Without Using Arithmetic Operators | GFG | CPP | Easy | O(1) | |
62 | The Latest Time To Catch A Bus | LC | Java | O(n2) | ||
63 | Two Furthest Houses With Different Colors | LC | Java | O(n2) | ||
64 | Unique Morse Code Words | LC | Java | O(n2) | ||
65 | You And Your Books | GFG | Java | Easy | O(n) | |
66 | Zigzag Conversion | LC | Java | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Binary Tree Level Order Traversal | LC GFG | CPP | Easy | O(1) | |
2 | Binary Tree Zigzag Level Order Traversal | LC | CPP | O(1) | ||
3 | Circular Tour 1587115620 | GFG | Java | Medium | O(n) | |
4 | First Negative Integer In Every Window Of Size K3345 | GFG | Java | Easy | O(n) | |
5 | Implement Queue Using Stacks | LC | CPP Java | O(1) | ||
6 | Lru Cache | LC GFG | Java | Medium | O(n) | |
7 | Maximum Depth Of Binary Tree | LC GFG | CPP | Medium | O(1) | |
8 | Maximum Of All Subarrays Of Size K3101 | GFG | Java | Medium | O(n) | |
9 | N Ary Tree Level Order Traversal | LC | CPP | O(1) | ||
10 | Sliding Window Maximum | LC | Java | O(n2) | ||
11 | Validate Binary Search Tree | LC | CPP | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Count Nodes In Complete Binary Tree | BS LC | CPP | O(1) | ||
2 | Combinations | LC | CPP Java | O(n) | ||
3 | Flood Fill | LC | CPP | O(1) | ||
4 | Flood Fill Algorithm1856 | GFG | Java | Medium | O(1) | |
5 | Gray Code | LC GFG | CPP Java | Easy | O(n) | |
6 | Josephus Problem | GFG | CPP Java | Easy | O(1) | |
7 | Letter Case Permutation | LC | CPP Java | O(1) | ||
8 | Number Of Paths0926 | GFG | Java | Easy | O(n) | |
9 | Palindrome String0817 | GFG | CPP Java | Easy | O(1) | |
10 | Pascals Triangle | LC | CPP Java | O(1) | ||
11 | Pascals Triangle Ii | LC | CPP Java | O(1) | ||
12 | Permutations Of A Given String2041 | GFG | CPP | Medium | O(1) | |
13 | Power Set4302 | GFG | Java | Easy | O(1) | |
14 | Restore Ip Addresses | LC GFG | Java | Medium | O(1) | |
15 | Subsets | LC | CPP Java | O(1) | ||
16 | Tower Of Hanoi 1587115621 | GFG | CPP Java | Medium | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 3d27d4683c121c1f152ee8f41279255dc4430cf6 | GFG | CPP Java | Medium | O(1) | |
2 | 3sum | LC | CPP Java | O(n3) | ||
3 | 3sum Closest | LC | CPP Java | O(1) | ||
4 | 4sum | LC | CPP Java | O(n4) | ||
5 | Insertion Index In Sorted List | BS GFG | Java | Easy | O(1) | |
6 | Lowest Sum Of Pair Larger Than Target | BS | Java | O(n2) | ||
7 | Allocate Minimum Number Of Pages0937 | GFG | Java | Hard | O(n) | |
8 | Arithmetic Number2815 | GFG | CPP Java | Easy | O(1) | |
9 | Arithmetic Subarrays | LC | CPP | O(1) | ||
10 | Binary Search | GFG | CPP | Basic | O(1) | |
11 | Capacity To Ship Packages Within D Days | GFG | Java | Medium | O(n) | |
12 | Convert Sorted Array To Binary Search Tree | LC | Java | O(n) | ||
13 | Convert Sorted List To Binary Search Tree | LC | Java | O(n) | ||
14 | Count Pairs With Given Sum5022 | GFG | CPP | Easy | O(1) | |
15 | Count Possible Triangles 1587115620 | GFG | CPP Java | Medium | O(n3) | |
16 | Count The Zeros2550 | GFG | CPP | Easy | O(1) | |
17 | Count Triplets With Sum Smaller Than X5549 | GFG | CPP Java | Medium | O(n2) | |
18 | Find First And Last Position Of Element In Sorted Array | LC | CPP Java | O(1) | ||
19 | Find K Closest Elements | LC | CPP Java | O(n) | ||
20 | Find Missing And Repeating2512 | GFG | CPP Java | Medium | O(n) | |
21 | Find Pair Given Difference1559 | GFG | CPP Java | Easy | O(n) | |
22 | First Bad Version | LC | CPP Java | O(n) | ||
23 | Four Elements2452 | GFG | CPP Java | Easy | O(1) | |
24 | Guess Number Higher Or Lower | LC | CPP Java | O(n) | ||
25 | K Diff Pairs In An Array | LC | CPP Java | O(n) | ||
26 | K Th Element Of Two Sorted Array1317 | GFG | CPP | Medium | O(1) | |
27 | Kth Smallest Number In Multiplication Table | LC | CPP Java | O(n) | ||
28 | Maximum Distance Between A Pair Of Values | LC | Java | O(n) | ||
29 | Maximum Value In A Bitonic Array3001 | GFG | Java | Easy | O(n) | |
30 | Minimum Element In A Sorted And Rotated Array3611 | GFG | Java | Easy | O(n) | |
31 | Minimum Limit Of Balls In A Bag | LC | Java | O(n) | ||
32 | Number Of Pairs 1587115620 | GFG | Java | Medium | O(n) | |
33 | Pair With Given Sum In A Sorted Array4940 | GFG | CPP Java | Easy | O(n) | |
34 | Search In Rotated Sorted Array | LC | CPP Java | O(1) | ||
35 | Search Insert Position Of K In A Sorted Array | GFG | CPP | Easy | O(1) | |
36 | Searching In An Array Where Adjacent Differ By At Most K0456 | GFG | CPP | Easy | O(1) | |
37 | Sqrtx | LC GFG | CPP Java | Medium | O(1) | |
38 | Successful Pairs Of Spells And Potions | LC | Java | O(n2) | ||
39 | The Painters Partition Problem1535 | GFG | Java | Hard | O(n3) | |
40 | Triplet Sum In Array 1587115621 | GFG | CPP Java | Medium | O(1) | |
41 | Triplets With Sum With Given Range | GFG | CPP Java | Medium | O(n2) | |
42 | Two Sum | LC | CPP Java | O(1) | ||
43 | Two Sum Ii Input Array Is Sorted | LC | CPP Java | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Range Sum Query Immutable | LC | Java | O(n) | ||
2 | Range Sum Query Mutable | LC | Java | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Activity Selection 1587115620 | GFG | Java | Easy | O(n) | |
2 | Arithmetic Subarrays | LC | Java | O(n3) | ||
3 | Bubble Sort | GFG | CPP Java | Easy | O(n2) | |
4 | Counting Sort | GFG | CPP Java | Easy | O(n2) | |
5 | Find All Pairs Whose Sum Is X5808 | GFG | Java | Easy | O(n) | |
6 | Heap Sort | GFG | CPP Java | Medium | O(1) | |
7 | Insertion Sort | GFG | CPP Java | Easy | O(1) | |
8 | Merge Sort | GFG | CPP Java | Medium | O(1) | |
9 | Nearly Sorted Algorithm | GFG | Java | Medium | O(n2) | |
10 | Quick Sort | GFG | CPP Java | Medium | O(1) | |
11 | Selection Sort | GFG | CPP Java | Easy | O(n) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Circular Greater Element To The Right | BS LC | Java | O(n2) | ||
2 | Count The Reversals0401 | GFG | Java | Medium | O(n) | |
3 | Daily Temperatures | LC | Java | O(n2) | ||
4 | Decode The String2444 | GFG | Java | Easy | O(n) | |
5 | Design A Stack With Increment Operation | LC | Java | O(n2) | ||
6 | Evaluate Reverse Polish Notation | LC | CPP Java | O(1) | ||
7 | Fab3dbbdce746976ba35c7b9b24afde40eae5a04 | GFG | Java | Medium | O(n2) | |
8 | Implement Stack Using Array | GFG | CPP | Basic | O(1) | |
9 | Implement Stack Using Linked List | GFG | CPP | Basic | O(1) | |
10 | Implement Stack Using Queues | LC | Java | O(n) | ||
11 | Implement Two Stacks In An Array | GFG | Java | Easy | O(n) | |
12 | Infix To Postfix 1587115620 | GFG | CPP Java | Easy | O(1) | |
13 | Largest Rectangle In Histogram | LC GFG | Java | Medium | O(n) | |
14 | Longest Valid Parentheses | LC | Java | O(n) | ||
15 | Maximum Of Minimum For Every Window Size3453 | GFG | Java | Hard | O(n2) | |
16 | Min Stack | LC GFG | Java | Easy | O(n) | |
17 | Minimum Swaps For Bracket Balancing2704 | GFG | Java | Easy | O(n2) | |
18 | Next Greater Element I | LC | CPP Java | O(1) | ||
19 | Number Of Visible People In A Queue | LC | Java | O(n2) | ||
20 | Online Stock Span | LC | Java | O(n) | ||
21 | Simplify Path | LC | Java | O(n) | ||
22 | Sort A Stack | GFG | Java | Easy | O(n2) | |
23 | Stack Permutations | GFG | Java | Medium | O(n2) | |
24 | Stock Span Problem 1587115621 | GFG | CPP Java | Medium | O(1) | |
25 | The Celebrity Problem | GFG | Java | Medium | O(n2) | |
26 | Valid Parentheses | LC | CPP Java | O(1) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | 31272eef104840f7430ad9fd1d43b434a4b9596b | GFG | Java | null | O(n2) | |
2 | 856 | LC2 | Java | O(n) | ||
3 | 927 | LC2 | Java | O(n) | ||
4 | Add Binary Numbers | BS | Java | O(n) | ||
5 | Bulk Shift Letters | BS | Java | O(n) | ||
6 | Largest Anagram Group | BS | Java | O(n) | ||
7 | Lexicographically Smallest Non Palindromic String | BS LC | Java | O(n) | ||
8 | Lexicographically Smallest String Of Distance K | BS | Java | O(n) | ||
9 | Longest 1s After One Flip | BS | Java | O(n2) | ||
10 | Sentence Reversal | BS | CPP | O(1) | ||
11 | Subsequence Strings | BS | Java | O(n) | ||
12 | Consecutive Characters | LC | CPP Java | O(n) | ||
13 | Count And Say | LC | Java | O(n2) | ||
14 | Count Number Of Homogenous Substrings | LC | CPP Java | O(n) | ||
15 | Count Number Of Substrings4528 | GFG | Java | null | O(n2) | |
16 | Count Palindrome Sub Strings Of A String0652 | GFG | Java | Medium | O(n) | |
17 | Count Substrings That Differ By One Character | LC | Java | O(n3) | ||
18 | Count Words Obtained After Adding A Letter | LC | Java | O(n2) | ||
19 | Decode String | LC | Java | O(n) | ||
20 | Decode The Message | LC | Java | O(n) | ||
21 | Delete Operation For Two Strings | LC | Java | O(n2) | ||
22 | Design A Text Editor | LC | Java | O(n) | ||
23 | Distinct Palindromic Substrings5141 | GFG | Java | Hard | O(n) | |
24 | Find All Anagrams In A String | LC | CPP Java | O(n2) | ||
25 | Find First Repeated Character4108 | GFG | CPP | Basic | O(1) | |
26 | Find The Missing No In String | GFG | Java | null | O(n2) | |
27 | First Letter To Appear Twice | LC | Java | O(n) | ||
28 | First Non Repeating Character In A Stream1216 | GFG | Java | Medium | O(n2) | |
29 | First Unique Character In A String | LC | CPP Java | O(n) | ||
30 | Get Equal Substrings Within Budget | LC | Java | O(n) | ||
31 | Goat Latin | LC | Java | O(n) | ||
32 | Greatest English Letter In Upper And Lower Case | LC | Java | O(n) | ||
33 | Implement Atoi | GFG | CPP Java | Medium | O(n) | |
34 | Isomorphic Strings | LC GFG | Java | Easy | O(n) | |
35 | Longest Even Length Substring | GFG | Java | Medium | O(n3) | |
36 | Longest K Unique Characters Substring0853 | GFG | Java | Easy | O(n2) | |
37 | Longest Palindrome | LC | Java | O(n) | ||
38 | Longest Prefix Suffix2527 | GFG | Java | Medium | O(n) | |
39 | Longest Substring With At Least K Repeating Characters | LC | Java | O(n2) | ||
40 | Match Substring After Replacement | LC | Java | O(n2) | ||
41 | Maximize Number Of Subsequences In A String | LC | Java | O(n) | ||
42 | Maximum Number Of Vowels In A Substring Of Given Length | LC | CPP Java | O(1) | ||
43 | Maximum Product Of Word Lengths | LC | Java | O(n2) | ||
44 | Minimum Changes To Make Alternating Binary String | LC | Java | O(n) | ||
45 | Minimum Indexed Character 1587115620 | GFG | Java | Easy | O(n) | |
46 | Minimum Length Of String After Deleting Similar Ends | LC | Java | O(n2) | ||
47 | Minimum Number Of Frogs Croaking | LC | Java | O(n) | ||
48 | Minimum Window Substring | LC GFG | Java | Medium | O(n2) | |
49 | Move Pieces To Obtain A String | LC | Java | O(n2) | ||
50 | Multiply Strings | LC | Java | O(n2) | ||
51 | Number Of Substrings Containing All Three Characters | LC | Java | O(n2) | ||
52 | Number Of Substrings With Only 1s | LC | Java | O(n) | ||
53 | Palindrome Pairs | LC | Java | O(n) | ||
54 | Palindrome String0817 | GFG | CPP | Easy | O(1) | |
55 | Permutation In String | LC | Java | O(n) | ||
56 | Rearrange Characters4649 | GFG | Java | Medium | O(n2) | |
57 | Rearrange Spaces Between Words | LC | CPP Java | O(1) | ||
58 | Remove All Duplicates From A Given String4321 | GFG | Java | Easy | O(n) | |
59 | Reorder Data In Log Files | LC | Java | O(1) | ||
60 | Reorganize String | LC | Java | O(n) | ||
61 | Repetition Of K Length Substring | GFG | Java | Easy | O(n) | |
62 | Replace The Substring For Balanced String | LC | Java | O(n2) | ||
63 | Reverse A String | GFG | CPP | Basic | O(1) | |
64 | Reverse Vowels Of A String | LC | Java | O(n2) | ||
65 | Rotate String | LC | CPP Java | O(1) | ||
66 | Run Length Encoding | GFG | Java | Easy | O(n) | |
67 | Search Pattern0205 | GFG | Java | null | O(n) | |
68 | Sentence Similarity Iii | LC | Java | O(n) | ||
69 | Sherlock And Anagrams | HR | Java | O(n2) | ||
70 | Shortest Palindrome | LC | Java | O(n2) | ||
71 | Smallest Distant Window3132 | GFG | Java | Medium | O(n) | |
72 | Strong Password Checker Ii | LC | Java | O(n) | ||
73 | Substrings Of Length K With K 1 Distinct Elements | GFG | Java | Medium | O(n) | |
74 | Text Justification | LC | Java | O(n3) | ||
75 | Truncate Sentence | LC | Java | O(n) | ||
76 | Uncommon Words From Two Sentences | LC | CPP | O(1) | ||
77 | Unique Morse Code Words | LC | O(1) | |||
78 | Valid Anagram | LC | CPP Java | O(n) | ||
79 | Valid Number | LC | Java | O(n) | ||
80 | Valid Palindrome | LC | Java | O(n) | ||
81 | Valid Palindrome Ii | LC | Java | O(n) | ||
82 | Validate An Ip Address 1587115621 | GFG | Java | Medium | O(n) | |
83 | Validate Ip Address | LC | Java | O(n) | ||
84 | Verifying An Alien Dictionary | LC | Java | O(n2) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Binary Tree To Linked List | BS | Java | O(1) | ||
2 | Count Nodes In Complete Binary Tree | BS LC | Java | O(n) | ||
3 | Delete Even Leaves | BS | Java | O(1) | ||
4 | Elephant Tree | BS GFG | Java | Easy | O(1) | |
5 | Height Balanced Tree | BS | Java | O(1) | ||
6 | Inorder Successor | BS | Java | O(n) | ||
7 | Largest Tree Sum Path | BS | Java | O(n) | ||
8 | Leaves In Same Level | BS GFG | Java | Easy | O(1) | |
9 | Longest Tree Sum Path From Root To Leaf | BS | Java | O(1) | ||
10 | Lowest Common Ancestor | BS GFG GFG | Java | Medium | O(n) | |
11 | Merging Binary Trees | BS | Java | O(1) | ||
12 | Most Frequent Subtree Sum | BS | Java | O(n) | ||
13 | Partition Tree | BS | Java | O(n2) | ||
14 | Subtree With Maximum Value | BS | Java | O(1) | ||
15 | Sum Tree | BS | Java | O(1) | ||
16 | Symmetric Binary Tree | BS LC | Java | O(1) | ||
17 | Tree Pruning | BS | Java | O(1) | ||
18 | Univalue Tree | BS | Java | O(1) | ||
19 | Add All Greater Values To Every Node In A Bst | GFG | Java | Medium | O(1) | |
20 | Add One Row To Tree | LC | Java | O(1) | ||
21 | All Elements In Two Binary Search Trees | LC | Java | O(1) | ||
22 | Balanced Binary Tree | LC | Java | O(1) | ||
23 | Binary Search Tree Iterator | LC | Java | O(n) | ||
24 | Binary Search Tree To Greater Sum Tree | LC | Java | O(1) | ||
25 | Binary Tree Cameras | LC | Java | O(1) | ||
26 | Binary Tree K Level Sum3857 | GFG | Java | Easy | O(n2) | |
27 | Binary Tree Level Order Traversal | LC | CPP Java | O(1) | ||
28 | Binary Tree Maximum Path Sum | LC GFG | Java | Medium | O(1) | |
29 | Binary Tree Paths | LC | Java | O(1) | ||
30 | Binary Tree Tilt | LC | Java | O(1) | ||
31 | Binary Tree To Bst | GFG | Java | Easy | O(1) | |
32 | Binary Tree To Dll | GFG | Java | Hard | O(1) | |
33 | Binary Tree Zigzag Level Order Traversal | LC | Java | O(n2) | ||
34 | Bottom View Of Binary Tree | GFG | Java | Medium | O(n) | |
35 | Boundary Traversal Of Binary Tree | GFG | CPP Java | Medium | O(1) | |
36 | Brothers From Different Root | GFG | Java | Easy | O(n) | |
37 | Bst To Greater Sum Tree | GFG | Java | Medium | O(1) | |
38 | Burning Tree | GFG | Java | Hard | O(1) | |
39 | Check Completeness Of A Binary Tree | LC | Java | O(n) | ||
40 | Check For Balanced Tree | GFG | CPP | Easy | O(1) | |
41 | Check If Subtree | GFG | Java | Medium | O(n) | |
42 | Check If Tree Is Isomorphic | GFG | Java | Easy | O(1) | |
43 | Check Mirror In N Ary Tree1528 | GFG | Java | Medium | O(n2) | |
44 | Check Whether Bst Contains Dead End | GFG | Java | Easy | O(1) | |
45 | Children Sum Parent | GFG | CPP | Easy | O(1) | |
46 | Complete Binary Tree | GFG | Java | Medium | O(n2) | |
47 | Connect Nodes At Same Level | GFG | Java | Medium | O(n) | |
48 | Construct Binary Tree From String With Bracket Representation | GFG | Java | Medium | O(n) | |
49 | Construct String From Binary Tree | LC | Java | O(1) | ||
50 | Construct Tree 1 | GFG | Java | Medium | O(n) | |
51 | Convert Sorted Array To Binary Search Tree | LC | CPP Java | O(1) | ||
52 | Count Bst Nodes That Lie In A Given Range | GFG | CPP Java | Medium | O(1) | |
53 | Count Good Nodes In Binary Tree | LC | Java | O(1) | ||
54 | Count Nodes Equal To Average Of Subtree | LC | Java | O(1) | ||
55 | Count Number Of Subtrees Having Given Sum | GFG | Java | Medium | O(1) | |
56 | Cousins In Binary Tree | LC | Java | O(n2) | ||
57 | Cousins Of A Given Node | GFG | Java | Medium | O(n2) | |
58 | Create Binary Tree From Descriptions | LC | Java | O(n) | ||
59 | Deepest Leaves Sum | LC | Java | O(1) | ||
60 | Delete Leaves With A Given Value | LC | Java | O(1) | ||
61 | Delete Node In A Bst | LC | CPP Java | O(n) | ||
62 | Determine If Two Trees Are Identical | GFG | CPP Java | Easy | O(1) | |
63 | Diagonal Traversal Of Binary Tree | GFG | Java | Medium | O(n2) | |
64 | Diameter Of Binary Tree | GFG | Java | Easy | O(1) | |
65 | Distribute Coins In Binary Tree | LC GFG | Java | null | O(1) | |
66 | Duplicate Subtree In Binary Tree | GFG | Java | Medium | O(n4) | |
67 | Evaluate Boolean Binary Tree | LC | Java | O(1) | ||
68 | Expression Tree | GFG | Java | Easy | O(1) | |
69 | Ffd66b6a0bf7cefb9987fa455974b6ea5695709e | GFG | Java | Easy | O(n2) | |
70 | Find A Corresponding Node Of A Binary Tree In A Clone Of That Tree | LC | Java | O(1) | ||
71 | Find A Pair With Given Target In Bst | GFG | CPP Java | Medium | O(n) | |
72 | Find Duplicate Subtrees | LC | Java | O(n) | ||
73 | Find Largest Value In Each Tree Row | LC | Java | O(n2) | ||
74 | Find Mode In Binary Search Tree | LC | Java | O(n) | ||
75 | Find The Closest Element In Bst | GFG | Java | Medium | O(n) | |
76 | Find The Distance Between Two Nodes4402 | GFG | Java | Easy | O(n) | |
77 | Flatten Binary Tree To Linked List | LC | Java | O(n2) | ||
78 | Foldable Binary Tree | GFG | Java | Medium | O(1) | |
79 | Increasing Order Search Tree | LC | Java | O(1) | ||
80 | Inorder Successor In Bst | GFG | CPP Java | Easy | O(1) | |
81 | Inorder Traversal Iterative | GFG | Java | Medium | O(n) | |
82 | Insert Into A Binary Search Tree | LC | CPP Java | O(1) | ||
83 | Insufficient Nodes In Root To Leaf Paths | LC | Java | O(1) | ||
84 | Invert Binary Tree | LC | CPP | O(1) | ||
85 | Kth Smallest Element In A Bst | LC GFG | Java | Easy | O(1) | |
86 | Largest Bst | GFG | Java | Medium | O(1) | |
87 | Largest Subtree Sum In A Tree | GFG | Java | Hard | O(1) | |
88 | Largest Value In Each Level | GFG | Java | Easy | O(n2) | |
89 | Leaf At Same Level | GFG | CPP | Easy | O(1) | |
90 | Leaf Similar Trees | LC | Java | O(n2) | ||
91 | Left View Of Binary Tree | GFG | CPP Java | Easy | O(1) | |
92 | Longest Path With Different Adjacent Characters | LC | Java | O(n) | ||
93 | Longest Univalue Path | LC | Java | O(1) | ||
94 | Maximum Depth Of Binary Tree | LC | CPP Java | O(1) | ||
95 | Maximum Difference Between Node And Ancestor | LC | Java | O(n) | ||
96 | Maximum Difference Between Node And Its Ancestor | GFG | Java | Medium | O(n) | |
97 | Maximum Level Sum Of A Binary Tree | LC | Java | O(n2) | ||
98 | Maximum Path Sum | GFG | Java | Hard | O(1) | |
99 | Maximum Sum Leaf To Root Path | GFG | Java | Medium | O(1) | |
100 | Maximum Width Of Binary Tree | LC | Java | O(n2) | ||
101 | Maximum Width Of Tree | GFG | Java | Easy | O(n2) | |
102 | Merge Two Binary Trees | LC | CPP Java | O(1) | ||
103 | Merge Two Bst S | GFG | Java | Hard | O(n) | |
104 | Min Distance Between Two Given Nodes Of A Binary Tree | GFG | Java | Medium | O(1) | |
105 | Minimum Height Trees | LC | Java | O(n2) | ||
106 | Minimum Swap Required To Convert Binary Tree To Binary Search Tree | GFG | Java | Hard | O(n2) | |
107 | Mirror Tree | GFG | Java | Easy | O(1) | |
108 | N Ary Tree Level Order Traversal | LC | Java | O(n3) | ||
109 | N Ary Tree Postorder Traversal | LC | Java | O(n) | ||
110 | N Ary Tree Preorder Traversal | LC | Java | O(n) | ||
111 | Next Right Node | GFG | CPP | Easy | O(1) | |
112 | Node At Distance | GFG | Java | Medium | O(1) | |
113 | Nodes At Given Distance In Binary Tree | GFG | Java | Hard | O(n) | |
114 | Number Of Turns In Binary Tree | GFG | Java | Hard | O(1) | |
115 | Odd Even Level Difference | GFG | Java | Easy | O(n2) | |
116 | Pairs Violating Bst Property | GFG | Java | Medium | O(n) | |
117 | Path Sum | LC | CPP Java | O(1) | ||
118 | Path Sum Ii | LC | Java | O(n) | ||
119 | Path Sum Iii | LC GFG | Java | Medium | O(1) | |
120 | Paths From Root With A Specified Sum | GFG | Java | Medium | O(n) | |
121 | Populate Inorder Successor For All Nodes | GFG | CPP Java | Medium | O(1) | |
122 | Populating Next Right Pointers In Each Node | LC | Java | O(n2) | ||
123 | Postorder Traversal Iterative | GFG | Java | Medium | O(n) | |
124 | Predecessor And Successor | GFG | Java | Easy | O(1) | |
125 | Preorder Traversal And Bst4006 | GFG | Java | Medium | O(n) | |
126 | Preorder Traversal Iterative | GFG | Java | Medium | O(n) | |
127 | Print Binary Tree | LC | Java | O(n2) | ||
128 | Print Nodes Having K Leaves | GFG | Java | Medium | O(1) | |
129 | Recover Binary Search Tree | LC GFG | Java | null | O(1) | |
130 | Remove Bst Keys Outside Given Range | GFG | Java | Medium | O(n2) | |
131 | Reverse Level Order Traversal | GFG | CPP Java | Easy | O(1) | |
132 | Right View Of Binary Tree | GFG | CPP Java | Easy | O(1) | |
133 | Second Minimum Node In A Binary Tree | LC | Java | O(1) | ||
134 | Serialize And Deserialize Binary Tree | LC GFG | Java | Medium | O(1) | |
135 | Single Valued Subtree | GFG | Java | Medium | O(1) | |
136 | Smallest String Starting From Leaf | LC | Java | O(n) | ||
137 | Subtree Of Another Tree | LC | Java | O(1) | ||
138 | Sum Of Binary Tree | GFG | Java | Basic | O(1) | |
139 | Sum Of K Smallest Elements In Bst3029 | GFG | Java | Easy | O(n) | |
140 | Sum Of Nodes With Even Valued Grandparent | LC | Java | O(1) | ||
141 | Sum Of The Longest Bloodline Of A Tree | GFG | CPP Java | Easy | O(1) | |
142 | Sum Root To Leaf Numbers | LC | Java | O(1) | ||
143 | Sum Tree | GFG | Java | Medium | O(1) | |
144 | Symmetric Tree | GFG | CPP Java | Easy | O(1) | |
145 | Top View Of Binary Tree | GFG | Java | Medium | O(n) | |
146 | Tree From Postorder And Inorder | GFG | Java | Medium | O(n) | |
147 | Trim A Binary Search Tree | LC | CPP Java | O(1) | ||
148 | Two Mirror Trees | GFG | Java | Easy | O(1) | |
149 | Unique Binary Search Trees Ii | LC | Java | O(n) | ||
150 | Unique Bsts 1587115621 | GFG | Java | Medium | O(n2) | |
151 | Validate Binary Search Tree | LC | CPP Java | O(1) | ||
152 | Validate Binary Tree Nodes | LC | Java | O(n) | ||
153 | Verify Preorder Serialization Of A Binary Tree | LC | Java | O(1) | ||
154 | Vertical Order Traversal Of A Binary Tree | LC GFG | Java | Medium | O(n2) |
# | Title | Links | Solution | Difficulty | Time Complexity | Space Complexity |
---|---|---|---|---|---|---|
1 | Distinct Substrings | BS GFG | Java | Medium | O(n) | |
2 | Implement Trie Prefix Tree | LC | Java | O(n) | ||
3 | Maximum Xor Of Two Numbers In An Array | LC | Java | O(n) | ||
4 | Minimum Xor Value Pair | GFG | Java | Medium | O(n) | |
5 | Palindrome Pairs | GFG | Java | Hard | O(n) | |
6 | Phone Directory4628 | GFG | Java | Hard | O(n) | |
7 | Search Suggestions System | LC | Java | O(n2) | ||
8 | Short Encoding Of Words | LC | Java | O(n2) | ||
9 | Shortest Unique Prefix For Every Word | GFG | Java | Hard | O(n) | |
10 | Stream Of Characters | LC | Java | O(n) | ||
11 | Trie Delete | GFG | CPP Java | Medium | O(1) | |
12 | Trie Insert And Search0651 | GFG | CPP Java | Medium | O(1) | |
13 | Unique Rows In Boolean Matrix | GFG | Java | Easy | O(n) |