Kush Gupta
@Mekushgupta
Followers
122
Following
9K
Media
183
Statuses
4K
Focused on Java Full-Stack Development | Tech Enthusiast 🚀 | Building & Exploring
Joined June 2021
RT @Param_eth: I spent $0 to learn Web3 development:. FREE Resources:. @useWeb3 is free.@QuickNode is free.@the_ethernaut is free.@AlchemyL….
0
159
0
I’d love to see the @dora_dao community on Discord — a space where ideas flow, connections deepen, and we grow together. Let’s co-create something meaningful and powerful. 💛.#GirlsWhoYap #WeBuildTogether.
0
0
1
RT @dora_dao: 🚨 Applications Are Now LIVE! 🚨.The Girls Who Yap Fellowship is officially open for entries 🧡. This fellowship is for YOU. 🫳Sc….
0
9
0
Problem: Coin Change (Minimum Coins). Approach: Use memoized recursion to find the minimum number of coins needed to make up the target amount. Time Complexity: O(N Ă— Sum). Space Complexity: O(N Ă— Sum).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
9
Problem: Coin Change (Count Ways).Approach: Use recursion with memoization to count total combinations to form target using given coins. Time Complexity: O(N Ă— Sum). Space Complexity: O(N Ă— Sum) .#GFG160 #geekstreak2024 @geeksforgeeks
0
0
4
Problem: 0 - 1 Knapsack Problem.Approach: Recursion + memoization to store max value at each item & weight state. Time Complexity: O(N * W). Space Complexity: O(N * W). #GFG160 #geekstreak2024 @geeksforgeeks
0
0
3
I broke my #GFG160DayChallenge streak after 117 days, but I’m back again!.No day count this time — just focused on staying consistent. Let’s restart the grind!.#geekstreak2024 @geeksforgeeks.
Problem: Min Cost Climbing Stairs.Approach: Recursion with memoization. Idea: At each step, choose the minimum cost from the previous one or two steps. Time Complexity: O(n).Space Complexity: O(n).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
4
Problem: Min Cost Climbing Stairs.Approach: Recursion with memoization. Idea: At each step, choose the minimum cost from the previous one or two steps. Time Complexity: O(n).Space Complexity: O(n).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
4
RT @Durgesh_Borse26: Operation Dost:When India extended its hand to Turkey during the 2023earthquakes,it was humanity in action no strings….
0
1
0
Completed #GfG160 and got rewarded! 🎉💚 @geeksforgeeks has always been my go-to for coding practice, but its articles aren’t visible on Google Search for now. Hoping @Google helps bring them back! Till then, let’s keep learning. 🚀 #SupportGfG. @geeksforgeeks @Google.
Learning & upskilling should never stop!. Continue exploring all that we have to offer on other search engines like Bing, DuckDuckGo, Brave, Yahoo Search, Yandex and more. And don't forget to bookmark and save the link to our website: #gfg #geeksforgeeks
1
0
1
🏆 Day 117 of My #GFG160DayChallenge. Problem: Ways to Reach the N'th Stair.Approach: Use recursion with memoization (Top-Down DP) to count ways to reach the nth stair using 1-step or 2-steps. Time Complexity: O(N).Space Complexity: O(N).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
3
🏆 Day 116 of My #GFG160DayChallenge. Problem: Edit Distance.Approach: Use recursion with memoization to compute the minimum operations needed to convert one string to another. Time Complexity: O(N * M).Space Complexity: O(N * M).#GFG160 #geekstreak2024 @geeksforgeeks .#gfg160
0
0
3
🏆 Day 115 of My #GFG160DayChallenge. Problem: Palindrome Substrings.Approach: Expand around centers for both even and odd-length palindromes, counting valid ones. Time Complexity: O(N²).Space Complexity: O(1).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
2
🏆 Day 114 of My #GFG160DayChallenge. Problem: Longest Palindrome in a String.Approach: Expand around centers for both even and odd-length palindromes, updating the longest found. Time Complexity: O(N²).Space Complexity: O(1).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
1
Day 113 of My #GFG160DayChallenge. Problem: Longest Palindromic Subsequence.Approach: Use bottom-up DP, updating dp[i][j] as 2 + dp[i+1][j-1] if characters match, else take max of adjacent values. Time C: O(N²).Space C: O(N²).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
1
🏆 Day 112 of My #GFG160DayChallenge!. Problem: Longest Common Subsequence.Approach: Use a DP table to store LCS lengths, updating based on character matches or previous max values. Time Complexity: O(N * M).Space Complexity: O(N * M).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
2
Day 111 of My #GFG160DayChallenge. Problem: Longest String Chain.Approach: Sort words, use DP with HashMap to track chain lengths, and update by checking all possible predecessors. Time Complexity: O(N log N + N * L²).Space Complexity: O(N).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
1
🏆 Day 110 of My #GFG160DayChallenge. Problem: Longest Increasing Subsequence.Approach: Use binary search with a dynamic array to efficiently build the LIS. Time Complexity: O(N log N).Space Complexity: O(N).#GFG160 #geekstreak2024 @geeksforgeeks .#gfg160
0
0
2
Day 109 of My #GFG160DayChallenge. Problem: Longest Bounded-Difference Subarray.Approach: Use a deque to maintain min & max values dynamically, updating the longest valid subarray efficiently. Time Complexity: O(N) . Space Complexity: O(N).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
0
Day 108 of My #GFG160DayChallenge. Problem: K Sized Subarray Maximum.Approach: Use a deque to maintain indices, ensuring the front always holds the maximum while sliding the window efficiently. Time Complexity: O(N). Space Complexity: O(K).#GFG160 #geekstreak2024 @geeksforgeeks
0
0
1