Please Login To Continue
Given a singly Linked List and a position, delete a Linked List node at the given position
Lesson 8 of 10 • 0 upvotes • 7:45mins
Rakesh Naga Chinta
A simple solution is to traverse the linked list until you find the node you want to delete. But this solution requires pointer to the head node which contradicts the problem statement. Fast solution is to copy the data from the next node to the node to be deleted and delete the next node.
Adobe, Amazon Top 10 Algorithms in Interview Questions
10 lessons • 1h 21m
1
Top 10 Algorithms in Interview Questions: Introduction
6:31mins
2
Dynamic Programming Floyd Warshall Algorithm
10:19mins
3
Depth First Search or DFS for a Graph
5:47mins
4
Method 2 Linked List (make visited nodes)
5:47mins
5
Breadth First Search or BFS for a Graph
9:27mins
6
Boggle (Find all possible words in a Board of Characters)
8:21mins
7
Kruskal's Minimum Spanning Tree Algorithm
5:53mins
8
Given a singly Linked List and a position, delete a Linked List node at the given position
7:45mins
9
Disjoint set or (union - find) Algorithm of a Graph
10:07mins
10
Finding Bridges in a graph intro to the Algorithm
11:39mins
Crack Campus Placements with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
