Devanand Rana’s Post

🚀 Day 33/100 of #100DaysOfCode Solved the Happy Number problem today! 🧮✨ Learned how to detect cycles and optimize algorithms while having fun with number theory. Small wins, big progress! 💻🔥 #CodingChallenge #KeepCoding

Day 185 of #200DaysOfCoding Solved the "Rotate Image" problem today! Approached it by transposing the matrix first and then reversing each row. Optimized and clean solution in O(n²) time complexity. 🚀 #CodingChallenge #ProblemSolving #LeetCode #200daysofcoding

Day 22 of #100DaysofCodingChallenge Turning logic into magic, one line at a time. ✨📜 Today I tackled the problem of "Max Circular Subarray Sum"!!! #CodingChallenge #KeepPushing #StayInspired #DreamBigCodeBigger #CodeEveryday #CodeJourney #Day22 #ContinueToLearn #ProgrammingChallenge #ContiniousLearning #DeveloperGrowth #GeeksforGeeks

🚀 Day 32/100: #DSAwithedSlash 🌟 Today's challenge focused on the Largest Number problem, a fascinating array manipulation question where the goal is to arrange numbers to form the largest possible number. Here's how I approached it: 1️⃣ Custom Sorting – The key idea was to compare the concatenation of numbers (e.g., a + b vs. b + a) and sort them in a way that maximizes the result. This involved writing a custom comparator for sorting. 2️⃣ Edge Cases – Addressed special scenarios like arrays with multiple zeros, ensuring the output is a single "0" instead of something like "000". Key Takeaways: Learned how to implement a custom sorting comparator and its role in solving real-world problems. Reinforced the importance of handling edge cases to ensure robust solutions. Improved understanding of greedy algorithms and their applications in optimizing solutions. ✨ Mantra: "Think beyond numbers; let logic define their order!" 💡 ✅ Day 32 = Complete! 🚀 #100DaysOfCode #CodingJourney #CodeToGreatness

🔥 Day 8/100: #100DaysOfCode Challenge - LeetCode 🔥 Problem 1464: Maximum Product of Two Elements in an Array Problem Statement: Given an integer array nums, find the maximum product of two distinct elements, calculated as (max-1)*(smax-1), where max and smax are the two largest numbers in the array. (Difficulty: Easy) Solution Overview: To solve this, I iterated through nums to find the largest (max) and second-largest (smax) numbers, updating them as needed. Then, I calculated (max-1)*(smax-1) for the answer. Key Learnings: 🌟 Improved understanding of single-pass array scanning for max values. 📈 Reinforced logic-building for finding maximum and second-maximum elements. 💪 Enhanced skills in minimizing time complexity by avoiding nested loops. Performance: ⚡ Runtime: Optimized with a single loop. 🔋 Memory: Minimal, efficient space usage. Outcome: Another problem down with @leetcode! Thanks to @edslash for the push each day—excited for the upcoming challenges! 🚀 #Day8 #100DaysOfCode #DSAwithedSlash #LeetCode #CodingChallenge #LearningJourney

🔥 Day 8/100: #100DaysOfCode Challenge - LeetCode 🔥 Problem 1464: Maximum Product of Two Elements in an Array Problem Statement: Given an integer array nums, find the maximum product of two distinct elements, calculated as (max-1)*(smax-1), where max and smax are the two largest numbers in the array. (Difficulty: Easy) Solution Overview: To solve this, I iterated through nums to find the largest (max) and second-largest (smax) numbers, updating them as needed. Then, I calculated (max-1)*(smax-1) for the answer. Key Learnings: 🌟 Improved understanding of single-pass array scanning for max values. 📈 Reinforced logic-building for finding maximum and second-maximum elements. 💪 Enhanced skills in minimizing time complexity by avoiding nested loops. Performance: ⚡ Runtime: Optimized with a single loop. 🔋 Memory: Minimal, efficient space usage. Outcome: Another problem down with @leetcode! Thanks to @edslash for the push each day—excited for the upcoming challenges! 🚀 #Day8 #100DaysOfCode #DSAwithedSlash #LeetCode #CodingChallenge #LearningJourney

🚀 Day 17/100 of the #100DaysOfCode challenge! 💻 Today's puzzle: Finding the final remaining element in a step-wise reduction array. 🔄 Key learnings: 1️⃣ Mastering sorting algorithms to efficiently identify maximum and minimum elements. 2️⃣ Implementing step-wise reduction logic to dynamically update the array. 3️⃣ Understanding array manipulation techniques to track the final element through successive removals. Let's unravel the mystery of the last standing element! 💡 #CodingChallenge #ArrayReduction #ProblemSolving #drgvishwanathanchallenge #shriramsr #vitbhopal #vitbhopallions #100daysofcodechallenge

✅ Day 68 of #100DaysOfCode and #DrGViswanathanChallenge Today, I worked on a problem where I had to determine if a subarray has alternating parity between adjacent elements. Problem: Check if every adjacent pair of elements in a given subarray has a different parity. #DailyCoding #AlgorithmDesign #Optimization #ProgrammingJourney

✅ Day 69 of #100DaysOfCode and #DrGViswanathanChallenge Today, I worked on a problem where I had to determine if a subarray has alternating parity between adjacent elements. Problem: Check if every adjacent pair of elements in a given subarray has different parity. #DailyCoding #AlgorithmDesign #Optimization #ProgrammingJourney