Solved LeetCode 242: Valid Anagram with hash map and sorting

🌟 Day 82 of My LeetCode Journey – Problem 796: Rotate String Today’s challenge was quite interesting — checking if one string can become another through rotation! In this problem, we determine whether rotating a string s by any number of positions can produce another string goal. 💡 Concept: If s and goal are of the same length, then goal must be a substring of s + s. Example: s = "abcde" and goal = "cdeab" 👉 s + s = "abcdeabcde" — and since "cdeab" is inside, it’s a valid rotation! ✅ Key Takeaways: Reinforced string manipulation and substring search logic. Understood how concatenation can simplify complex rotation checks. A great reminder that sometimes the simplest ideas lead to elegant solutions. Every problem adds one more step to mastering logic and pattern recognition 💪 #LeetCode #ProblemSolving #100DaysOfCode #DSA #CodingJourney #Cplusplus #Programming #StringManipulation #LearningEveryday

💡 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 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

Two trees. Same leaves. Different structure. 🍃 In this video, we break down LeetCode 872 – Leaf-Similar Trees using modern C++ and intuitive DFS traversal. Understand how recursion simplifies tree comparisons and how to write clean, interview-ready code. 🎥 Watch here → https://lnkd.in/dkGFitU8 #LeetCode #Cplusplus #LANAcademy #CodingInterview #BinaryTree #Programming

🚀 Day 46 of #100DaysOfCode 📌 LeetCode 844 — Backspace String Compare Today I tackled a problem that looks simple but exposes whether you can simulate string editing efficiently. 🧠 My Intuition Instead of building and modifying strings directly (which is messy and inefficient), I treated the input like a real typing scenario: Use a stack to simulate typing. Push normal characters. Pop when a # appears (acting as backspace). Build the final strings for both inputs and compare them. This makes the whole process clean and avoids unnecessary edge-case headaches. 🔥 Takeaway: When dealing with “string editors,” stacks simplify life. You avoid messy manual string manipulation and let the stack handle the backtracking for you. #leetcode #dsa #javacoding #codingjourney #100daysofcode #leetcode844 #programming

📅 Day 28 of #100DaysOfCode 🚀 Problem: 49. Group Anagrams (LeetCode) Approach: -> For each string, sort its characters — the sorted version acts as a unique key for its anagram group. -> Store all words with the same sorted key inside a hash map (unordered_map<string, vector<string>>). -> After processing all words, collect all grouped values from the map into a result vector. ->This leverages hashing + sorting for efficient grouping — O(n * k log k) where k is average string length. #100DaysOfCode #LeetCode #DSA #ProblemSolving #Cplusplus #CodingChallenge #Algorithms #DataStructures #Hashing #StringManipulation #CodingCommunity #Programming #DeveloperLife #LearnToCode #TechCommunity #DailyDSA #CodeNewbie #SoftwareEngineering #CodingJourney #Consistency #KeepLearning #LearningInPublic #GrowthMindset #Motivation

🚀 Day 16 of my 120 Days LeetCode Challenge! 🧩 Problem 16: 3Sum Closest (Medium) The problem statement is: Given an integer array nums and an integer target, find three integers in nums such that their sum is closest to the target. Return the sum of these three integers. You may assume that each input would have exactly one solution. 💡 Example: Input: nums = [-1, 2, 1, -4], target = 1 Output: 2 Explanation: The sum closest to 1 is 2 (-1 + 2 + 1 = 2). ⚙️ Algorithm Used: For this problem, I implemented a two-pointer approach after sorting the array. Here’s the step-by-step logic: Sort the array to arrange elements in increasing order. Fix one element and then use two pointers — one starting from the next index (left) and another from the end (right). Calculate the sum of these three elements. If the current sum is closer to the target than the previously recorded closest sum, update the closest sum. Move pointers accordingly: If currentSum < target, move left++ (to increase sum). If currentSum > target, move right-- (to decrease sum). If an exact match is found, return it immediately since it’s the best possible. ⏱ Time Complexity: O(n²) 💾 Space Complexity: O(1) 🔥 This problem helped me strengthen my understanding of sorting and two-pointer techniques for array-based problems. I’m steadily progressing with consistency and learning something new every day! 💪 #Day16 #LeetCode #CodingChallenge #Cplusplus #DSA #ProblemSolving #TwoPointer #LearningJourney #100DaysOfCode #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 💻

Master the most essential Hash Map and Set problems on LeetCode — from simple frequency checks to advanced logic patterns. Each tutorial walks you step by step through clean, modern C++ solutions, explained visually and intuitively. 🔹 Ideal for coding interview preparation 🔹 Covers both Easy and Medium problems 🔹 Topics: frequency maps, sets, hash tables, string comparison Patterns. Logic. Frequency. Learn to recognize them all in this focused Hash Map & Set Series in C++ — from easy to medium, explained clearly and efficiently. 🎥 Watch the full playlist 👉 https://lnkd.in/dMv6jfNp #LeetCode #Cplusplus #Programming #DataStructures #Algorithms #CodingInterview #LANAcademy #LearnToCode

🚀 Tried breaking down Pascal’s Triangle in the simplest way 👇 We’ve all seen this pattern(Pascal's Triangle) somewhere but have you ever wondered how it’s actually generated? 🤔 The question is simple: 👉 Given an integer n, generate the first n rows of Pascal’s Triangle. For example, when n = 3 💡 How this approach clicked: While thinking about how each element is formed, I realized that every value in Pascal’s Triangle is just a combination (nCr) and this relation C(n,r)=C(n,r−1)∗(n−r+1)/r , is connecting each next element with the previous one computed. This not only makes the logic cleaner but also eliminates redundant factorial computations. so, here is the code and the dry run of the solution , once you see it this way, Pascal’s Triangle feels surprisingly simple! 😄 #C++ #DSA #ProblemSolving #CodingJourney #PascalTriangle #Programming #Learn #CodeVisualization #WomenInTech