Day 139 of 160 days of @geeksforgeeks .Solved "Fixing Two nodes of a BST" .Did in-order traversal to spot the two misplaced nodes (where the order breaks), then swapped their values to restore the BST without modifying its structure. #geekstreak #gfg #gfg160

Day 138 of 160 days of @geeksforgeeks .Today's problem: BFS of Graph.Did a classic Breadth First Search traversal starting from vertex 0. Used a queue and visited array — textbook BFS setup, following the given adjacency list order left to right. #geekstreak2025 #gfg160

Day 137 of 160 days of @geeksforgeeks .Solved DFS of Graph today!.Used a simple DFS traversal starting from vertex 0, following the adjacency list as is — classic recursion + visited array combo. Neat and fundamental!.#geekstreak2025 #gfg160

Day 136 of 160 days of @geeksforgeeks .Solved Maximize Partitions in a String using a greedy approach in O(n) time!.Tracked last occurrences of characters, expanded window till all chars were self-contained, then cut the partition. #geekstreak2025 #gfg160

Day 135 of 160 days of @geeksforgeeks .Solved Gas Station problem using a greedy one-pass approach in linear time!.Tracked total gas vs total cost and local tank balance — found the perfect starting station (if any) in O(n) 😎.#geekstreak2025 #gfg #gfg160

Generate videos in just a few seconds. Try Grok Imagine, free for a limited time.

Day 134 of 160 days of @geeksforgeeks .Solved Job Sequencing Problem using a Priority Queue (Max Heap) with O(log n) operations!.Scheduled jobs greedily by highest profit while respecting deadlinessqueezed out max profit and max number of jobs! 🔥📈.#geekstreak2025 #gfg #gfg160

Day 133 of 160 days of @geeksforgeeks .Solved Activity Selection using a Greedy algorithm in O(n log n) time!.Sorted activities by finish time and picked the next non-overlapping one — classic greedy move to maximize the count. 💯🔥.#geekstreak2025 #gfg #gfg160

Day 132 of 160 days of @geeksforgeeks .Solved Minimum Platforms using a Greedy + Two-pointer approach with O(n log n) time!.Sorted arrival and departure times, then used two pointers to simulate platform usage . #geekstreak2025 #gfg #gfg160

Day 131 of 160 days of @geeksforgeeks .Solved Word Break using DP in O(n*m) 🧠.Given a string s and a dictionary of words, check if s can be formed by concatenating words from the dictionary. Classic dynamic programming with prefix checks! 💡.#geekstreak #gfg #gfg160

Day 130 of 160 days of @geeksforgeeks .Solved Boolean Parenthesization using DP 🧠.Given a boolean expression with T, F, and operators (&, |, ^), count all valid ways to parenthesize it to get True. Classic recursive DP with memoization!.#geekstreak #gfg #gfg160

Day 129 of 160 days of @geeksforgeeks .Solved Matrix Chain Multiplication using DP! 🏗️🔢.Optimized matrix multiplication order to minimize operations. Classic MCM DP problem—split, compute, and store!.#geekstreak #gfg #gfg160

Day 128 of 160 days of @geeksforgeeks .Solved Total Decoding Messages using DP in O(n) TC & O(1) SC! 🔢📜.Converted numeric strings to valid letter sequences efficiently. Classic dynamic programming trick to count possible decodings!.#geekstreak #gfg #gfg160

Day 127 of 160 days of @geeksforgeeks .Solved Stickler Thief II using DP in O(n)! .Maximized the loot while respecting the circular house arrangement. Smart dynamic programming solution to avoid adjacent robberies!.#geekstreak #gfg #gfg160

Day 126 of 160 days of @geeksforgeeks .Solved Stickler Thief using DP! 🏡💰.Calculated the max money the thief can loot without robbing two consecutive houses. Smartly optimized choices using dynamic programming. #geekstreak #gfg #gfg160

Day 125 of 160 days of @geeksforgeeks .Solved Stock Buy and Sell – Max 2 Transactions Allowed using DP!.Calculated the max profit by optimizing buy-sell decisions for up to 2 transactions. Efficient and clear dynamic programming solution!.#geekstreak #gfg #gfg160

Day 124 of 160 days of @geeksforgeeks .Solved Stock Buy and Sell – Max K Transactions Allowed using DP!.Calculated the max profit with up to k transactions by optimizing buy and sell decisions. Efficient dynamic programming approach!.#geekstreak #gfg #gfg160

RT @heyBarsee: We just had one of the biggest days in AI. -Deepseek-V3.-Google Gemini 2.5.-GPT-4o image generation .-Zapier MCP protocol….

Day 123 of 160 days of @geeksforgeeks .Solved Partition Equal Subset Sum using DP!.Checked if the array can be divided into two subsets with equal sums. Efficient dynamic programming approach. #geekstreak2025 #gfg #gfg160

Day 122 of 160 days of @geeksforgeeks .Solved Subset Sum Problem using DP!.Checked if a subset with a given sum exists using a dynamic programming approach. Efficient and clean solution. #geekstreak #gfg #gfg160

Day 121 of 160 days of @geeksforgeeks .Solved Minimum Jumps using a Greedy Approach!.Efficiently determined the minimum number of jumps to reach the end of the array. Returned -1 if unreachable. #geekstreak #gfg #gfg160