Riya Lodha’s Post

🎉 𝐀𝐜𝐡𝐢𝐞𝐯𝐞𝐦𝐞𝐧𝐭 𝐔𝐧𝐥𝐨𝐜𝐤𝐞𝐝: 50 𝐃𝐚𝐲𝐬 𝐁𝐚𝐝𝐠𝐞! 🎉 Super thrilled to share that I’ve hit a major milestone on my learning journey with LeetCode — earning the 50 Days Badge! 🚀📚 These past 50 days have been packed with learning, problem-solving, and a ton of growth. I've challenged myself with a wide range of coding problems, from data structures and algorithms to advanced concepts. Here's a quick recap of some key concepts I've dived into: ✨ 𝐃𝐲𝐧𝐚𝐦𝐢𝐜 𝐏𝐫𝐨𝐠𝐫𝐚𝐦𝐦𝐢𝐧𝐠: Tackling problems with optimal substructure and overlapping subproblems. It was tough at first, but breaking down problems step by step made all the difference! ✨ 𝐆𝐫𝐚𝐩𝐡 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦𝐬: From DFS and BFS to Dijkstra's and Floyd-Warshall, understanding how to navigate nodes and edges has expanded my problem-solving toolkit. ✨ 𝐁𝐚𝐜𝐤𝐭𝐫𝐚𝐜𝐤𝐢𝐧𝐠: Perfecting the art of exploring all possible solutions by making choices, backtracking, and optimizing along the way. ✨ 𝐁𝐢𝐧𝐚𝐫𝐲 𝐒𝐞𝐚𝐫𝐜𝐡: Getting faster solutions with O(log n) complexity has been super rewarding — efficiency is everything! ✨ 𝐆𝐫𝐞𝐞𝐝𝐲 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦𝐬: Learning how to make the best local choice at each step to solve problems globally. ✨ 𝐁𝐢𝐭 𝐌𝐚𝐧𝐢𝐩𝐮𝐥𝐚𝐭𝐢𝐨𝐧: Diving into the power of bits and how they can solve problems efficiently! These days have not only helped me grow technically but have also strengthened my resilience and perseverance when facing challenges. Every setback is an opportunity to learn and come back stronger! 💪 This milestone is just the beginning! Looking forward to continuing this journey and tackling even more complex problems ahead! 🌟 #LeetCode #50DaysChallenge #AchievementUnlocked #CodingJourney #Algorithms #DataStructures #ProblemSolving #DynamicProgramming #GraphAlgorithms #Backtracking #BinarySearch #TechGrowth #SoftwareDevelopment #NeverStopLearning #KeepCoding #LinkedInLearning

🌟 Day 100 of the #100DaysOfCodingChallenge is here, and the adventure continues! 💻 Here's a sneak peek into today's exciting task: Minimum Number of Moves to Seat Everyone. Today, I’ll be tackling the intriguing challenge of determining the minimum number of moves required to seat everyone in the correct position. This problem is an excellent exercise for enhancing my understanding of sorting algorithms and array manipulation. By developing an efficient algorithm to solve this problem, I'll strengthen my grasp of basic data structures and algorithm design. This challenge not only sharpens my programming skills but also fortifies my foundation in sorting and movement optimization, which are crucial in many real-world applications. As today marks the 100th and final day of this exhilarating coding journey, I reflect on the immense growth, countless lessons, and the unwavering determination that has brought me here. From conquering beginner-level challenges to tackling complex algorithmic problems, each day has ignited my passion and propelled me towards greater expertise and creativity. This journey has not only sharpened my programming skills but also fortified my problem-solving abilities and resilience. With the #100DaysOfCodingChallenge coming to a close, I am filled with gratitude for the support and encouragement from my peers, mentors, and the coding community. This milestone is not the end but a new beginning towards continuous learning and innovation. 💡 With unwavering determination and an unquenchable thirst for knowledge, I am ready to conquer the challenges that lie ahead in my coding journey! #CodeToConquer #CodingJourney #Day100 #100DaysOfCode #CodeTriumph #InnovationDriven 🚀🌟💻 Parul University Santosh Nair byteXL

🌟 Exciting Milestone Alert! 🌟 Today marks Day 31 of my #100DaysChallenge and #100DaysOfCode journey! I'm thrilled to share that it’s also Day 16 of my #100DaysOfDSA commitment. Over the past month, I've immersed myself in coding and problem-solving, and today I focused on Data Structures and Algorithms (DSA). Specifically, I implemented a linked list in C, which has not only enhanced my technical skills but also deepened my understanding of how data structures work under the hood. Taking on this challenge has been a transformative experience—pushing me to learn daily, tackle complex problems, and continuously grow as a developer. I’m excited to keep the momentum going and see where this journey takes me! Here’s to embracing challenges and celebrating progress! 🚀💻 #LearningJourney #Coding #SoftwareDevelopment #GrowthMindset #TechCommunity

