Understanding Recursion in C++

Day 99/100 – DSA Challenge 🚀 Topic: Variable Window Key Learning: So one of the most powerful techniques in problem-solving especially in DSA is the Variable Window (Dynamic Sliding Window). What is it? A method where we use two pointers to create a window that expands and shrinks dynamically based on a condition. Why is it important? It helps reduce time complexity from O(n²) → O(n) in many problems involving arrays and strings GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

Solved another interesting array problem today: Segregate 0s and 1s in-place using the Two Pointer Approach. Problem Given an array containing only 0s and 1s, rearrange it so that all 0s come on the left side and all 1s come on the right side. Approach 1. I used the two pointer technique: 2. One pointer starts from the beginning 3. Another pointer starts from the end 4. Move pointers inward based on correct placement 5. Swap only when needed Why this approach? Time Complexity: O(n) Space Complexity: O(1) Efficient because it modifies the array in-place Learning This problem is a great example of how two pointers can help optimize array manipulation problems without using extra memory. #DSA #Coding #CPP #Programmers #SoftwareDeveloper #TwoPointers #ProblemSolving #DataStructures #Algorithms

Day 94/100 – DSA Challenge 🚀 Topic:subset generation Key Learning: Subset generation is the process of generating all possible subsets of a given set. It is also known as the Power Set. Key Idea For every element, we have 2 choices: Include it Exclude it Total subsets = 2ⁿ (where n = number of elements) Example: For a set {1, 2, 3} Subsets → {}, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

Back in my early college days, I came up with a simple trick to convert decimal to binary — I call it the Bit Inversion method. Super easy and quick for 8-bit numbers. Thought of sharing it now — hope you find it useful! 😊 #Programming #Coding #ComputerScience #BitManipulation #DataStructures #Algorithms

** Golden Rule ** “Sorted + Pair OR Continuous Range = Two Pointers” This infographic is a quick cheat sheet to identify patterns instantly and apply the right technique . Mastering the Two-Pointer Approach in DSA. Which problem did you recently solve using two pointers? #DataStructures #Algorithms #DSA #CodingInterview #Programming #ComputerScience #TechLearning #ProblemSolving #Developers #CodingTips #byteXL

Most beginners ignore this… and regret later LeetCode 191 – Number of 1 Bits (Easy) This one problem teaches you: - Bit manipulation basics - Counting set bits efficiently - A pattern used in many interviews Looks simple… but it’s a foundation builder Explained here: https://lnkd.in/dGD-7HbV 1650+ DSA problems solved… still learning daily 🔥 Consistency > Talent 🚀 #leetcode #dsa #coding #bitmanipulation #programming #beginners

Sharpen your problem-solving skills, one step at a time 💡 Removing duplicates from a sorted array is a classic—simple logic, powerful impact. Pause, think, and build the solution yourself before checking the answer! 🚀 #ProblemSolving #DataStructures #Algorithms #CodingSkills #TechTraining #LearnToCode #Programming #Developers

⚠️ 𝗪𝗵𝘆 𝟬.𝟭 + 𝟬.𝟮 ≠ 𝟬.𝟯 𝗶𝗻 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 Try this in many languages: 0.1 + 0.2 You might expect: 0.3 But you often get: 0.30000000000000004 😅 Why? Because computers don’t store numbers the way we write them. They use **binary representation**. Some decimal numbers can’t be stored exactly, so small precision errors appear. That’s why: 💰 financial systems avoid floats 📊 rounding becomes important ⚠️ tiny errors can grow in large calculations 𝗖𝗼𝗺𝗽𝘂𝘁𝗲𝗿𝘀 𝗮𝗿𝗲 𝗽𝗿𝗲𝗰𝗶𝘀𝗲 — 𝗯𝘂𝘁 𝗻𝗼𝘁 𝗮𝗹𝘄𝗮𝘆𝘀 𝗮𝗰𝗰𝘂𝗿𝗮𝘁𝗲. Did this ever surprise you when you first saw it? 🤔 #Programming #Developers #ComputerScience #SoftwareEngineering #CodingLife #TechExplained #DataTypes #LearningInPublic #ITStudent #DeveloperLife #TechCommunity #Coding #ProblemSolving

Solved LeetCode: Power of Two using Bit Manipulation Learned how to efficiently check whether a number is a power of 2 using binary properties. A number is a power of two if it has only one set bit in its binary representation. Used the trick: n > 0 && (n & (n - 1)) == 0 Optimized solution with: Time Complexity: O(1) Space Complexity: O(1) This problem helped me understand bit manipulation, binary concepts, and optimized checking techniques https://lnkd.in/dFdQhMmS GitHub Repo: https://lnkd.in/gg4daDpn #day10 #DSA #Cpp #LeetCode #Coding #Programming #Learning #ProblemSolving #BitManipulation

Flatten Binary tree to linked list Approach: Do kind of post-order traversal ( right -> left -> root ) maintain a previous node go right (recursively) go left (recursively) make root->right point to previous and root->left point to null and update previous to root TC: O(N) SC: O(N) - recursive stack #DSA #programming #coding #buildinpublic #Technology #ProblemSolving #LeetCode #LearnInPublic  #Consistency