Dijkstra’s #algorithm a classic to solve the shortest path problem on positive graphs using a min-priority queue and greedy strategy https://lnkd.in/dpS-V-B3
Fabio Galuppo’s Post
More Relevant Posts
-
Pre-Final Year Student at TIET | Practicing DSA | Skilled in C++, Python, C | Front-End Developer (JavaScript) | Machine Learning | Cloud Computing | Strong in Cybersecurity | Continuously honing tech skills.
Day - 35/100 Problem: Dijkstra's shortest path Codingninjas: https://lnkd.in/eWp3npX9 #100daysofcodingchallenge #graphs #algorithms #codingninjas #consistencyiskey 😎
-
-
Leet Code 204: Medium marked Solved Today: Count primes Input: n = 10 Output: 4 Explanation: There are 4 prime numbers less than 10: 2, 3, 5, and 7. Using sieve of Eratosthenes It is the simple approach to find the prime number in the number in optimal time and space complexity. Space complexity: O(n) Time complexity: O(n*log(log(n))) #leetcode #algorithm #problemsolving #medium
-
-
Found the smallest divisor to meet the threshold for array division. Time complexity led me to employ binary search for this challenge! 🔍 #codingskills #algorithms #dailycodingchallenge
-
-
🚀 Day 138/300 of #300DaysCodeChallenge Solved finding cube root using Binary Search today! 🧮 Binary Search isn’t just for arrays – it’s great for precise calculations too. 🔍 #BinarySearch #Algorithms #CodingChallenge #300DaysCodeChallenge #ProblemSolving
-
-
🎯This is my Day 16 of #100DaysOfCode🚀 Today's problem was , Given a Binary Search Tree and a target sum. Check whether there's a pair of Nodes in the BST with value summing up to the target sum. #DrGViswanathan #100DaysOfCode #AdvancedDSA #CompetitiveCoding #Algorithms #TechJourney
-
-
October has brought in some big shifts to the algorithm that you should know about... 📈 Swipe to see all the latest updates 👉 #instaalgorithm #algorithm #instagramalgorithm #instagramupdates
-
🌟 Day Fourty-Nine : Count Sort! 🌟 Hey everyone ! Today we have first of our Index based sorting technique that is "Count Sort". So what do I mean by index based? It uses a count array that keeps track of how many times an element array has been occurred. Then we go through the Count array and as we encounter the element and its frequency, we update the original array and it is sorted this way. This technique uses O(n) time and is neither adaptive nor stable. Next time you can expect discussion on Bin-Bucket list until then keep learning! #DSA #Algorithm #Sorting #countsort #LearningJourney #learninginpublic
-
-
DAY 28 of #100dayscodechallenge implemented a method 'findMaxK' to efficiently find the maximum value k in an integer array 'nums' such that -k is also present in the array. Leveraging sorting and a two-pointer approach, the algorithm swiftly identifies the desired pair, showcasing an optimized solution for array search challenges. #JavaProgramming #Algorithm #TwoPointerApproach #ArraySearch #LinkedInLearning #HOPE #leetcode Problem : Largest positive integer that exists with its negative Problem no. : 2441 Time complexity : O(n log n) Space complexity : O(1)
-
-
Metallurgy & Materials Engineering Student PU '25 | Ex-Intern @ Fiber Craft Industry & UET || Mechatronics Enthusiast | Proficient in Composite Materials.
Snake Project: This project demonstrates an intriguing snake-like motion, and introduces the concept of a simple and instructive procedure or "algorithm" to do the motion.
-
Hello everyone! Here is the second article on Graph search part of a Graph theory series I'm working on. https://lnkd.in/eDjAYvSi #Graph #GraphTheory #GraphSearch #Algorithm #Pathfinding #BFS #BreadthFirstSearch #DFS #DepthFirstSearch #ComputerScience
-
