Canopy Mapping Co.’s Post

I've had the pleasure of working closely with vector search in the past few weeks. After many great research papers, brainstorming sessions, and Red Bulls, I've put together an article for those wanting to get into or learn more about vector databases, especially for those who don't necessarily have an ML background 🤖 (like me). I explain concepts such as vector data, embeddings, similarity search and retrieval, and how these elements fit into the larger picture of vector database architecture. 🎢 And of course, I wrote this from the inside perspective of the best, Qdrant. Hope you enjoy it! :)

Come hear me talk this Saturday about vectors, RAG and AI!

The mother of all spreadsheets for anyone into #LLMs, listing most models: • Model sizes, parameter counts • Who built them • Datasets used • Access levels, architectures, languages • & more! → https://lnkd.in/ebY-Ztdz Kudos to Stella Biderman for compiling this outstanding dataset! 🙌

Data Structures And Algorithms 📖 Leetcode🚀 Day 65✅ Topic: Array Problem: Majority Element II ->Time Complexity: O(n) ->Space Complexity: O(n) #100daysofcodechallenge #DrGViswanathanChallenge #DrGViswanathan

Leetcode🚀 Data Structures And Algorithms 📖 Day 13✅ Topic: Deque Problem: Design Circular Deque 🔻Time Complexity: O(1) 🔻Space Complexity: O(1) #150daysofcodechallenge #javaprogramming #DrGViswanathanChallenge #DrGViswanathan

This Easter holiday season was not just about relaxation for me—it was an opportunity to dive deep into an interesting End-to-End Data Engineering capstone project. I extend my heartfelt thanks to Alexey Grigorev and the entire DataTalksClub community for this incredible opportunity to learn and grow 🎉 The project I embarked on was about: "Crimes around London boroughs". For those interested, the GitHub repository for the project can be accessed via the following link - https://lnkd.in/ef97Cc46 Additionally, a snippet of the architecture diagram of my project is provided below. Stay tuned for further insights and updates on this enriching data engineering journey! #dezoomcamp2024 #dataengineering #googlecloud #dbt #mage #terraform

Data Structures And Algorithms 📖 Leetcode🚀 Day 70✅ Topic: Array Problem: Maximum Product Subarray ->Time Complexity: O(n) ->Space Complexity: O(1) #100daysofcodechallenge #DrGViswanathanChallenge #DrGViswanathan

🔄 Day 53/100: Designing a Circular Deque! 🚀 Today's challenge had me thinking in circles—literally! Circular data structures are incredibly useful in various real-world applications, and tackling the Design Circular Deque problem was a great exercise in designing efficient data handling mechanisms. This problem was all about building a circular deque (double-ended queue) with optimized operations for inserting and deleting elements at both ends. 🧠💻 🔍 Today's Challenge: 641. Design Circular Deque The challenge involved implementing a data structure that supports operations like insertions, deletions, and checks for fullness or emptiness in constant time while maintaining the circular nature of the deque. Key Insights: 1️⃣ Circular Array Implementation: I used an array to simulate a circular buffer, handling the wrap-around effect when reaching the end of the deque, which allowed for efficient space utilization. 2️⃣ Efficient Operations: Operations like inserting and deleting from both ends were made constant time (O(1)) by maintaining pointers for the front and rear of the deque. This guarantees that no shifting of elements is required, unlike in standard arrays or lists. 3️⃣ Real-World Relevance: Circular deques are commonly used in scheduling algorithms, buffering systems, and real-time data processing—areas where space efficiency and fast access are critical. 💡 Pro Tip: When designing circular data structures, careful attention to how indices are updated and wrapped around is crucial to ensuring the structure works correctly and efficiently. This problem was an excellent dive into data structure design, and it showed how powerful circular structures can be in optimizing performance. Have you worked with circular queues or deques in your projects? Let’s share tips on where and how they’re most useful! 🚀 #100DaysOfCode #LeetCode #CodingChallenge #ProblemSolving #CircularDeque #DataStructures #AlgorithmDesign #SoftwareDevelopment #GrowthMindset #TechCommunity

Data Structures And Algorithms 📖 Leetcode🚀 Day 85✅ Topic: Array Problem: Merge Without Extra Space ->Time Complexity: O(n) ->Space Complexity: O(1) #100daysofcodechallenge #DrGViswanathanChallenge #DrGViswanathan

Data Structures And Algorithms 📖 Leetcode🚀 Day 26✅ Topic: Array Problem: Set Matrix Zeroes ->Time Complexity: O(n*n) ->Space Complexity: O(1) #100daysofcodechallenge #DrGViswanathanChallenge #DrGViswanathan