1d ago · 2 min read · Putting things in order efficiently Day 104 of 149 👉 Full deep-dive with code examples The Library Shelf Analogy Imagine organizing a messy bookshelf: One at a time → Pick each book, put it in the right spot Make piles → Group by letter, then arra...
Join discussionMar 29 · 16 min read · TLDR: If an array holds n numbers in range [1, n], each number belongs at index num - 1. Cyclic sort places every element at its correct index in O(n) time using O(1) space — then a single scan reveals every missing and duplicate number. Five intervi...
Join discussionFeb 2 · 5 min read · 📌 Features Covered Create railway bookings View bookings in browser Filter by source & destination Sort by journey date Pagination (page-wise data) Strong backend validations Proper frontend ↔ backend connectivity 📁 Folder Structure (IMPO...
Join discussionFeb 2 · 6 min read · MongoDB itself is schema-less, but Mongoose adds schema and validation support. This ensures data stored in your database follows correct format and rules. 🔹 1. Built-in Validations in Mongoose Mongoose allows adding validations directly inside sch...
Join discussionFeb 2 · 3 min read · When working with MongoDB and Mongoose, most of the time we don’t just want to fetch all documents. Instead, we want filtered results, maybe sorted in a specific way, and sometimes divided into pages for efficiency. That’s where query operators + sor...
Join discussionJan 27 · 4 min read · Selection Sort is one of those beginner sorting algorithms which despite not being very efficient, form important foundation concepts. This article explains it in a very beginner-friendly way and even portrays some comparisons with insertion sort. AL...
Join discussionJan 26 · 4 min read · Insertion sort is one of those algorithms that looks simple but feels confusing when you first come across it. As a beginner, I struggled to understand how it actually works. This article walks through insertion sort step-by-step, making sure you don...
Join discussionDec 30, 2025 · 4 min read · Sorting Basics in Java : A Simple Example Sorting is one of the fundamental concepts in programming. It helps us arrange data in a particular order, like ascending or descending, which makes searching and analysing data easier. In Java, sorting can b...
Join discussionDec 24, 2025 · 2 min read · 1.引言 在实现对画面当中的目标进行检测后，紧接着就会考虑到场景当中的这几个问题，我检测的目标会往哪个方向走，我检测的目标出现的时间和消失的时间，这就会引入另一个算法：跟踪算法，目前主流的几个跟踪算法方向如下：使用传统跟踪算法（SORT，DeepSORT），传统深度学习的跟踪算法（LSTM），大模型框架下的跟踪算法（MOTR，MOTR2）等。 算法逻辑 SORT的核心主要是有两个：使用卡尔曼滤波用于目标运动的预测和更新，使用匈牙利算法处理数据匹配的问题。 我们使用YOLO可以拿到比较稳定的输出目...
Join discussion
