Kush Kumar

@NITRR || CSE || JAVA || DSA || WEB DEVELOPMENT || @LeetCode- 400+ Problem Solved || @HackerRank 5 Star in C & 4 Star in CPP

[Kush Kumar @rtlavkush]

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

[Kush Kumar @rtlavkush]

@vanshdevx I'm Interested Sir..

[Kush Kumar @rtlavkush]

🚀 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

[Kush Kumar @rtlavkush]

@Hrzx_x6 Congratulations Man 🎉

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #gfgPOTD Day 29
🔹 Problem: Search Pattern (Rabin-Karp Algorithm)
🔹 Approach: KMP Pattern Matching using LPS (Longest Prefix Suffix)
🔹 Time Complexity: O(N + M)
🔹 Space Complexity: O(M)
@geeksforgeeks @sandeepjain
#160gfg

[Kush Kumar @rtlavkush]

📘 #gfgPOTD Day 28
🔹 Problem: LCS of three strings
🔹 Approach: 3D Dynamic Programming
🔹 Time Complexity: O(N1 × N2 × N3)
🔹 Space Complexity: O(N1 × N2 × N3)
🔹 Tags: DP, LCS, 3D Array, String Matching
@geeksforgeeks @sandeepjain
#160gfg #GFG

[Kush Kumar @rtlavkush]

@jackmuscik6 @geeksforgeeks About to Win 👕 😇

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

📘 #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

[Kush Kumar @rtlavkush]

🧩 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

[Kush Kumar @rtlavkush]

🌿 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

[Kush Kumar @rtlavkush]

@DEV_Shivam3224 @geeksforgeeks @GFG @sandeep_jain thanks

[Kush Kumar @rtlavkush]

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

[Kush Kumar @rtlavkush]

🌟 Day 19 of my #gfgPOTD
Problem: Insert in Sorted Circular Linked List
Approach:Create the new node with given data.
If data is less than head.
Time Complexity: O(n)
Space Complexity: O(1)
@geeksforgeeks @sandeepjain #LinkedList #DataStructures #POTD

[Kush Kumar @rtlavkush]

@maity47199 @geeksforgeeks Let's Connect!

[Kush Kumar @rtlavkush]

🌟 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