Adivya Chaturvedi’s Post

🚀 Day 4 of my Coding Challenge Today's problem was simple but a great reminder of string fundamentals in JavaScript. Problem Statement Given a string s, return the last character of the string. Example Input: "learncoding" Output: "g" Any language Approach Use string indexing with length - 1 to access the last character. function getLastCharacter(s) { return s[s.length - 1]; } console.log(getLastCharacter("learncoding")); // g Key Learning:- Strings are index-based length - 1 always points to the last character Small problems help strengthen core programming logic Consistency matters more than complexity. One problem every day 📚 #CodingChallenge #Day4CodingChallenge #JavaScriptDeveloper #DSA #DataStructures #Algorithms #ProblemSolving #CodingJourney #CodeDaily #LearnToCode #DevelopersLife #SoftwareDeveloper #FrontendDeveloper #FullStackDeveloper #TechCommunity #ProgrammingLife #CodeNewbie #CodingPractice #DeveloperJourney #CodingSkills #TechLearning #JavaScriptCoding #WebDeveloper #ProgrammingChallenge #DailyCoding #CodeMotivation #CareerInTech #DeveloperMindset #CodingGrind #TechGrowth

LeetCode Day 15 : Problem 151 (Reverse Words in a String) Just solved another LeetCode problem. It was "Reverse Words in a String", sounds familiar, right? But here's what I actually learned: Sometimes the best solution is knowing exactly which built-in tools to chain together. trim() removes leading and trailing spaces. split(/\s+/) splits on one or more spaces with no empty strings. reverse() flips the array. join(" ") puts it back with single spaces. Four methods, one line, done. This problem would have taken me much longer at the start of this journey. But after solving whitespace problems before, the /\s+/ regex was already in my toolkit. Every problem you solve teaches you something you use again later. The insight that made it click, strings are just arrays of words waiting to be manipulated. Know your array methods and string problems become much easier. Eighteen problems in. Sometimes the lesson isn't about a new algorithm or pattern. Sometimes it's about recognising that the tools you already have are exactly what you need. The real lesson? Build your toolkit problem by problem. Each solution you learn is a tool you carry into the next one. #DSA #LeetCode #JavaScript #CodingJourney #Programming

Leetcode Day 1 : Problem 1 (Merge Sorted Array) Just solved my first LeetCode problem. It was the classic "Merge Sorted Array" sounds simple, right? But here's what I actually learned: JavaScript's .sort() doesn't sort numbers by default, it sorts them as strings. [1, 10, 2] becomes [1, 10, 2] not [1, 2, 10]. A one-line bug that would fail silently. Reassigning an array variable (arr = []) doesn't modify the original. LeetCode wants in-place changes. That took me a moment. I was filtering out zeros thinking they were empty slots, but 0 is a perfectly valid element. Hidden test cases would've caught me. Three bugs. One "easy" problem. Tons of learning. The real lesson? Passing the visible test cases doesn't mean your code is correct. Always think about edge cases. If you've been putting off starting DSA Interview questions like I was just open problem 1 and start. The first step is the hardest. #DSA #LeetCode #JavaScript #CodingJourney #Programming

🚀 Day 10 of My LeetCode Journey — Mastering Linked Lists Today’s problems: 🔹 Middle of the Linked List (LeetCode 876) 🔹 Reverse Linked List (LeetCode 206) 💡 Problem 1: Middle of the Linked List Used the classic slow & fast pointer approach: 👉 Slow moves 1 step 👉 Fast moves 2 steps 👉 When fast reaches the end → slow is at the middle 🎯 Such a simple trick, yet super powerful! 💡 Problem 2: Reverse Linked List This one is a must-know 🔥 👉 Iteratively reverse pointers 👉 Keep track of prev, current, and next 👉 Flip links step by step Also explored how this can be done using recursion 🧠 What I Learned: Two-pointer techniques are extremely useful Pointer manipulation builds real confidence in DSA Linked Lists are all about careful handling of references 🔥 Key Takeaways: Small tricks (like slow/fast pointers) can simplify problems a lot Practicing core problems like reversing a linked list is essential for interviews Understanding the logic > memorizing code Grateful for the learning journey with Namaste DSA and Akshay Saini 🚀 🙌 Day 11 loading… 💪 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #LinkedList #ReverseLinkedList #TwoPointers #NamasteDSA

🚀 Day 11 of My LeetCode Journey — Deep Dive into Linked Lists Today was all about mastering patterns in Linked Lists: 🔹 Linked List Cycle (LeetCode 141) 🔹 Palindrome Linked List (LeetCode 234) 💡 Problem 1: Linked List Cycle Tried two approaches: ✅ Using Set Store visited nodes If node already exists → cycle detected ⏱️ Time: O(n) | 📦 Space: O(n) ✅ Fast & Slow Pointer (Floyd’s Algorithm) 🔥 Slow → 1 step Fast → 2 steps If they meet → cycle exists ⏱️ Time: O(n) | 📦 Space: O(1) 👉 This approach is elegant and optimal! 💡 Problem 2: Palindrome Linked List Again explored two approaches: ✅ Convert to Array Store values in array Compare from both ends ⏱️ Time: O(n) | 📦 Space: O(n) ✅ Optimal Approach (In-place) 🔥 Find middle node Reverse second half of linked list Compare both halves ⏱️ Time: O(n) | 📦 Space: O(1) 👉 This one really tested pointer manipulation skills! 🧠 What I Learned: One problem can have multiple valid approaches Optimal solutions often reduce space complexity Linked Lists = pointer mastery + careful thinking 🔥 Key Takeaways: Always try brute force first → then optimize Fast & slow pointer is a game-changing technique In-place solutions are highly valued in interviews Big thanks to Namaste DSA and Akshay Saini 🚀 for the guidance Day 12 loading… 💪 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #LinkedList #TwoPointers #DSA #NamasteDSA

