Roboflow’s Post

Advanced Vision Analytics with Supervision-0.18.0!🔥 🔥 🔥 TL;DR: In just ONE HOUR, I crafted this demo using Supervision that showcases detection, tracking, and filtering objects by class, confidence, and zone. It includes counting across three distinct lines and, most notably, stunning visualizations. This entire toolkit is open-source, under the MIT license! I employed a percentage bar for confidence visualization, which can be adapted for displaying time, speed, or other metrics. Highlights of Supervision-0.18.0: - Three new annotators: PercentageBar, RoundedBox, and OrientedBox. - Enhanced LineZone feature for improved precision in tracking and analytics. - Integration of Ultralytics YOLOv8 OBB for advanced oriented bounding box models. ⮑ 🔗 GitHub repository: https://lnkd.in/d57M3c32 As usual, thanks to all the collaborators who worked with me on this release 🙏🏻 Rafael Levy, Christoforos Aristeidou, Utku Özbek, Paul Guerrie, Brad Dwyer, James Gallagher MISTC, and especially Onuralp SEZER 👨🏻💻! Without you, it would not have been possible! Check the comments below for additional resources, including documentation, release notes, examples, and community interaction.👇🏻 #computervision #objectdetection #tracking #videoanalytics #python #github #opensource

Just solved a complex data structure challenge! Conquering these problems not only sharpens our skills but also fuels our passion for problem-solving. Ready to take on the next challenge and push your limits? Let's keep growing and learning together! 🚀📊 #DataStructures #CodingChallenge #ProblemSolving #TechSkills #Programming #SoftwareDevelopment #GrowthMindset #TechCommunity #KeepLearning #Innovation #CodeNewbie #100DaysOfCode #LeetCode #HackerRank #Algorithms #DevLife #WomenInTech #TechCareers #TechTrends #CareerGrowth #TechIndustry #DataStructures #CodingChallenge #ProblemSolving #TechSkills #Programming #SoftwareDevelopment #GrowthMindset #TechCommunity #KeepLearning #Innovation #CodingLife

