Deepnote’s Post

Hello LinkedIn family! Day (148/150) - Today's Highlights: Today, I explored Kadane's Algorithm, a key method for finding the maximum subarray sum. Kadane's Algorithm: Purpose: Find the maximum sum of a contiguous subarray. Steps: Initialize max_current and max_global with the first element. Iterate through the array, updating max_current and max_global. Today's key takeaways! Stay tuned for tomorrow's updates, and let the learning journey continue! #LeetCodeChallenge #CodingJourney #DailyCoding #Algorithms #CPlusPlus #ProblemSolving #coderarmy

Day 2 🚀 of the #100DaysOfCode challenge. Finding the maximum possible sub-array sum using the Kadane's Algorithm. #100daysofcode

🚀 Day 26 of #100DaysOfCode 🚀 Here's a quick peek of the Day 26: ➡️Learned few algorithms like Kadane’s Algoritm, Moore’s Voting Algorithm, Dutch National Flag Algorithm Stay tuned for daily updates 💻✨✌️ #Day26 #CodingChallenge #DSALearning

YOLOv9 is here to continue the YOLO series legacy!! With less params and less calculations, YOLOv9 has significant improvement in performance. I tried to explain the YOLOv9's overview in a detailed article at LearnOpenCV. Our article is added to the official YOLOv9 GitHub README by the makers, showing the power of collaboration and open source. Link to the article - https://lnkd.in/g2BDX5eQ OpenCV University OpenCV

Day 111: 🌐 Graph Exploration Triumph! Today, I delved into the LeetCode problem "Find if Path Exists in Graph," navigating through graph nodes to determine connectivity. Employing DFS (Depth-First Search), I efficiently uncovered paths, solidifying my grasp on graph traversal. Thrilled for the adventures that lie ahead! 🚀🔍 #LeetCode #GraphTraversal #ProblemSolving

Hello LinkedIn family! Day (31/150) - Today's Highlights: Today i explored an Kadane's Algorithm. The discription about the algorithm is as follows: Kadane's Algorithm: Objective: Find the maximum sum of a contiguous subarray within a given array. Algorithm Steps: -->Initialize two variables, maxEndingHere and maxSoFar, to track the maximum sum ending at the current index and the overall maximum sum, respectively. -->Iterate through the array. -->For each element, update maxEndingHere to be the maximum of the current element or the sum of maxEndingHere and the current element. -->Update maxSoFar to be the maximum of maxSoFar and maxEndingHere. -->Continue the iteration until you reach the end of the array. Time Complexity: Kadane's Algorithm has a time complexity of O(n), where n is the number of elements in the array. This is because it iterates through the array once. Space Complexity: The algorithm has a space complexity of O(1), indicating constant space usage. It doesn't require additional memory proportional to the input size; it uses only a few variables to keep track of the maximum sums. Today's key takeaways! Stay tuned for tomorrow's updates, and let the learning journey continue! #LeetCodeChallenge #CodingJourney #DailyCoding #AlgorithmLearning #ProblemSolving #ProgrammingLogic

🚀 Day 29 of #50DaysofCode: PW Institute of Innovation 🚀 Solving 'Kth Largest Element in an Array' on LeetCode! Today's challenge was to find the Kth largest element in an unsorted array, a common problem that can be tackled using various algorithms. My solution : https://lnkd.in/giYbc2ug Approach: I implemented a solution using a Min-Heap to maintain the top k largest elements. By iterating through the array, I ensured that the heap always contains the largest k elements, making the smallest element in the heap the answer. ⏱️ Time Complexity: The solution runs in O(n log k), making it efficient even for large arrays. 💾 Space Complexity: The space complexity is O(k) due to the Min-Heap storage. 🧠Key Learnings: - Leveraging Min-Heap for problems where you need to maintain a dynamic subset of elements. - Understanding the balance between time and space complexity when optimizing algorithms. #50DaysOfCode #LeetcodeChallenge #DataStructures #Algorithms #CodingJourney #Day29

Ram Ram Bhai Saariye Coders ne! 💻✨ Aaj hai 100 Hard ka Mera 38 Din. Day 38 of the coding odyssey: 🚀 Navigating the Code Constellations! 🔍 Embark on a cosmic journey through the algorithmic galaxies, charting the course amidst the enigmatic rotations of code arrays. 💻🌠 Unveil the celestial secrets, align your skills, and let the rotated array mysteries guide your ascent! 🌌✨ #CodeQuest #RotatedArrayExploration #CosmicCoding 🚀#drgvishwanathanchallenge 🚀

🌟 Day 14 of my #geekstreak2024! Today, I solved the "Kth Element in Two Arrays" problem on Geeks for Geeks. 📝 Key takeaways: 🔍 Enhanced my skills in array manipulation and merging techniques 🧩 Learned to implement efficient algorithms for finding the Kth element in sorted arrays 🚀 Improved my problem-solving abilities in handling large datasets Feeling more accomplished with each challenge and ready for the next one! 💪 #GFG30DaysCodingStreak #CodingChallenge #GeeksForGeeks #ArrayManipulation #EfficientAlgorithms #ProblemSolving #ContinuousLearning #CodingSkills

What we built 🏗️, shipped 🚢, and shared 🚀 last week:  LangGraph and Open GPTs! Our friends at LangChain have been bringing the heat 🔥 in 2024 from v0.1 to Series A! This event focused on LangGraph, their new library built to address the challenge of incorporating agentic reasoning cycles into custom chains. Built on top of LangGraph, we also covered OpenGPTs, which allow developers to develop low-code chatbots, RAG applications, and more complex agent-powered assistants. Check out the full video walkthrough in the comments!