Mahmoud Elashry’s Post

Day 18 of the coding expedition conquered! 💻 ✨ Mastering the hunt for the Kth largest element. From sorting algorithms to clever data structures explored various strategies to crack this nut.🗺💡 Question : https://lnkd.in/gEUAqMvi #CodingChallenge #Day18 #ProblemSolving #30daysofcodewithTCP2024 #TCPNITRR2024 #codeutsavanitrr2024

"Just earned the 'Specialist' badge in Number Theory on Coding Ninjas! 🧠💡 Number theory has always fascinated me with its beauty and depth. Excited to dive deeper into this field and solve more intriguing mathematical puzzles! #CodingNinjas #NumberTheory #SpecialistBadge"

🚀 Day 108/180 of #180DaysOfCode Challenge !! 🔢📊 Counting Subarrays by Maximum Element Frequency: A Coding Endeavor! 💻 Today's coding journey embarks on the quest to Count Subarrays Where the Maximum Element Appears at Least K Times. 🚀🔍 In this challenge, the objective is to determine the number of subarrays where the maximum element appears at least K times. As I delve into the problem, I explore diverse algorithms and strategies, aiming to efficiently traverse the array and count the desired subarrays. With each algorithmic maneuver, I analyze the array structure and devise strategies to identify and count subarrays meeting the specified frequency criterion.

🚀 Day 9 of #100DaysOfCode Challenge! 🚀 Today marks my 9th day of the coding journey, and I dived into the world of sorting algorithms. 💻 🔍 Algorithm Spotlight: Selection Sort Selection sort is a straightforward sorting algorithm that repeatedly identifies the minimum element from the unsorted part of the array, placing it at the beginning. 🔄 📚 Problem of the Day: Selection Sort Challenge Task: Given an unsorted array with N non-negative integers, the goal is to sort the array in non-decreasing order using the Selection Sort algorithm. 📈

🌟 Day 22 of My 75-Day DSA Challenge: Mastering Sorting Algorithms - Exploring Selection Sort! 🚀 #75daysofcode 🔍 Delved into sorting algorithms, starting with the fundamentals of Selection Sort. 💡 Successfully solved a problem on Coding Ninjas, applying Selection Sort to efficiently organize data. Github - https://lnkd.in/dfbjmXVT Excited to continue mastering sorting techniques and tackling more coding challenges. Stay tuned for updates on my progress! 💻💪 #75DaysOfCode #ProgrammingJourney #SortingAlgorithms #SelectionSort #CollegeCoder #CodingNinjas

🌐 Day 15 of My 100-Day LeetCode Challenge 🌐 📈 Total Problems Solved: 35 Halfway through the month and Day 15 has been a deep dive into classic algorithms for handling shortest paths in graphs. Today, I focused on understanding and implementing the Bellman-Ford and Floyd-Warshall algorithms. The Bellman-Ford algorithm was particularly intriguing as it's designed to handle graphs with negative weight edges and can detect negative weight cycles, making it versatile for certain types of problems where other shortest path algorithms might fail. On the other hand, Floyd-Warshall is an all-pairs shortest path algorithm that's used to compute the shortest paths between every pair of vertices in a graph. Its ability to process through a matrix representation of the graph allows for efficient calculations and straightforward implementation. 1 Exploring these algorithms has significantly deepened my understanding of dynamic programming and graph theory. Each algorithm offers unique insights into handling different graph scenarios, enriching my problem-solving toolkit. If you have experiences with these algorithms or have tackled similar challenges, I’d love to learn from your journey and discuss further! #100DaysOfCode #LeetCode #CodingChallenge #Day15 #GraphAlgorithms #BellmanFord #FloydWarshall #ProblemSolving #takeUForward #letsconnect #Openforopportunities

"🚀 Day 5 of my 100-day DSA Challenge! Today was a thrilling dive into Topic : Array Day 5 : 23/01/24 Q1) 3 sum problem Q2) Container with Most water Q3) Longest Subarray with sum divisible by K 💻 Each challenge brings new insights, and I'm loving the journey of mastering algorithms 📊 Join me in this coding odyssey! 🌐 Let's inspire and learn together. 💡 #100DaysOfCode #DSAChallenge #CodingJourney #LearningEveryday"

🚀 Day 40 of the 100 Days of Code Challenge! 🚀 Today, I successfully tackled the Negative Weight Cycle problem, a complex challenge in graph theory! 💻✨ Implemented algorithms to detect cycles with negative weights in a graph, crucial for optimizing various algorithms like Bellman-Ford. This achievement marks a significant milestone in my coding journey, pushing me to explore deeper into algorithmic complexities. Excited to continue unraveling more coding mysteries ahead! 🔍🔄 #100DaysOfCode #GraphTheory #CodingJourney #ProgrammingMilestone #AlgorithmicOptimization 🖥️💡

🚀 Day 10 of #100DaysOfCode Challenge 🚀 Today's coding expedition delved into the intricacies of sorting algorithms, and the spotlight was on the versatile Insertion Sort! 💻🔍 👉 Insertion Sort Unveiled: Insertion Sort, a simple and efficient algorithm, builds the final sorted array one element at a time. It iterates through the array, taking each element and inserting it into its correct position within the sorted subarray. The process continues until the entire array is sorted. ⚙️ Key Steps in Insertion Sort: Take an Element: Select an element from the unsorted part of the array. Insert into Sorted Subarray: Insert the selected element into its correct position within the sorted subarray. Expand the Sorted Subarray: Expand the sorted subarray to include the newly inserted element.