🚀 Day 3 of 100 Days of Code: Minimum Number of Days to Disconnect Island 🧠 Today, I delved into a challenging problem on LeetCode: "1568. Minimum Number of Days to Disconnect Island." This problem pushed my understanding of grid-based algorithms, particularly around island counting and disconnection. 🔍 Problem Breakdown: Objective: Determine the minimum number of days required to disconnect an island in a grid by strategically removing land cells. Approach: The solution hinges on using Depth-First Search (#DFS) to explore the grid and count the number of islands. By identifying and removing key land cells, the algorithm seeks to split the island into multiple disconnected parts. 💻 Code Highlights: DFS Implementation: I utilized DFS to traverse the grid and keep track of visited cells. This was essential to ensure each island segment was accurately identified. Critical Points: The algorithm focuses on identifying critical points (land cells) where removal results in disconnection. This was the core challenge that required precise handling. 🔧 Use Cases: Disaster Management Simulations: This algorithm can be adapted to simulate scenarios in environmental studies, such as predicting the effects of land removal or flooding on island structures. Game Development: Similar logic can be applied in games involving territory control, where strategic decisions are required to split or disconnect areas. 💡Pro Tips: Edge Cases Matter: Always account for edge cases, such as single-cell islands or grids with multiple connected components, to ensure your solution is robust. Optimization: While my current solution is efficient, there's always room for improvement. I'll be exploring ways to optimize both the runtime and memory usage further. 🔍 Results: Runtime: 977 ms (Beating 39.25% of submissions) Memory Usage: 16.79 MB (Beating 59.81% of submissions)    📈 Next Steps: Performance Tuning: I plan to revisit this problem to explore alternative approaches, potentially leveraging BFS or dynamic programming for improved efficiency. Advanced Grid Problems: Diving deeper into grid-based algorithms, I’ll be tackling more complex problems to further sharpen my skills. #100DaysOfCode #Python #LeetCode #CodingChallenge #Algorithms #ProblemSolving #DFS #DataStructures #Optimization #GridAlgorithms

Hello LinkedIn family! Day (58/150) - Today's Highlights: Today, I Tried to the solve an medium level problem from gfg based on Linkedlist concept.I encourage everyone to join the challenge and give it a try! Share your solutions, and let's learn together. Here's an in-depth explanation of an problem statement. Problem discription is as follows: Check if Linked List is Palindrome: Given a singly linked list of size N of integers. The task is to check if the given linked list is palindrome or not. Example 1: Input: N = 3 value[] = {1,2,1} Output: 1 Explanation: The given linked list is 1 2 1 , which is a palindrome and Hence, the output is 1. Example 2: Input: N = 4 value[] = {1,2,3,4} Output: 0 Explanation: The given linked list is 1 2 3 4 , which is not a palindrome and Hence, the output is 0. Expected Time Complexity: O(N) Expected Auxialliary Space Usage: O(1) (ie, you should not use the recursive stack space as well) Constraints: 1 <= N <= 105. Today's key takeaways! Stay tuned for tomorrow's updates, and let the learning journey continue! #LeetCodeChallenge #CodingJourney #DailyCoding #AlgorithmLearning #ProblemSolving #ProgrammingLogic

DAY 4: 🌟 LeetCode Daily Challenge: Find Valid Matrix Given Row and Column Sums 🌟 🔍 Problem Overview: You are given two arrays rowSum and colSum of non-negative integers where rowSum[i] is the sum of the elements in the ith row and colSum[j] is the sum of the elements of the jth column of a 2D matrix. In other words, you do not know the elements of the matrix, but you do know the sums of each row and column. Find any matrix of non-negative integers of size rowSum.length x colSum.length that satisfies the rowSum and colSum requirements. Return a 2D array representing any matrix that fulfills the requirements. It's guaranteed that at least one matrix that fulfills the requirements exists. 📝Steps: 1. Initialize the number of rows and number of columns as N and M respectively. 2. Initialize the answer matrix origMatrix of size N∗M with all values as zero. 3. Iterate over the cells in the matrix and for each cell (i, j), do the following: i)Store the value in origMatrix[i][j] as min(rowSum[i], colSum[j]). ii)If rowSum[i] is minimum, subtract the above origMatrix value from colSum[j] and move to next row(i++). iii)If colSum[j] is minimum, subtract the above origMatrix value from rowSum[i] and move to next column(j++). 4. Return origMatrix. Time Complexity: O(M+N) Have you solved today's challenge? I'd love to hear about your approach and thoughts in the comments! #LeetCode #DailyChallenge #CodingJourney #ProblemSolving #TechCommunity #LearningEveryday #FindValidMatrixGivenRowandColumnSums

🎯 𝗗𝗮𝘁𝗮 𝗘𝗻𝗴𝗶𝗻𝗲𝗲𝗿𝗶𝗻𝗴 𝗝𝗼𝘂𝗿𝗻𝗲𝘆: 📌 𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗔𝗬 𝟭𝟰/𝟵𝟬 📢 𝗗𝗮𝘁𝗮𝗘𝗻𝗴𝗶𝗻𝗲𝗲𝗿𝗶𝗻𝗴-𝗣𝘆𝘁𝗵𝗼𝗻 𝗣𝗿𝗲𝗽𝗮𝗿𝗮𝘁𝗶𝗼𝗻 𝗝𝗼𝘂𝗿𝗻𝗲𝘆 ☀️ Will Keep appending the program along with the Solution- ✅ Remove all characters except the numeric characters from an alphanumeric string. ✅ Count type of Characters in a string. 𝗦𝗼𝗹𝘂𝘁𝗶𝗼𝗻: https://lnkd.in/g3Qr7BZk #dataengineeringjourney #pythonprogram #pythonproblem #pythonjourney #dataengineer

Day #60 of 100Days100LeetCode challenge and i have solved Permutation Sequence problem ⭐ Time Complexity: O(n) Space Complexity: O(n) My LeetCode: https://lnkd.in/ghW6nCFp Problem Link: https://lnkd.in/geNE8-5v GitHub: https://lnkd.in/gqwKCxRX #100Days100LeetCode #LeetCodeChallenge #CodingChallenge #Algorithm #PermutationSequence #JavaProgramming #AlgorithmPractice #SoftwareDevelopment #ProblemSolving #CodingJourney #CodeNewbie #SoftwareEngineer #TechLinkedIn #DeveloperCommunity #LinkedInCoding #ProgrammingLife #DailyCoding #100DaysOfCode #ProgrammingSkills

🚀 Day 48 of #100DaysOfCode 🚀 Problem: String Compression Definition: Given an array of characters chars, compress it using the following algorithm: Begin with an empty string s. For each group of consecutive repeating characters in chars: *If the group's length is 1, append the character to s. *Otherwise, append the character followed by the group's length. The compressed string s should not be returned separately, but instead, be stored in the input character array chars. Note that group lengths that are 10 or longer will be split into multiple characters in chars. After you are done modifying the input array, return the new length of the array. You must write an algorithm that uses only constant extra space. Checkout - Github: https://lnkd.in/gKFHiiZa Leetcode: https://lnkd.in/g-hbEeXp #CodingJourney #LeetCode #CodeStudio #ProblemSolving #Algorithms #TechSkills #ContinuousLearning #DSAwithedSlash edSlash LeetCode

Hello connections, Here is my solution to the Daily LeetCoding Challenge for March, Day 28. Problem link: https://lnkd.in/dkZCi6SH Github Solution link: https://lnkd.in/dwTfdHbk LeetCode Solution link (Detailed Explanation): https://lnkd.in/dEtMQjzh Time Complexity - O(n) Space Complexity - O(n) Learning from the problem: By maintaining a sliding window and updating the window boundaries based on certain conditions, it becomes possible to traverse the array in a linear fashion while keeping track of relevant information such as element frequencies. #leetcode #problemsolving #cpp #datastructures #happycoding