LeetCode 153: Binary Search for Minimum in Rotated Sorted Array

📅 Day 96 of #100DaysOfCode Problem: Rotate List (LeetCode 61) Approach (Linked List Manipulation): 1️⃣ Calculated the length of the linked list. 2️⃣ Connected the tail to the head to form a circular list. 3️⃣ Reduced rotations using k % length. 4️⃣ Found the new tail at position length - k. 5️⃣ Broke the circular link to get the new rotated list. #100DaysOfCode #LeetCode #DSA #LinkedList #Pointers #ProblemSolving #Cplusplus #CodingChallenge #Programming #DeveloperLife #DailyDSA #KeepLearning #TechCommunity #GrowthMindset #Motivation

🔥 Selection Sort – Code Implementation 🔥 Today I implemented Selection Sort 🧠💻 ✔️ Simple comparison-based sorting algorithm ✔️ Repeatedly selects the minimum element ✔️ Swaps it with the current index ✔️ Time Complexity: O(n²) Clean logic. Easy to understand. Great for learning sorting fundamentals. 🚀 #SelectionSort #DSA #CodingJourney #Programming #LearnToCode

📅 Day 93 of #100DaysOfCode Problem: Palindrome Partitioning (LeetCode 131) Approach (Backtracking + Recursion): 1️⃣ Used backtracking to explore all possible substring partitions. 2️⃣ At each step, checked if the current substring is a palindrome. 3️⃣ If it is a palindrome → added it to the current path. 4️⃣ Recursively continued for the remaining substring. 5️⃣ Once we reached the end of the string → stored the valid partition. 6️⃣ Backtracked to explore other possible partitions. #100DaysOfCode #LeetCode #DSA #Backtracking #Recursion #Strings #ProblemSolving #Cplusplus #CodingChallenge #Programming #DeveloperLife #DailyDSA #KeepLearning #TechCommunity #GrowthMindset #Motivation

🚀 100 Days of LeetCode — Day 59 🧩 Problem Integer to Roman 💡 Core Idea To convert an integer into a Roman numeral, I used a place value mapping approach. The number is divided into four parts: Thousands Hundreds Tens Ones For each place value, I stored precomputed Roman numeral representations in arrays. Then I used direct indexing to select the correct Roman numeral and concatenate them. This approach avoids loops and complex conditions, making the solution simple and efficient. 📚 Key Learnings 1. Mapping values using arrays 2. Direct index lookup optimization 3. Breaking numbers using place value decomposition ⏱ Complexity Time Complexity: O(1) Space Complexity: O(1) #100DaysOfLeetCode #LeetCode #DSA #Programming #Cplusplus #CodingChallenge #ProblemSolving #TechJourney

📅 Day 98 of #100DaysOfCode Problem: Delete and Earn (LeetCode 740) Approach (Dynamic Programming — House Robber Pattern): 1️⃣ Converted the array into a points array where each index stores total value earned from that number. 2️⃣ Choosing a number deletes its adjacent values (num - 1 and num + 1). 3️⃣ Recognized the pattern similar to the House Robber problem. 4️⃣ At each step, decided whether to take or skip the current value. 5️⃣ Used dynamic programming to maximize total earned points. Many DP problems become easier once you recognize familiar patterns 🧠 #100DaysOfCode #LeetCode #DSA #DynamicProgramming #DP #Arrays #ProblemSolving #Cplusplus #CodingChallenge #Programming #DeveloperLife #DailyDSA #KeepLearning #TechCommunity #GrowthMindset #Motivation

Day 1 of rust learning series Today, i learned - what is Rust - Where it is used - Problem that rust solve key point - used and acquire the required memory Rust most loved language: - https://lnkd.in/g-QNUsHe #learninginpublic #rust #programming

Day 67/100 – DSA Challenge 🚀 Topic: collision handling Key Learning: A collision occurs when two or more keys produce the same index using the hash function. Example (hash function: key % 10) GitHub: <https://lnkd.in/dtek96E3> #100DaysOfDSA #ProblemSolving #LinkedInLearning #clanguage #coding #programming #developer #softwareengnieer #datastructure

Continuing my C++ learning journey, I recently explored the concept of Diamond Inheritance, an important scenario in multiple inheritance. In this concept, a class inherits from two classes that both inherit from the same base class, forming a diamond-shaped inheritance structure. I also learned how virtual base classes are used to resolve the ambiguity that arises when the base class is inherited multiple times. This helped me understand how C++ handles complex inheritance structures and how ambiguity problems are resolved in object-oriented design. Step by step, continuing to strengthen my understanding of advanced C++ concepts. #CPP #ObjectOrientedProgramming #Programming #SoftwareDevelopment #LearningJourney

Mastering Rust's collection types is crucial for writing efficient, memory-safe code. Our latest article breaks down when to use Vec, HashMap, HashSet, and other core collections, helping you make informed decisions based on performance and use case requirements. 📚 Learn the practical differences and optimize your Rust applications: https://lnkd.in/ew9F9uXJ #RustLang #Programming #SoftwareEngineering

Excited to share a short video where I break down the fundamentals of operators in C++ from arithmetic and relational to logical and bitwise. Understanding these is key for efficient coding and problem-solving!This was part of my ongoing journey in programming, guided by the excellent Punny mam .Check it out and let me know your thoughts or tips in the comments! #CPPlus #Programming #Coding #LearnInPublic #DataAnalytics