🎉 Excited to share that I've been selected as one of the winners of the #gfg160 Daily Problem Solving Challenge !📷Hard work and consistency pay off! Big thanks to @geeksforgeeks @sandeep_jain for this amazing opportunity and the exclusive GfG T-Shirt. #Coding #ProblemSolving
Day 135 of #GFG160DayChallenge Problem: Job Sequencing Problem Approach: We sort jobs by profit in descending order. For each job, we try to place it in the latest possible free slot before its deadline. #GFG160 #geekstreak2025 @geeksforgeeks
Day 134 of #GFG160DayChallenge Problem: Activity Selection Approach: We first create a list of (start, finish) pairs and sort them by finish time. #GFG160 #geekstreak2025 @geeksforgeeks @sandeep_jain
Day 133 of #GFG160DayChallenge Problem: Minimum Platforms Required Approach: We sort both the arrival and departure arrays and use two pointers to simulate the train schedule: #GFG160 #geekstreak2025 @geeksforgeeks @sandeep_jain
Day 132 of #GFG160DayChallenge Problem: Word Break Approach: We use recursive backtracking with a dictionary hash map to check if the input string can be segmented into space-separated words present in the dictionary. #GFG160 #geekstreak2025 @geeksforgeeks @sandeep_jain
GeeksforGeeks is more than just a platform — it’s a reliable 24/7 mentor for every tech enthusiast. 💻 Stuck on a doubt? Need guidance? GFG is always there with quick support and quality content you can trust. Choose @GFG — because your career deserves the best. @geeksforgeeks
Day 131 of #GFG160DayChallenge Problem: Boolean Parenthesization Appro: We use recursive DP with memoization to count the number of ways to parenthesize the expression so that it evaluates to True. T C: O(n³) S C: O(n²) #GFG160 #geekstreak2025 @geeksforgeeks @sandeep_jain
Day 130 of #GFG160DayChallenge Problem: Matrix Chain Multiplication Approach: We use bottom-up DP to find the minimum cost of multiplying matrices defined by dimensions in arr[]. Time Complexity: O(n³) #GFG160 #geekstreak2025
Day 129 of #GFG160DayChallenge Problem: Decode Ways Approach: We use space-optimized dynamic programming: prev1 stores ways to decode up to previous character. prev2 stores ways up to two characters back. Time Complexity: O(n) Space Complexity: O(1) #GFG160 #geekstreak2025
Day 128 of #GFG160DayChallenge Problem: Stickler Thief 2 (Circular Houses Variant) Approach: In this variation, the first and last houses are adjacent (circular street), so we can't rob both. Time Complexity: O(n) Space Complexity: O(1) #GFG160 #geekstreak2025 @sandeep_jain
Day 127 of #GFG160DayChallenge Problem: Stickler Thief Approach: This is a variation of the House Robber problem. Time Complexity: O(n) Space Complexity: O(n) #GFG160 #geekstreak2025 @geeksforgeeks
Day 126 of #GFG160DayChallenge Problem:Stock Buy and Sell – Max 2 Transactions Allowed Approach: We use dynamic programming where dp[i][j] stores the maximum profit using at most i transactions until day j T-C: O(n) S-C: O(n) #GFG160 #geekstreak2025 @geeksforgeeks
Day 125 of #GFG160DayChallenge Problem: Best Time to Buy and Sell Stock - K Transactions Approach:We maintain two arrays: buy[j]: max profit after buying the j-th stock sell[j]: max profit after selling the j-th stock T C: O(n * k) #GFG160 #geekstreak2025 @geeksforgeeks
Day 124 of #GFG160DayChallenge Problem: Partition Equal Subset Sum Approach: We first calculate the total sum of the array. If it's odd, we can't divide it equally. TC: O(n * sum) SC: O(n * sum) #GFG160 #geekstreak2025 @geeksforgeeks
Day 123 of #GFG160DayChallenge Problem: Subset Sum Problem Approach: We use 1D DP where dp[j] tells if sum j is possible using elements seen so far. T-Complexity: O(n * sum) S-Complexity: O(sum) #GFG160 #geekstreak2025 @geeksforgeeks
Day 122 of #GFG160DayChallenge Problem: Minimum Jumps Approach: We use a greedy strategy: jump keeps track of steps we can still take. T-Complexity: O(n) S-Complexity: O(1) #GFG160 #geekstreak2025 @geeksforgeeks
Day 121 of #GFG160DayChallenge Problem: Minimum Coins Approach:We use a 1D DP array dp[] where dp[i] holds the minimum number of coins needed to get sum i. Initialize all values as Integer. T-Complexity: O(n * sum) S-Complexity: O(sum) #GFG160 #geekstreak2025 @geeksforgeeks
Day 120 of #GFG160DayChallenge Problem: Coin Change Approach: This is a variation of the unbounded knapsack problem. We use a 1D DP array where dp[i] stores the number of ways to make sum i. Complexity: O(n * sum) Space : O(sum) #GFG160 #geekstreak2025 @geeksforgeeks
Day 119 of #GFG160DayChallenge Problem: 0/1 Knapsack Approach: A 1D DP array is used to optimize space. Iterate through items, and for each weight from W to wt[i]. Time: O(n * W) Space: O(W) #GFG160 #geekstreak2025 @geeksforgeeks
Day 118 of #GFG160DayChallenge Problem: Min Cost Climbing Stairs Approach: The idea is to use a bottom-up approach with constant space. Time: O(n) Space: O(1) #GFG160 #geekstreak2025 @geeksforgeeks
United States Trends
- 1. Northern Lights 44.6K posts
- 2. #Aurora 9,361 posts
- 3. #DWTS 52.9K posts
- 4. #RHOSLC 7,116 posts
- 5. Carmilla 1,863 posts
- 6. AI-driven Web3 N/A
- 7. Sabonis 6,207 posts
- 8. H-1B 34.4K posts
- 9. Justin Edwards 2,448 posts
- 10. #GoAvsGo 1,563 posts
- 11. Gonzaga 2,966 posts
- 12. #MakeOffer 9,064 posts
- 13. Louisville 18K posts
- 14. Creighton 2,300 posts
- 15. Eubanks N/A
- 16. MIND-BLOWING 36.1K posts
- 17. Jamal Murray N/A
- 18. Andy 59.5K posts
- 19. Cleto 2,518 posts
- 20. Oweh 2,120 posts
Something went wrong.
Something went wrong.