For discussions, questions, or doubts related to this solution, please visit my Twitter : Any Questions. Thank you for your input, together, we strive to create a space where learning is a collaborative endeavor.
๐ฎYour feedback is valuable! Please consider leaving a ๐ star ๐ and sharing your thoughts in the comments.
This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.
January | Problem Name | Java โ |
---|---|---|
Day 01 | Print Anagrams Together ๐ฅ๐ข | Solution |
Day 02 | Subarrays with sum K ๐๐ข | Solution |
Day 03 | Count Subarrays with given XOR ๐ข๐ | Solution |
Day 04 | Count all triplets with given sum in sorted array ๐งฉ๐ | Solution |
Day 05 | Count Pairs whose sum is less than target ๐๐ | Solution |
Day 06 | Sum Pair closest to target ๐ฅ๐๐ข | Solution |
Day 07 | Pair with given sum in a sorted array ๐ฅ๐๐ข | Solution |
Day 08 | Count the number of possible triangles ๐ข๐ | Solution |
Day 09 | Indexes of Subarray Sum ๐งฉ๐ | Solution |
Day 10 | Count distinct elements in every window ๐๐ | Solution |
Day 11 | Longest substring with distinct characters ๐ฅ๐๐ข | Solution |
Day 12 | Trapping Rain Water ๐ฅ๐๐ข | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Split Array in Three Equal Sum Subarrays ๐ฅ | Solution |
NUM 2 | Repetitive Addition of Digits ๐ข๐ | Solution |
NUM 3 | Maximize Number of 1's ๐ข๐ก | Solution |
NUM 4 | Last Moment Before All Ants Fall Out of a Plank ๐๐ | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Fizz Buzz ๐ฅ๐ข | Solution |
NUM 2 | CamelCase Pattern Matching ๐๐ฐ | Solution |
NUM 3 | Palindrome Sentence โ ๐ | Solution |
NUM 4 | Minimum repeat to make substring ๐โ | Solution |
NUM 5 | Longest Prefix Suffix ๐ข๐ฐ | Solution |
NUM 6 | Integer to Words ๐ฅ๐ | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Minimum sum โ๐ | Solution |
NUM 2 | Meeting Rooms ๐ข๐ | Solution |
NUM 3 | From the Largest Number ๐ข๐ | Solution |
NUM 4 | Make array elements unique ๐ฒ๐ง | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Implement Lower Bound ๐ฅ๐ข | Solution |
NUM 2 | Bitonic Point ๐๐ฐ | Solution |
NUM 3 | Median of 2 Sorted Arrays of Different Sizes โ ๐ | Solution |
NUM 4 | Square Root ๐โ | Solution |
NUM 5 | Koko Eating Bananas ๐ข๐ฐ | Solution |
NUM 6 | Minimum days to make M bouquets ๐ฅ๐ | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Rotate a Matrix by 180 Counterclockwise ๐ฅ๐ข | Solution |
NUM 2 | Create a spiral matrix of N*M size from given array ๐๐ฐ | Solution |
NUM 3 | Generate a matrix with each row and column of given sum โ ๐ | Solution |
NUM 4 | Make Matrix Beautiful ๐โ | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Roman Number to Integer ๐ฅ๐ข | Solution |
NUM 2 | Max distance between same elements ๐๐ฐ | Solution |
NUM 3 | Pairs with difference k โ ๐ | Solution |
NUM 4 | 4 Sum โ Count quadruplets with given sum ๐โ | Solution |
NUM 5 | Min Subsets with Consecutive Numbers ๐ข๐ฐ | Solution |
NUM 6 | Group Shifted String ๐ฅ๐ | Solution |
Bonus Problem No. | Problem Name | Java โ |
---|---|---|
NUM 1 | Triplet Sum in Array ๐ฅ๐ข | Solution |
NUM 2 | 3 Sum Closest ๐๐ฐ | Solution |
Here's the updated list with the problem days properly formatted in the solution folder:
Day | Problem Name | Java โ |
---|---|---|
Day 1 | Second Largest ๐ข๐ | Solution |
Day 2 | Move All Zeroes to End ๐0๏ธโฃ | Solution |
Day 3 | Reverse an Array ๐๐ | Solution |
Day 4 | Rotate Array ๐๐ | Solution |
Day 5 | Next Permutation ๐ข๐ | Solution |
Day 6 | Majority Element II ๐ข๐ฅ | Solution |
Day 7 | Stock Buy and Sell โ Multiple Transactions Allowed ๐๐น | Solution |
Day 8 | Stock Buy and Sell โ Max One Transaction Allowed ๐๐ต | Solution |
Day 9 | Minimize the Heights II โฌ๏ธโฌ๏ธ | Solution |
Day 10 | Kadane's Algorithm ๐ก๐ | Solution |
Day 11 | Maximum Product Subarray ๐ข๐ฅ | Solution |
Day 12 | Max Circular Subarray Sum ๐๐ฏ | Solution |
Day 13 | Smallest Positive Missing Number ๐ขโ | Solution |
Day 14 | Implement Atoi ๐ข๐ป | Solution |
Day 15 | Add Binary Strings 0๏ธโฃ1๏ธโฃโ | Solution |
Day 16 | Anagram ๐โ๏ธ | Solution |
Day 17 | Non Repeating Character ๐ โ | Solution |
Day 18 | Search Pattern (KMP Algorithm) ๐๐ | Solution |
Day 19 | Min Chars to Add for Palindrome ๐๐ | Solution |
Day 20 | Strings Rotations of Each Other ๐๐ | Solution |
Day 21 | Sort 0s, 1s and 2s ๐๐ | Solution |
Day 22 | Find H-Index ๐๐ | Solution |
Day 23 | Count Inversions ๐ ๐งก | Solution |
Day 24 | Overlapping Intervals ๐ฉโ๏ธ | Solution |
Day 25 | Insert Interval๐ธ ๐ | Solution |
Day 26 | Non-overlapping Intervals๐๐ | Solution |
Day 27 | Merge Without Extra Space๐ฉนโ๏ธ | Solution |
Day 28 | Number of occurrence๐งพ๐ท๏ธ | Solution |
Day 29 | Sorted and Rotated Minimumโค๏ธ ๐บ | Solution |
Day 30 | Search in Rotated Sorted Array๐ฎ ๐ | Solution |
Day 31 | Peak element๐ ๐งก | Solution |
Day 32 | K-th element of two Arraysโญ๐ซ | Solution |
Day 33 | Aggressive Cows๐ฅโ๏ธ | Solution |
Day 34 | Allocate Minimum Pages๐๐ | Solution |
Day 35 | Kth Missing Positive Number in a Sorted Array๐๐ข | Solution |
Day 36 | Spirally traversing a matrix๐ฏ๐ข | Solution |
Day 37 | Rotate by 90 degree๐จ๐ข | Solution |
Day 38 | Search in a Row-Column sorted matrix๐ฏ๐ข | Solution |
Day 39 | Search in a row-wise sorted matrixโ ๐ | Solution |
Day 40 | Search in a sorted matrix๐ ๏ธ๐ | Solution |
Day 41 | Set matrix Zeroes๐๐จ | Solution |
Day 42 | Two Sum -Pair with Given Sum๐ ๐ฆ | Solution |
Day 43 | Count pairs with given sum ๐ข๐งฎ | Solution |
Day 44 | Find All Triplets with Zero Sum๐๐๏ธ | Solution |
Day 45 | Intersection of Two arrays with Dublicate Elements๐โ๏ธ | Solution |
Day 46 | Union of Arrays with Duplicates๐๐ฆ | Solution |
Day 47 | Longest Consecutive Subsequenceโ๐ฏ๏ธ | Solution |
Day 48 | Print Anagrams Together๐งฉ๐ฏ | Solution |
Day 49 | Subarrays with sum K๐ ๏ธ๐ | Solution |
Day 50 | Count Subarrays with given XOR๐๏ธ๐ | Solution |
Day 51 | Count all triplets with given sum in sorted array๐งฉ๐ | Solution |
Day 52 | Count Pairs whose sum is less than target๐๐ | Solution |
Day 53 | Sum Pair closest to target๐โ๏ธ | Solution |
Day 54 | Pair with given sum in a sorted array๐๐๏ธ | Solution |
Day 55 | Count the number of possible triangles๐โ๏ธ | Solution |
Day 56 | Indexes of Subarray Sum๐๐ | Solution |
Day 57 | Count distinct elements in every window๐๐ | Solution |
Day 58 | Longest substring with distinct characters๐๐๏ธ | Solution |
Day 59 | Trapping Rain Water๐โ๏ธ | Solution |