🌟 Day 8/100: Modulo and Subsequence Challenges 🌟 Hello, everyone! Day 8 of my #100DaysChallenge and #SkillUpChallenge was a great learning experience. Here’s a quick update on the problems I worked on: 🔍 Make Sum Divisible by P This problem was all about modular arithmetic and figuring out how to make the sum of an array divisible by a given number, P. It was quite the puzzle to solve, and understanding the concept of prefix sums and modulo operations was key to tackling it efficiently. Definitely a brain teaser! 🔍 Is Subsequence On the surface, this seemed like a simpler problem, but it really tested my string manipulation and greedy algorithm skills. The goal was to check if one string is a subsequence of another, and optimizing the search process was important to keep the solution efficient. On to the next problem, and as always, excited to continue the journey! 🚀 #LeetCode #100DaysOfCode #WomenWhoCode #SkillUpChallenge #DrGViswanathan Challenge

🌟 𝐇𝐚𝐥𝐟𝐰𝐚𝐲 𝐓𝐡𝐫𝐨𝐮𝐠𝐡 𝐌𝐲 𝐂𝐨𝐝𝐢𝐧𝐠 𝐉𝐨𝐮𝐫𝐧𝐞𝐲! 🌟 Today marks the midway point of my #100DaysOfCode challenge, and I’m proud to share how much I’ve grown over the last 50 days! 🚀 I’ve spent this time diving deep into Data Structures and Algorithms (DSA), solving increasingly challenging problems, and honing my skills. Now, as I move forward, I’m focusing more on medium-level questions to push myself even further and continue growing. The journey so far has been rewarding, and I can’t wait to see how much progress I’ll make by Day 100. Let’s continue to inspire, motivate, and challenge each other as we work through this journey together! #LeetCode #CodingChallenge #Day50 #LearningDSA #100DaysOfCode #Improvement #TechGrowth #NextLevel #MediumLevel #AyushDwivedi

🚀 Day 26 of #30DaysCodeChallenge 🚀 Today’s challenge was all about finding the Kth Smallest Element in an array 🎯. Sounds easy, right? But the twist was that I couldn’t use the inbuilt sort function, so I had to get creative with my approach! 🔍 Here’s How I Tackled It: 1️⃣ Min-Heap Magic: Step 1: Since I needed the Kth smallest element, my first thought was to use a min-heap 🛠️. By building a min-heap from the array, I could pull out the smallest elements one by one. Step 2: After creating the min-heap, I extracted the minimum element K times. The Kth extraction gave me the Kth smallest element 🎉. This approach kept the time complexity around O(n + k log n), making it pretty efficient. 2️⃣ Quickselect for the Win: Step 1: I also explored the Quickselect algorithm 🔄, which is like a more targeted version of QuickSort. It’s a bit trickier but can find the Kth smallest element in average O(n) time. Step 2: Quickselect works by picking a pivot and partitioning the array around it. Depending on where the pivot lands, I could decide whether to recurse on the left or right half, or stop if the pivot was the Kth element. Step 3: This method doesn’t need extra space, making it super space-efficient—O(1) auxiliary space 💡, which is perfect for handling large arrays. 💡 Why This Problem Was Fun: This problem was a great way to dive into efficient algorithms. It made me think beyond just sorting and focus on finding specific elements quickly. Plus, I got to weigh the pros and cons of different methods, which was a cool learning experience! 🔗 #CodeChallenge | #ProblemSolving | #DailyCoding | #geekstreak2024 @GeeksforGeeks

