Technorizen Software Solutions ’s Post

Day 45 of my #100DaysOfCodingChallenge: Today, I tackled problem 200. Number of Islands on LeetCode! The task was to find the number of islands in a 2D binary grid, where '1's represent land and '0's represent water. Islands are formed by connecting adjacent lands horizontally or vertically, and they are surrounded by water on all four sides. Excited to solve this problem and keep the coding journey going strong! #LeetCode #ProblemSolving #CodeNewbie #DailyCoding #100dayofcoding #100daysofcodingchallenge #newchallenge byteXL Parul University

DAY 5 of the #100DaysOfCode Challenge on LeetCode! I successfully solved the "Merge Two Sorted Lists" problem on LeetCode! This challenge helped me deepen my understanding of linked lists and improve my algorithmic skills. Easwari Engineering College(SRM Group) Deiva Sundari Muthukumar Dr. Balaji Vaithilingam Manimaran M Pushpa P sandra karunya #LeetCode #100DaysOfCode #Dailychallenge #ProblemSolving

Day 20 of my #100DaysOfLeetCode Challenge! 🚀 With the invaluable mentor Saurabh Bansal Sir! 💡🚀 Problem: Leetcode (1394) Find lucky Integer in an array. 1.Initialization: A HashMap called hm is initialized to store the frequency of each element in the array. 2.Populating the HashMap: A for loop iterates over each element in the array. For each element ele in the array: If ele is already present in the HashMap (hm), increment its count by 1. If ele is not present, add it to the HashMap with a count of 1. 3.Finding the Largest Lucky Integer: Initialize a variable ans to -1, which will store the largest lucky integer found. Iterate over each key in the HashMap: If the frequency of the key (i.e., hm.get(key)) is equal to the key itself, update ans to be the maximum of ans and the key. 4.Return the Result: Return the value of ans. If no lucky integer is found, ans will remain -1. Completing 20 days of #100DaysOfLeetCode challenge is a significant milestone. Consistent practice is key to mastering coding skills and algorithms. Keep up the great work and dedication. edSlash Coding Hub Leetcode Challenge #DSAwithedSlash #problemSolving

Overcoming Challenges: Day 24 of the #100DaysOfCode #DrGVishwanathan Challenge! 💪 Today’s task was tackling Problem 1405: Longest Happy String on #LeetCode, and it truly tested my problem-solving skills. 🔑 Key Insights: The problem required a shift in approach—after diving into the hints, I identified that a greedy algorithm was the most efficient solution. I set a maximum limit (ml) for the string, incremented i in each loop iteration, and used conditional logic to determine when to add characters ('a', 'b', 'c') while avoiding consecutive duplicates. It was a complex challenge, but it reinforced the importance of strategic thinking in coding. 💡 Takeaway: The key to growth isn’t just solving problems, but finding optimized, efficient solutions. Each challenge presents a new learning opportunity! I’d love to hear how you approached this problem! Let’s share strategies and grow together! 👇 Onward and upward! 💥 #DrGViswanathan #VITBhopal #VITBhopalLion #Lions_Den #LeetCode #100DaysOfCode #CodingJourney #ProblemSolving #DSA #GreedyAlgorithm #CodeOptimization #LearningEveryDay #dailychallenge #KeepPushing #GrowthMindset

Library: You can use me as you wish Framework: I'll be used by you but first you've to follow my rules #AngelaYu #100DaysOfCode #pytohn

Day 2 of Day 50 Committing to Code, Crafting Consistency! 💻 Kadane's Algorithm Conquered!💪 Leetcode problem-solving is not just about finding solutions; it's about mastering techniques that optimize performance. I apply below method to solve question - 1. Understanding the problem 🔍 2. Handling Edge Cases (Most Important) 🛑 3. Iterative Improvement 🔁 4. Celebrating the Progress 👏 If you're struggling while solving a question, try following these steps once. #consistency #challengingenvironment #dailycodingchallenge #codingninjas Parikh Jain Love Babbar Coding Ninjas

DAY 6 of the #100DaysOfCode Challenge on LeetCode! I have successfully solved the " Longest Common Prefix " problem in leetcode. Easwari Engineering College(SRM Group) Deiva Sundari Muthukumar Dr. Balaji Vaithilingam Manimaran M Pushpa P sandra karunya #LeetCode #100DaysOfCode #Dailychallenge #ProblemSolving

🪟🚀Exploring the Sliding window algorithm Is sliding window is just algorithm? How to utilize it in our Coding journey? Well it is important to know it is a problem solving technique that transforms two nested loops into one loop. It can reduce the time complexity to O(n). In our coding journey or we can say mastering Data Structure and Algorithms, we learn so many things. Most of them taking extra space and time which are very helpful, but we can also use many algorithms which are efficient in time and space both sense. When I first delved into this technique, it seemed challenging. But now, with a deeper understanding, I find it immensely valuable. Excited to share this knowledge with my #LinkedInFamily! 🌐📚 Attended a incredible workshop on an applied intro to Fixed-Sized Sliding window technique with leetcode solutions which is organized by ICodeGuru. Very thanks to our trainer @Muhmmad Ali. I am feeling grateful to be the part of this learning. We learn by solving leetcode questions. Leetcode 1876: Substrings of Size Three with Distinct Characters Leetcode 643. Maximum Average Subarray I Leetcode 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold Very grateful for our mentors sir Zafar Shahid, PhD , sir Rizwan Ghaffar for giving us this platform #IcodeGuru. I found this platform Thank you to our moderators sir Zubair Zafar , mam Hamna Dawood , Dure Amna Musaffa, for their consistent effort. #problemsolving #coding #dsajourney #codingcommunity https://lnkd.in/dfGhN3MU

🎉 Excited to Share My Progress: Solved LeetCode's Maximum Subarray Problem (Problem 53)! 🎉 I’m thrilled to have solved another Leetcode Challenge problem, Maximum Subarray, using C++! This exercise was particularly challenging but incredibly rewarding, and I was inspired to take it on after watching Shradha Khapra Ma'am’s insightful video. 🔍 Problem Overview: Given an integer array, the task is to find the subarray with the largest sum and return its value. 📊 Example Scenarios: 1️⃣ Input: [-2,1,-3,4,-1,2,1,-5,4] | Output: 6 Subarray: [4,-1,2,1] 2️⃣ Input: [1] | Output: 1 Subarray: [1] 3️⃣ Input: [5,4,-1,7,8] | Output: 23 Subarray: [5,4,-1,7,8] 💻 Tech Stack: C++ 🌟 Key Learnings: I implemented an O(n) solution using Kadane's Algorithm, which helped optimize the solution for maximum efficiency. The next challenge will be solving it using the divide-and-conquer approach, which offers a deeper exploration of algorithm design. 🔗 You can check out my solution and other challenges on my GitHub: https://lnkd.in/dZ3BYAdE A big thank you to Shradha Khapra Ma'am for the inspiration! 🙏 Looking forward to solving more complex problems and deepening my knowledge of algorithms. AMAN DHATTARWAL and Apna College #LeetCode #CPP #ProblemSolving #Algorithms #MaximumSubarray #CodingJourney #ContinuousLearning #GitHub #KadaneAlgorithm #TechCommunity #DSA #Inspiration #CodingLife

🚀 #100DaysOfCode Challenge - Day 69 Today, I delved into LeetCode problem 43, which required implementing the multiplication of two large numbers as strings. This challenge tested my ability to manage string manipulation efficiently, considering corner cases and optimizing the algorithm for performance. Tackling this problem expanded my skills in handling large numbers and reinforced the importance of optimizing algorithms for efficiency in real-world scenarios. Ready for more coding challenges ahead! 💻🌟 #100DaysOfCode #LeetCode #CodingChallenge #Algorithm #StringManipulation Parul University byteXL