Solved LeetCode 844 with a stack for efficient string editing

💡 Day 84 of My LeetCode Journey – Problem 1614: Maximum Nesting Depth of Parentheses Today’s problem tested my understanding of stack concepts and string traversal — determining how deeply parentheses are nested in a given string. 🧠 Concept: The idea is simple yet elegant: Traverse the string character by character. Use a counter to track the number of open parentheses (. Update the maximum depth whenever the count increases. Decrease the counter when a closing parenthesis ) appears. Example: "(1+(2*3)+((8)/4))+1" → Maximum depth = 3 ✅ Key Takeaways: Strengthened understanding of parentheses matching and depth counting. Improved ability to simulate stack behavior without extra space. Reinforced skills in clean logic implementation and iteration control. Small yet powerful problems like this sharpen clarity, precision, and logical thinking 🧩 #LeetCode #ProblemSolving #100DaysOfCode #DSA #CodingChallenge #Programming #LogicBuilding #Cplusplus #DailyCoding #LearningEveryday

🔥 Day 83 of My LeetCode Journey – Problem 242: Valid Anagram Today’s problem focused on one of the most classic string challenges — determining whether two strings are anagrams of each other. An anagram means both strings contain the same characters with the same frequency, just arranged differently. 💡 Concept: If two strings have identical character counts for every letter, they’re anagrams. Common approaches include: Using a frequency counter (hash map or array) Sorting both strings and comparing them directly ✅ Key Takeaways: Strengthened logic around hash maps and string frequency counting Learned efficient ways to compare large datasets of characters Reinforced time-space optimization techniques for string problems Small problems like this one help sharpen attention to detail and analytical accuracy, key skills for every programmer 🚀 #LeetCode #ProblemSolving #100DaysOfCode #DSA #Cplusplus #CodingChallenge #Anagram #Programming #LogicBuilding #LearningEveryday

// Type Casting in C++ - Two Approaches // 1. C-style cast new_data_type variable_name = (new_data_type)existing_variable; // 2. C++ style cast (recommended) new_data_type variable_name = static_cast<new_data_type>(existing_variable); While both achieve similar results, static_cast is preferred in modern C++ because: • Compile-time type checking • Better readability and intent • Safer than C-style casts Which one do you use in your projects? 👇" #CPP #Programming #SoftwareDevelopment #CodingTips

Level Up Your Coding Skills: Understanding the Sliding Window Algorithm The Sliding Window Algorithm is one of the most essential techniques for tackling array, string, and list problems efficiently. If you're interviewing or just want to write better code, this is a must-know! Core concepts in the video: ➡️ Why it matters: Learn how this algorithm drastically reduces time complexity (often from O(N^2) to O(N)) by avoiding redundant calculations. ➡️ What is it: It's essentially a sub-array or sub-string that "slides" through a data structure. ➡️ How it slides: We explore the key mechanics of adding elements to the right and dropping them from the left. ➡️ Fixed vs. Dynamic Windows: Understand the difference between finding a maximum sum of a fixed size 'k' (Fixed) versus finding the longest sub-string with no repeating characters (Dynamic). #SlidingWindow #Algorithms #DataStructures #CodingInterview #ProblemSolving #Programming #SoftwareDevelopment #ComputerScience #CodingTips #LearnToCode

🔥 Day 70 of #100DaysOfCode 🔥 💡 Problem: Number of Steps to Reduce a Number to Zero – LeetCode ✨ Approach: A simple while loop logic — divide the number by 2 if it’s even, else subtract 1. Repeated until it hits zero. Clean, elegant, and lightning fast! ⚡ 📊 Complexity Analysis: Time Complexity: O(log n) – each division by 2 halves the number Space Complexity: O(1) – constant space ✅ Runtime: 0 ms (Beats 100%🔥) ✅ Memory: 41.95 MB 🚀 Key Takeaway: Sometimes, brilliance lies in simplicity — clear logic, powerful performance! #LeetCode #100DaysOfCode #ProblemSolving #CodingChallenge #Programming #DSA #LogicBuilding #Efficiency #CodeDaily #DeveloperJourney

In this program, I used a while loop to print numbers from 1 to 5 and calculate their total sum at the same time. 🔁 It’s a great example of how loops can perform multiple tasks — displaying numbers and performing calculations in one go! 🚀 ✨ Concepts Used: ➡️ Variable initialization (c = 1, sum = 0) ➡️ While loop condition (c <= 5) ➡️ Increment operators (c = c + 1, sum = sum + 1) ➡️ Output using printf() This simple logic builds the foundation for more complex algorithms in programming! 💪 #CProgramming #WhileLoop #CodingPractice #LearnToCode #ProgrammingBasics #CodeJourney #ProblemSolving 💻

📅 Day 33 of #100DaysOfCode Problem: Basic Calculator (LeetCode 224) Approach: 1️⃣ Parsed the string character by character, keeping track of current number, sign, and result. 2️⃣ When encountering '+' or '-', added the previous number to the result and reset the current number. 3️⃣ Used a stack to handle parentheses — pushed the current result and sign when '(' was found, then restored them after ')'. 4️⃣ Carefully computed the final result by adding the last pending number after traversal. #100DaysOfCode #LeetCode #DSA #ProblemSolving #Stack #Cplusplus #CodingChallenge #Algorithms #Math #CodeNewbie #Programming #SoftwareEngineering #CodingJourney #TechCommunity #DeveloperLife #KeepLearning #LearningInPublic #Motivation

🔥 LeetCode POTD: Number of Substrings With Only 1s Today’s question was actually on the easier side… once you notice the key detail: it’s a binary string 👀. Here’s how my thought process went ⬇️ At first, I considered generating all substrings and then checking which ones contain only 1s. But of course… generating + checking = ❌ higher time complexity, which breaks the constraints. Not ideal. Then I took a step back and realized: 👉 Since it's a binary string, the substrings made of only 1s form clear continuous blocks. 👉 For each block of consecutive 1s of length k, the number of valid substrings is: k × (k + 1) / 2 ✨ Using this pattern, the whole problem can be solved in O(n) time. Dropped my solution in the image below 📸 Would love to hear how you approached it! 😄💬 #leetcode #leetcodechallenge #dsa #coding #programming #problemsolving #binarystrings

💡 5 Underrated VS Code Tricks Every Developer Should Know 1️⃣ Multi-Cursor Editing: Press Alt + Click to edit multiple lines at once — game changer for repetitive code. 2️⃣ Command Palette (Ctrl + Shift + P): Access everything — from extensions to settings — instantly. 3️⃣ Zen Mode: Focus without distractions using Ctrl + K Z. 4️⃣ Auto Rename Tag: Install this extension — change one HTML tag, both update. 5️⃣ Peek Definition: Hover + Alt + F12 — see function definitions inline, no tab switching. 🚀 Save this for your next coding session. It’ll make your workflow twice as fast. #VSCode #DeveloperTips #CodingLife #WebDevelopment #Productivity #Programming

n this program, I used a while loop to print numbers from 1 to 10 on the screen. 🎯 It’s a simple example but a great way to understand how loops work in C programming — they help us repeat actions automatically without writing the same line again and again! 🔁 ✨ Concepts Used: ➡️ Variable initialization (n = 1;) ➡️ Loop condition (n <= 10) ➡️ Increment operator (n++) ➡️ Output using printf() Every small program is a step toward writing bigger logic and better code! 🚀 #CProgramming #CodingPractice #WhileLoop #ProgrammingBasics #CodeJourney #LearningByDoing 💻