🚀 𝐃𝐚𝐲 𝟕𝟐/𝟗𝟎: 𝐌𝐲 𝐃𝐒𝐀 𝐉𝐨𝐮𝐫𝐧𝐞𝐲 𝐰𝐢𝐭𝐡 𝐂++ 🚀 ✨𝐃𝐨 𝐲𝐨𝐮 𝐤𝐧𝐨𝐰 𝐡𝐨𝐰 𝐭𝐨 𝐂𝐨𝐮𝐧𝐭 𝐑𝐞𝐯𝐞𝐫𝐬𝐞 𝐏𝐚𝐢𝐫𝐬 🤔 A reverse pair in an array is defined as a pair of indices (i,j)(i, j)(i,j) such that: i<ji < ji<j (i.e., the first index is smaller than the second index). The goal is to count all such reverse pairs in the array. To efficiently count reverse pairs, we use merge sort as the base algorithm. Merge sort is chosen because it inherently divides the array into smaller halves and then merges them while maintaining sorted order. During the merge step, we can count the reverse pairs. 𝐒𝐭𝐞𝐩𝐬 𝐭𝐨 𝐒𝐨𝐥𝐯𝐞 𝐔𝐬𝐢𝐧𝐠 𝐌𝐞𝐫𝐠𝐞 𝐒𝐨𝐫𝐭 𝟏. 𝐃𝐢𝐯𝐢𝐝𝐞 𝐭𝐡𝐞 𝐀𝐫𝐫𝐚𝐲: Recursively split the array into two halves until each half contains a single element. 𝟐. 𝐂𝐨𝐮𝐧𝐭 𝐑𝐞𝐯𝐞𝐫𝐬𝐞 𝐏𝐚𝐢𝐫𝐬 𝐀𝐜𝐫𝐨𝐬𝐬 𝐇𝐚𝐥𝐯𝐞𝐬 While merging two sorted halves, count all pairs (i,j)(i, j)(i,j) such that: arr[i]>2×arr[j]\text{arr}[i] > 2 \times \text{arr}[j]arr[i]>2×arr[j] iii belongs to the left half, and jjj belongs to the right half. 𝟑. 𝐌𝐞𝐫𝐠𝐞 𝐭𝐡𝐞 𝐓𝐰𝐨 𝐇𝐚𝐥𝐯𝐞𝐬: After counting the pairs, merge the two sorted halves back into one sorted array. 𝟒. 𝐂𝐨𝐦𝐛𝐢𝐧𝐞 𝐑𝐞𝐬𝐮𝐥𝐭𝐬: Combine the reverse pair counts from the left half, right half, and across the halves. Thank you so much takeUforward for teaching me Your guidance made it clear and straightforward to understand the logic efficiently. 😊 #arrayleaders #dataStructureandAlgorithms #preparation #linkdInlearning #DSA #C++ #90daysChallenge #techJourney #AIML #collegelife #programming #coding #growth #future #codeNewbie #techskills #software #womenInTech #codingChallenge #problemSolving #algorithms #upskilling #journey #DSAlearner #newlifebegins

🎉 Milestone Achieved: Celebrating Day 50 of my 90-Day LeetCode Challenge with the 50 Days Badge! 🏅 Excited to share this significant milestone in my coding journey, having solved 138 problems so far. 🌟 Highlights of My 50-Day Journey: - 50 Days of Continuous Learning: A journey filled with growth and dedication. - 138 Problems Solved: Covering data structures, algorithms, SQL, and more, enhancing coding skills. 📈 Reflections: Hitting the 50-day mark showcases the power of consistency and perseverance. A challenging yet rewarding experience, boosting analytical thinking and problem-solving confidence. 🚀 What's Next? Halfway through, I'm driven to push boundaries further. Exploring advanced topics, aiming for continuous growth in the remaining challenge days. 🌐 Join Me: Connect if you share a passion for coding or a similar journey. Let's conquer challenges, exchange knowledge, and strive for tech excellence together. #LeetCode #CodingChallenge #50DaysBadge #ContinuousLearning #TechSkills #ProblemSolving #DataStructures #Algorithms #CareerDevelopment #GrowthMindset #MilestoneAchievement

🚀 Day 20/75 of the Coding Challenge! 🚀 Today, I learned more about linked lists! First, I figured out how to add and remove elements from specific spots in a list. Then, I learned how to delete items from the beginning, end, or any spot in the list. These are important tricks for managing data in linked lists. After that, I explored doubly linked lists. They're like regular linked lists, but each element points to both the one before and after it. This makes moving around and deleting items even easier! Understanding these ideas helps a lot with organizing data. I'm excited to keep learning more! 💪✨ #CodingChallenge #Day20 #LinkedList #Insertion #Deletion #DoublyLinkedList #LearningAndGrowing

🎉 Milestone Achieved: Celebrating Day 50 of my 90-Day LeetCode Challenge with the 50 Days Badge! 🏅 Excited to share this significant milestone in my coding journey, having solved 138 problems so far. 🌟 Highlights of My 50-Day Journey: - 50 Days of Continuous Learning: A journey filled with growth and dedication. - 138 Problems Solved: Covering data structures, algorithms, SQL, and more, enhancing coding skills. 📈 Reflections: Hitting the 50-day mark showcases the power of consistency and perseverance. A challenging yet rewarding experience, boosting analytical thinking and problem-solving confidence. 🚀 What's Next? Halfway through, I'm driven to push boundaries further. Exploring advanced topics, aiming for continuous growth in the remaining challenge days. 🌐 Join Me: Connect if you share a passion for coding or a similar journey. Let's conquer challenges, exchange knowledge, and strive for tech excellence together. #LeetCode #CodingChallenge #50DaysBadge #ContinuousLearning #TechSkills #ProblemSolving #DataStructures #Algorithms #CareerDevelopment #GrowthMindset #MilestoneAchievement