peddinti Koteswari’s Post

🚀 #15DaysCodeAtTAPAcademy Challenge - Day 08 🚀 Excited to share that I’ve completed Day 8 of the #15DaysCodeAtTAPAcademy Challenge! Today's task was to develop a program that prints the Least Common Multiple (LCM) of two given integer values. **Question:** Write a program that prints the Least Common Multiple (LCM) of two given integer values. **Example:** Input: 12 18 Output: 36 Feeling accomplished and ready for the next challenge! 🚀💻 TAP Academy #CodingChallenge #Day8 #KeepCoding #LearningEveryday

🎯 ✅hashtag #Day3 of Ninja Slayground 2.0: 🌟 The coding battlefield is live, and I’ve officially started my 21-day streak with Ninja Slayground 2.0 by Coding Ninjas! 🚀 💻 Today's Problem: count digit . 👉 Start solving and share your journey with hashtag #NinjaSlayground hashtag #CodingNinjas. 🔥 Let the streak begin! Together, we can Slay, Rise & Conquer! 💪 hashtag #CodingJourney #ProblemSolving #Day3 #ConsistencyIsKey

Get Instant Results! Our lessons give you feedback every step of the way. You'll know right away what you've done right and where you can improve, making learning faster and more fun! #InstantFeedback #CodingSuccess #Neurodiversity #DiversityInTech #CodingForAll #LearnToCode #HashHackCode

🚀 Day 5 of Ninja Slayground 2.0 - Solved! 🚀 🚨 It’s not too late to join the challenge! The Ninja Slayground 2.0 coding challenge is open till 1st December. Don’t miss this chance to learn, grow, and compete! 🔗 Register here: https://bit.ly/3AMUdsY Today's challenge: Check if a given array is sorted in non-decreasing order. At first glance, it looked simple, but ensuring all test cases passed required careful logic and edge case handling! ✨ Approach: I iterated through the array to check if any element is greater than the next one. If such a condition is found, the array isn’t sorted, and we return 0. Otherwise, the array is sorted, and we return 1. Why This Works: Instead of sorting or using complex logic, directly comparing adjacent elements ensures a quick and efficient solution. The time complexity is O(n), making it scalable for larger inputs. Key Takeaway: Sometimes, the simplest approach is the most efficient! This challenge reinforced the importance of thinking clearly and optimizing the basics. 🔥 Excited to take on the next challenge! Let’s keep learning and growing! #NinjaSlayground #CodingJourney #ProblemSolving #CompetitiveProgramming #KeepLearning

Weekly Contest 415: A Journey of Growth 🚀 Today, I participated in Weekly Contest 415 and managed to solve 2 questions despite facing challenges like Time Limit Exceeded (TLE) and Runtime Errors. Each contest is a learning opportunity, and overcoming these hurdles has sharpened my problem-solving skills. Grateful for the continuous growth, and I’m motivated to tackle even tougher problems in the future. #LeetCode #CodingChallenges #ProblemSolving #GrowthMindset #KeepLearning

🔥 The Slayground 2.0 journey begins! 🔥 Day 1 ✅ Today, I tackled my first challenge—a problem on arrays—and guess what? I discovered the magic of the two-pointer approach! 🧑💻✨ Learning this technique was such a game-changer. It's sleek and efficient. Loving the vibe of this 21-day journey already. Here’s to growing, grinding, and climbing that leaderboard 🚀💪 Big shoutout to Coding Ninjas for creating such a cool space to level up our skills. 🖤 Let’s keep slaying! 💥 #NinjaSlayground #Codingninjas

🌟 🎯 #Day1 of Ninja Slayground 2.0: The Journey Begins! 🌟 The coding battlefield is live, and I’ve officially started my 21-day streak with Ninja Slayground 2.0 by Coding Ninjas! 🚀 💻 Today's Problem: Switch Case Statement Every great journey starts with a single step, and today marks my first move toward slaying challenges, rising through obstacles, and conquering this 21-day coding marathon. 🏆 🌐 Learning, consistency, and growth are my focus as I aim to climb the leaderboard, one problem at a time. 📢 To all my amazing connections: If you’re passionate about coding and love a challenge, this is your chance to shine! Join the Ninja Slayground 2.0, solve one problem daily, and unlock your potential. Let’s grow together. 👉 Start solving and share your journey with hashtag #NinjaSlayground #CodingNinjas. 🔥 Let the streak begin! Together, we can Slay, Rise & Conquer! 💪 #CodingJourney #ProblemSolving #Day1 #SwitchCase #ConsistencyIsKey

🚀 Day 4 of Ninja Slayground 2.0 - Solved! 🚀 🚨 It’s not too late to join the challenge! You can still take part in the Ninja Slayground 2.0 coding challenge till 1st December. Don't miss out on the opportunity to learn, grow, and compete! Excited to take on the next one! 🔥 Register here:https://bit.ly/3AMUdsY Today's challenge was to determine if a given number 'n' is prime or not. At first glance, it seemed simple, but the real challenge was optimizing the solution. ✨ Approach: I used an efficient method to check if a number is divisible by any number up to its square root. This reduces unnecessary checks and ensures the solution is fast enough even for large values of 'n'. Why This Works: By iterating only up to the square root of the number, we minimize the number of checks needed. If a number is divisible by any number up to its square root, it’s not prime. This approach optimizes the time complexity to O(√n). Key Takeaway: Efficient solutions are all about reducing unnecessary steps. This challenge reminded me of the power of optimization in coding! #NinjaSlayground #CodingJourney #ProblemSolving #CompetitiveProgramming #KeepLearning

✅ 🎯 hashtag #Day4 of Ninja Slayground 2.0 🌟 The coding battlefield is live, and I’ve officially started my 21-day streak with Ninja Slayground 2.0 by Coding Ninjas! 🚀 💻 Today's Problem: prime number 👉 Start solving and share your journey with #NinjaSlayground #CodingNinjas. 🔥 Let the streak begin! Together, we can Slay, Rise & Conquer! 💪 hashtag #CodingJourney #ProblemSolving #Day4 #ConsistencyIsKey