🚀 Day 29/128 – LeetCode Challenge Today’s problem: Combination Sum (Medium) This problem was a great exercise in understanding backtracking and recursion. The goal was to find all unique combinations of numbers that add up to a target, with the twist that each number can be used multiple times. 🔍 Key Learnings: Backtracking is all about exploring possibilities and undoing choices Using a start index helps avoid duplicate combinations Recursive thinking becomes much easier with practice Important to handle base cases properly (target reached / exceeded) 💡 What clicked today: Instead of thinking “which combination is correct?”, I focused on trying every possible path and letting recursion filter valid ones. 🧠 Pattern recognized: This is a classic DFS + Backtracking problem — a pattern that shows up frequently in coding interviews. 📈 Progress update: Consistency is starting to pay off. Problems that once felt complex are becoming more intuitive. On to Day 30 🔥 #LeetCode #128DaysOfCode #DSA #CodingJourney #Backtracking #JavaScript #ProblemSolving

🚀 Day 4 of My LeetCode Journey — Building Problem-Solving Muscle Today I worked on two problems: 🔹 Max Consecutive Ones (LeetCode 485) 🔹 Missing Number (LeetCode 268) 💡 Problem 1: Max Consecutive Ones This problem is all about pattern recognition. 👉 Traverse the array 👉 Keep counting consecutive 1s 👉 Reset when you hit 0 Simple logic, but a great reminder that not every problem needs complex data structures. 💡 Problem 2: Missing Number This one was interesting — multiple ways to solve it: ✔️ Sorting ✔️ HashSet ✔️ XOR ✔️ Sum formula (most optimal) The cleanest approach: 👉 Use the formula: n * (n + 1) / 2 👉 Subtract the actual sum 👉 Boom — missing number found ⚡ 🔥 Key Takeaways from Today: Not every problem needs brute force There’s always a more optimal way — look for patterns Understanding multiple approaches = stronger fundamentals Consistency is slowly turning confusion into clarity 💪 On to Day 5 🚀 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #Consistency #CodeNewbie #DailyCoding

🚀 Day 3 of My LeetCode Journey — Consistency > Motivation Today’s problem: Merge Sorted Array (LeetCode 88) At first glance, it looks simple — just merge two arrays, right? But the real challenge is doing it in-place without extra space 🤯 💡 Key Learning: Instead of merging from the front (which causes overwriting), the optimal approach is to: 👉 Use two pointers from the end 👉 Fill the array backwards This small shift in thinking makes a huge difference: ⏱️ Time Complexity: O(m + n) 📦 Space Complexity: O(1) 🔥 What I’m realizing: It’s not about solving problems — it’s about learning how to think differently Every problem is teaching me: How to optimize How to avoid brute force How to think like an interviewer On to Day 4 💪 #LeetCode #DataStructures #Algorithms #CodingJourney #100DaysOfCode #SoftwareEngineering #Programming #InterviewPrep #JavaScript #CodingLife #TechGrowth #ProblemSolving #Developers #LearnToCode #Consistency #CodeDaily

Longer autonomous coding runs lead to longer reviews. This is how you make them fast again. Your bug count may be infinite but your threat model is finite. If you build a TypeScript and Python app you likely have SSRF (when your server makes HTTP requests on behalf of the user) and missing/incorrect authorization bugs. The road to asurance AND velocity is paved with ”define and conquer”. Define an input filter for URLs and scan for fetch and request lib calls that don't use it. This can be a lint rule. Your app roles have purposes and flows. Define these to make an allowed calls definition. Peak into the tests/ directory for playwright tests that you can use to reach all features with lower than expected roles. Clear definitions and types are what makes things verifiable at speed.

🚀 Day 28 / 128 – Coding Challenge Progress Today I worked on the classic "Square Root (x)" problem from LeetCode. 🔍 Problem Summary: Given a non-negative integer x, compute and return its square root rounded down to the nearest integer — without using built-in exponent functions. 💡 Approach I Used: I implemented a Binary Search solution to efficiently find the integer square root. Instead of checking every number, I narrowed down the answer by: Picking a middle value Comparing mid * mid with x Adjusting the search range accordingly ⚡ Why Binary Search? It reduces time complexity from O(n) to O(log n) — making the solution much faster and scalable. 🧠 Key Learning: This problem reinforced how powerful binary search is, even beyond sorted arrays — especially for mathematical computations. 📌 Progress: Day 28 complete, staying consistent and learning something new every day! #128DaysOfCode #CodingChallenge #LeetCode #JavaScript #ProblemSolving #BinarySearch #DeveloperJourney