LeetCode 206 Reverse Linked List is one of the classic programming problems. The problem description is nothing complicated. We have to reverse the given Linked List and return the reversed list. For example: We can solve this problem in many ways. Before getting into the solution, you can check my blog about the Linked List […]
Reverse Linked List | LeetCode 206 | Python | Solution Read More »
LeetCode 2095 Before moving into the problem, we need to know how to delete a node from a linked list. If you don’t know about Linked List, you can read my article about it (Linked List). To delete a node, we need to keep track previous node of it. We will use the formula: previous.next
Delete the Middle Node of a Linked List | LeetCode 2095 | Python | Solution Read More »
Click here to see the problem details. Problem Overview The problem description is pretty straightforward. We are given two sorted Linked List. And we have to merge those given Lists into one sorted list. That’s the problem. Suppose our given two lists are 1 -> 3 and 2 -> 4. And the result will be
Merge Two Sorted Lists | LeetCode 21 | Python | Solution Read More »
In computer science, Linked List is a basic and linear type data structure like Array. Both are used to store a collection of elements. But there is a difference between Array and Linked List. But In this article, I will write all about Linked List. You can read my article about the Array if you
Click here to see the problem details. Read the description first. We will be given a Linked List. We have to determine there is any cycle or not in the linked list. It is an easy problem. See the problem details for the visual representation of the cycle in a linked list. Coding Part Generally,
Linked List Cycle | LeetCode 141 | Python | Solution Read More »
Let’s solve a linked list problem. See the problem in Leetcode. Click Here. The problem description is pretty short and simple. It says that we are will be given a linked list. We have to delete all duplicates such that each element appears only once. Suppose the given linked list is: 1 -> 2 ->
83. Remove Duplicates from Sorted List | LeetCode | Python | Solution Read More »
Here is the problem link. See the problem explanation first and try to understand the problem. It’s an easy linked list problem. We have to return the middle node from a linked list. We don’t have to check the emptiness of the given linked list. We will receive only a non-empty linked list. If there
876. Middle of the Linked List | LeetCode | Python | Solution Read More »
This one is a basic linked list problem. Here is the problem link. See the detailed explanation there. This problem is very simple and straightforward. We have to delete the given node. We don’t need to check anything and don’t need to return anything. See the note in the below of the problem explanation. Suppose
237. Delete Node in a Linked List | LeetCode | Solution | Python Read More »
The stack is a data structure. To implement a stack data structure, we can use both linked list or array. Below are examples of both types of implementation. Using Linked List Using Python List
Implementation of Stack Using Linked List and List – Code Snippet Read More »