Praneetha Imandi’s Post

Day 59: Majority Element III Mastery! 🔓 I'm thrilled to share that I've successfully solved the "Majority Element III" problem on Day 59 of my 75-day DSA challenge! 🎉 Another day, another problem conquered! I'm loving the progress I'm making and the challenges I'm overcoming. This journey is helping me grow both technically and mentally. 🚀 The "Majority Element III" problem was a great opportunity to practice my problem-solving skills and think creatively. If you're also working on this challenge, keep pushing forward! You're getting closer to your goals. 💪 Let's keep celebrating our small wins and motivating each other to reach new heights! 🤝 #DSAchallenge #codingjourney #problem-solving #learningeveryday #majorityelementIII

🚀 Day 10: Milestones Achieved! 🚀 Today's #DSAChallenge brought me face to face with two significant problems: 1️⃣ Majority Element (>n/2 times) 2️⃣ Kadane's Algorithm As I delved into these challenges, I embraced the complexities and uncovered efficient solutions. Each problem conquered is a testament to my growing expertise in DSA. Day 10 marks a milestone in my journey of learning and growth. With each problem solved, I inch closer to my goal of mastering DSA and achieving success in my career. Here's to perseverance, determination, and the relentless pursuit of excellence! 💼💡 #Progress #CareerGrowth #ProblemSolving #Day10Update #CodeLife #LearningJourney

🚀 1 Month of DSA: Key Lessons! In the past month, I’ve learned that the language you code in doesn’t matter as much as consistency and understanding the core concepts deeply. Celebrate small wins, embrace frustration as part of learning, and engage with the community for support. Onward and upward! 💪 #DSAJourney #KeepLearning #GrowthMindset

Greetings, LinkedIn community! 👋Excited to mark the completion of 100+ DSA problems . Started solving problems on DSA by Strivers-a2z-dsa-sheet , and mastered all the basic concepts including array and linkedlist. In just a few days, I've found myself deeply immersed in solving DSA questions, and I must say, it's been quite an interesting journey! 🧠💡 I'm eagerly looking forward to completing the entire curriculum and becoming the best version of myself in the field of problem-solving. 💪💻 A huge thanks to Raj Vikramaditya bhaiya😊. "Learning and growing every day!" #dsa #striver #striversa2zdsa #striverssdesheet #problemsolving #problemsolving

🚀 Day 10 Update: Stepping into Day 10 of DSA Practice! 🚀 Today marks the tenth day of my DSA practice journey, and I'm thrilled to share my progress: 🔍 Explored a variety of problems: Engaged in solving diverse DSA problems to reinforce my understanding of different concepts and algorithms. 💡 Delved deeper into algorithmic thinking: Challenged myself with complex problems to sharpen my problem-solving skills and enhance my ability to devise efficient solutions. 🌟 Reflecting on growth and learning: With each passing day, I'm gaining valuable insights and becoming more confident in tackling challenging problems in the realm of DSA. Excited to continue this journey of exploration and discovery! 💪💻 #DSAChallenge #Day10 #ProblemSolving #LearningJourney

**Day 7: Hello everyone! 👋** Today was one of those days where life threw a lot of curveballs. From running urgent errands, the day felt packed, leaving me with little time to dive deep into problem-solving. 🌪️ But even in a busy schedule, I made sure to polish my knowledge of DSA fundamentals, which is just as important for growth. Tomorrow, despite another packed schedule, I’m determined to get back on track and solve more problems. 💪 Let’s keep moving forward, one step at a time! 🚀 #DSA #GrowthMindset #Consistency #CodingJourney #ProblemSolving ---

Resilience is not just about moving forward—it's also about taking a step back to strengthen what you've already learned. 📚 After following the 90-day DSA challenge, I took one week break to revisit and reinforce everything I learned in the previous days, while also working on some other projects and skills. Now, I'm back on track, stronger and more determined than ever to complete this journey. 💪 #DSAChallenge #BackToLearning #ProgressNotPerfection #KeepGrowing #CodeJourney

🚀 𝐂𝐨𝐧𝐭𝐢𝐧𝐮𝐢𝐧𝐠 𝐭𝐡𝐞 𝐣𝐨𝐮𝐫𝐧𝐞𝐲... 🚀 After covering the basics, it's time to take pattern questions to the next level! 🔺🔻 These simple problems help build the logical thinking needed for more advanced DSA challenges. 👇 𝗛𝗲𝗿𝗲'𝘀 𝘁𝗵𝗲 𝘀𝗲𝗰𝗼𝗻𝗱 𝘀𝗲𝘁 𝗼𝗳 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀. Let's keep learning, and if you're on this journey with me, follow for more updates! 🌟 #BackToBasics #PatternQuestions #DSAFundamentals

🌟 Day 3 of 75: Hard DSA Challenge 🌟 Today, I completed a lecture on practicing intermediate problems on loops and tackled a few medium-rated problems under the expert guidance of Fraz Sir. It was a mix of breakthroughs and some sticking points, especially with the basics. 🧠🔄 Getting stuck in the process is absolutely okay! It's all part of the learning journey. 📚✨ We can move slowly at times, but what truly matters is consistency and persistence. Steady progress is the key. 🚀💪 I also focused on writing some good notes for better understanding and future revision. 📝🗂️ Let's keep pushing forward, one step at a time! 💡📈 #75DaysOfCode #DSAChallenge #ConsistencyIsKey #KeepLearning #LinkedInLearning #CodingJourney #NoteTaking

🚀 DSA Mastery Day 23: Minimum Moves to Equal Array Elements On the twenty-third day of the DSA Mastery Challenge, we address the Minimum Moves to Equal Array Elements problem. Given an array of numbers, we aim to make all elements equal by adding 1 to all elements except one in each move. 🌟 Today's Challenge: Minimum Moves to Equal Array Elements Check it out ➡️https://lnkd.in/gE6J9-PW The Challenge: The brute force approach involves trying every possible way to make all elements equal, resulting in high complexity. The challenge lies in devising a simpler approach with lower time complexity. Intuition: To minimize moves, we either increment n-1 smaller elements or decrement the maximum element. The goal is to make all elements equal. By reducing the maximum elements iteratively until all the elements are equal, we determine the minimum moves required. Approach: 1. Initialize the 'ans' variable to 0. 2. Sort the array. 3. Iterate from the last element to the second element. 4. Add the difference between the current element and the first element to 'ans'. 5. Return 'ans'. This approach offers a straightforward solution to the problem. Share your thoughts and insights in the comments below! #DSAMastery #DSAChallenge #DailyCoding #MinimumMoves #DSAMath #ProgrammingCommunity