May 18 · 8 min read · Introduction In this article, we will look at fundamentals of linked lists. Linked list is a really powerful data structure especially when you deal with insertion and deletion. Imagine an array with
Join discussion
Apr 9 · 1 min read · Easy — Linked List | Two Pointers | Recursion | Merge The Problem Merge two sorted linked lists into one sorted linked list by splicing together the nodes of the first two lists. Approach Use a dummy node to simplify edge cases and maintain a current...
Join discussionApr 9 · 2 min read · Medium — Hash Table | Linked List | Design | Doubly-Linked List The Problem Design and implement a data structure for Least Recently Used (LRU) cache that supports get and put operations in O(1) time complexity. Approach Use a combination of a hash m...
Join discussionApr 9 · 1 min read · Easy — Linked List | Two Pointers | Hash Table The Problem Given the head of a linked list, determine if the linked list has a cycle in it. A cycle exists if there is some node in the list that can be reached again by continuously following the next ...
Join discussionApr 9 · 1 min read · Medium — Linked List | Math | Simulation The Problem Given two non-empty linked lists representing two non-negative integers stored in reverse order, add the two numbers and return the sum as a linked list. Approach Traverse both linked lists simulta...
Join discussionMar 29 · 17 min read · TLDR: Move a slow pointer one step and a fast pointer two steps through a linked structure. If they ever meet, a cycle exists. Then reset one pointer to the head and advance both one step at a time —
Join discussion
Mar 29 · 16 min read · TLDR: Reversing a linked list in O(1) space requires three pointers — prev, curr, and next. Each step: save next, flip curr.next to point backward, advance both prev and curr. Learn this once and you
Join discussionJan 12 · 4 min read · 🙋♂️Hi In this story, we will uncover how linked lists were first used to solve data structure challenges posed by simple arrays of data. Let’s begin. Prologue: A Problem Without Order It was the early 1950s, and computers were still massive rooms o...
Join discussion
Jan 6 · 4 min read · Stack হচ্ছে একধরনের লিনিয়ার ডাটা স্ট্রাকচার যেখানে ডাটাগুলো টপ পজিশন থেকে ইন্সার্ট ও ডিলিট হয়। অর্থাৎ , এটি LIFO Principal ফলো করে। LIFO → Last In First Outঅর্থাৎ , সবার শেষে যে ঢুকবে সেই সবার শেষে বের হবে। আরেকটু সহজ উদাহারন দিয়ে বুঝানো যাক। ধরো , ত...
Join discussion
Jan 3 · 6 min read · লিঙ্কড লিস্ট হচ্ছে একধরনের লিনিয়ার ডাটা স্ট্রাকচার যেখানে ডাটা একটার পর একটা সিরিয়ালি থাকে। তবে লিঙ্কড লিস্ট Consecutive Memory Location ফলো করে না। অর্থাৎ , মেমরিতে সিরিয়ালি ডাটাগুলো স্টোর হয় না। মেমরি তে বিভিন্ন জায়গায় ডাটা স্টোর হয়। লিঙ্কড লিস্ট ড...
Join discussion
