I am thrilled to receive an exclusive bag from @geeksforgeeks. @gfg has been an incredible platform that has greatly enhanced my coding skills and kept me motivated throughout my journey. I look forward to continuing this journey and exploring more with @GFG. @sandeep_jain
๐ Proud to lead our team at NASA Space Apps 2025
We built Deep Dive, a WebXR 3D experience turning NASAโs PACE, SWOT & GRACE-FO data into interactive ocean & climate visuals .
Live: https://t.co/9Pz6Ac2qSa
My Team -@Pradeepsol034, Kush, Komal, @an5h1ka_51ngh ๐
#NASA#SpaceApps
๐ #gfgPOTD Day 31
๐น Problem: Sum String
๐น Approach: Try all splits for first two numbers, recursively check the sum sequence using string addition
๐น Time Complexity: O(Nยณ)
๐น Space Complexity: O(N)
@geeksforgeeks@sandeepjain
๐ #gfgPOTD Day 30
๐น Problem: Longest Span in two Binary Arrays
๐น Approach: Prefix Sum + Difference Array to track first occurrence of diff
๐น Time Complexity: O(N)
๐น Space Complexity: O(N)
๐น Tags: Prefix Sum, Hashing, Arrays
@geeksforgeeks@sandeepjain
๐ #gfgPOTD Day 27
๐น Problem: Substrings with K Distinct
๐น Approach: Sliding Window with HashMap (AtMost(K) - AtMost(K-1))
๐น Time Complexity: O(N)
๐น Space Complexity: O(K)
@geeksforgeeks@sandeepjain#160gfg#GFG
๐ #gfgPOTD Day 26
๐น Problem: Unique Paths in a Grid
๐น Approach: Top-Down DP with memoization (DFS)
๐น Time Complexity: O(N ร M)
๐น Space Complexity: O(N ร M)
๐น Tags: DP, Recursion, Memoization, Grid
@geeksforgeeks@sandeepjain999#160gfg#GFG
๐ #gfgPOTD Day 25
๐น Problem:Count pairs Sum in matrices
๐น Approach: Use a HashMap to store elements of one matrix, then check for complement from the other
๐น Time Complexity: O(Nยฒ)
๐น Space Complexity: O(Nยฒ)
@geeksforgeeks@sandeepjain
๐ #gfgPOTD Day 24
๐น Problem: Kth element in Matrix
๐น Approach: Min-heap to store all elements, then pop (k-1) times to get the kth smallest
๐น Time Complexity: O(Nยฒ log Nยฒ)
๐น Space Complexity: O(Nยฒ)
@geeksforgeeks@sandeepjain#160gfg#GFG
๐ #gfgPOTD Day 23
๐น Problem: Closest Neighbour in BST
๐น Approach: BST traversal with conditional recursion; track max node value โค target during the path to k
๐น Time Complexity: O(H)
๐น Space Complexity: O(H)
@geeksforgeeks@sandeepjain#160gfg#GFG#DSA
๐ #gfgPOTD Day 22
๐น Problem: Sum of nodes on the longest path
๐น Approach: DFS with height and sum tracking using a custom Pair class
๐น Time Complexity: O(N)
๐น Space Complexity: O(H)
๐น Tags: Tree, DFS, Recursion
@geeksforgeeks@sandeep_jain
๐งฉ Day 21 of my #gfgPOTD
Problem: Find rectangle with corners as 1
Approach: For each row, store indices of columns where value is 1.
Time Complexity: O(nยฒ * m)
Space Complexity: O(n * m)
@geeksforgeeks#Matrix#HashMap#DSA#POTD#GeeksForGeeks
๐ฟ Day 20 of my #gfgPOTD
Problem: Print leaf nodes from preorder traversal of BST
Approach:If the next is smaller โ push to stack (left subtree).
If the next is greater โ pop from stack while it's
Time: O(n)
Space: O(n)
@geeksforgeeks#DSA#BinaryTree#BST#POTD
I am thrilled to receive an exclusive bag from @geeksforgeeks. @gfg has been an incredible platform that has greatly enhanced my coding skills and kept me motivated throughout my journey. I look forward to continuing this journey and exploring more with @GFG. @sandeep_jain
๐ Day 18 of my #gfgPOTD
Problem: Pythagorean Triplet
Approach : Store frequency of array elements in a boolean array.
Time Complexity: O(MAXยฒ)
Space Complexity: O(MAX)
@sandeepjain@geeksforgeeks#POTD