@tanaytoshniwal
A developer by profession and a musician by passion, with heart of a biker
Nothing here yet.
Nothing here yet.
Dec 31, 2024 · 3 min read · Depth-First Search (DFS) is a fundamental graph traversal technique that explores as far as possible along each branch before backtracking. It is widely used in various applications such as detecting cycles, finding connected components, and solving ...
Join discussion
Dec 31, 2024 · 3 min read · Graphs are fundamental structures in computer science, representing networks such as social connections, web pages, or city maps. One popular way to traverse graphs is through Breadth-First Search (BFS), a systematic level-by-level exploration method...
Join discussion
Dec 31, 2024 · 3 min read · Graphs are one of the most versatile data structures in computer science, used to model relationships and connections. Breadth-First Search (BFS) is a powerful algorithm for exploring a graph level by level. This blog delves into the BFS implementati...
Join discussion
Dec 31, 2024 · 5 min read · Doubly Linked Lists (DLL) are a type of linked list where each node contains two references (or pointers) — one pointing to the next node and another pointing to the previous node. This structure allows traversal in both directions, making it more fl...
Join discussion
Dec 31, 2024 · 4 min read · A Circular Linked List is a variation of a linked list where the last node points back to the first node, creating a circular structure. This data structure is often used in applications like real-time scheduling, buffer management, and more. In this...
Join discussion
