"Day 55: LeetCode 739 - Daily Temperatures with Stack"

🌿Day 73 LeetCode: Next Greater Element I (496) Approach: Used a stack to find the next greater element for each number in nums2 and stored results in a hash map for quick lookup in nums1. ✨ Learned how to use monotonic stacks for next-greater problems — a smart way to reduce time complexity and strengthen logic! 📈 Improved understanding of stacks, hash maps, and element mapping techniques in C++. #LeetCode #100DaysOfCode #DSA #Stack #HashMap #Arrays #ProblemSolving #CodingJourney #CodeEveryday

🌻Day 56 LeetCode: Number of Ways to Split Array (2270) Approach: Calculated prefix sums to efficiently determine valid split points where the left sum is greater than or equal to the right sum. ✨ Learned how prefix sums simplify cumulative comparison problems and help avoid repeated summations — boosting both logic and efficiency! 📈 Improved understanding of prefix arrays, cumulative sums, and linear-time array traversal in C++. #LeetCode #100DaysOfCode #DSA #Arrays #PrefixSum #ProblemSolving #CodingJourney #CodeEveryday

🔹 Day 82 of #100DaysOfLeetCodeChallenge 🔹 🚀 Problem: Power of Two 🔑 Topic: Bit Manipulation 🧠 Approach: A number is a power of two only if it has exactly one set bit in its binary representation. Example: 1 → 0001 2 → 0010 4 → 0100 8 → 1000 The trick: 👉 n & (n - 1) removes the lowest set bit. So for powers of two, it becomes 0. Formula used: (n > 0) AND (n & (n - 1)) == 0 ⏳ Time Complexity: O(1) 💾 Space Complexity: O(1) 📌 Example: Input: 16 → true Input: 3 → false 🎯 Takeaway: Bit manipulation is one of the cleanest ways to check power-of-two — no loops, no logs, just pure binary magic! ⚡ #LeetCode #BitManipulation #DSA #ProblemSolving #CodingJourney #100DaysOfLeetCodeChallenge 🚀

#gfg160 Challenge - Day 87 ✅ 🔥 Maximum Path Sum in a Binary Tree 🍀 Problem: Find the path in a binary tree that gives the maximum sum of node values, where the path can start and end at any node. ⚙️ Approach: Used Recursion + DFS: For each node, compute maximum path sum from its left and right subtrees. If a path's sum is negative, consider it as 0 (ignore that branch). Update a global variable maxi to track the maximum sum found so far. 💡 Key takeaway: This problem teaches how postorder traversal and dynamic recursion can be combined to handle global maximum problems efficiently. #geekstreak2025 #GeeksForGeeks #DSA #BinaryTree #Recursion #DynamicProgramming #LogicBuilding #ProblemSolving #CodeEveryday #gfg160

✨Day 67 LeetCode: Letter Combinations of a Phone Number (17) Approach: Used backtracking to generate all possible letter combinations mapped from digits, following the classic phone keypad pattern. ✨ Learned how recursion and backtracking can explore all possible paths efficiently — a great exercise in mapping and combinatorial logic! 📈 Improved understanding of recursion, string building, and backtracking patterns in C++. #LeetCode #100DaysOfCode #DSA #Backtracking #Strings #ProblemSolving #CodingJourney #CodeEveryday

🌷Day 66 LeetCode: Top K Frequent Elements (347) Approach: Counted element frequencies using a map and sorted them by their frequency to extract the top K elements. ✨ Learned how frequency mapping and custom sorting can efficiently identify the most frequent elements — a neat and intuitive solution! 📈 Improved understanding of maps, sorting with lambda functions, and frequency analysis in C++. #LeetCode #100DaysOfCode #DSA #Map #Sorting #ProblemSolving #CodingJourney #CodeEveryday

🔥 #gfg160 Challenge – Day 87 ✅ 🌳 Maximum Path Sum in a Binary Tree 🧩 Problem: Find the path in a binary tree that gives the maximum sum of node values, where the path can start and end at any node. ⚙️ Approach: Used Recursion + DFS: For each node, compute maximum path sum from its left and right subtrees. If a path’s sum is negative, consider it as 0 (ignore that branch). Update a global variable maxi to track the maximum sum found so far. 💡 Key takeaway: This problem teaches how postorder traversal and dynamic recursion can be combined to handle global maximum problems efficiently. #geekstreak2025 #GeeksForGeeks #DSA #BinaryTree #Recursion #DynamicProgramming #LogicBuilding #ProblemSolving #CodeEveryday #gfg160

👉Day 73 of 160 – LeetCode Challenge Problem: Validate Binary Search Tree 👉 Problem: we have to check given binary tree is binary search tree or not. 👉Key Concept: using DFS traversal in tree by comparing it with max val and min val for for validating a given binary tree is BST or not.

🌳 Day 26 — Same Tree Problem 🌲 ✅ Problem: Same Tree ✅ Runtime: 0 ms (Beats 💯%) ✅ Memory: 12.73 MB (Beats 77.63%) ✅ Topic: Binary Tree, Recursion 💡 Learning: This problem focuses on checking if two binary trees are structurally identical and have the same node values. The recursive solution works perfectly — it compares each node and its left/right subtrees step-by-step. 🧠 Key Idea: If both nodes are null → trees are same. If one is null → not same. Otherwise → compare current node values + recursively check left and right subtrees. #Day26 #LeetCode #100DaysOfCode #BinaryTree #Recursion #CPP #DSA