69 CS651 Lecture : DSA notes 35

5 views3 pages

Document Summary

L35: remove duplicates in a linked list in java | Lesson 35 | dsa in java | @codingninjasindia. Yogesh yogesh explains how to remove duplicates in a linked list when the link list is unshorted and when the linked list is shorted. Yogesh also discusses from the brute force approach to the optimized approach to remove liquids in our link remove list. Yogesh says that this series is actually a part of our new playlist on data structures and algorithms in. Java by coding ninjas first of all we have to ensure for picking up one element. We can start with picking up an element. For example, we pick this right and then we can compare it with the rest of the elements right to check. If there is another element that is a same value as current node or not right, so we "ll have to insure it okay, so how can we do that.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions