Java-Data-Structures-And-Algorithms/LinkedList/CrackingLinkedListInterviewQuestions/Main.java at main · AAdewunmi/Java-Data-Structures-And-Algorithms · GitHub

Name: Java-Data-Structures-And-Algorithms/LinkedList/CrackingLinkedListInterviewQuestions/Main.java at main · AAdewunmi/Java-Data-Structures-And-Algorithms · GitHub
Rating: 4.9 (9183 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
packageLinkedList.CrackingLinkedListInterviewQuestions;

importjava.util.HashSet;

publicclassMain {
publicstaticvoidmain(String[] args) {
SinglyLinkedListsinglyLinkedList_1 = newSinglyLinkedList();
singlyLinkedList_1.createSinglyLinkedList(1);
singlyLinkedList_1.insertNode(2);
singlyLinkedList_1.insertNode(3);
singlyLinkedList_1.insertNode(2);
singlyLinkedList_1.insertNode(5);
singlyLinkedList_1.traverseSinglyLinkedList();
singlyLinkedList_1.deleteDups(singlyLinkedList_1);
singlyLinkedList_1.traverseSinglyLinkedList();
/*LinkedList.SinglyLinkedList.java singlyLinkedList_2 = new LinkedList.SinglyLinkedList.java();
 singlyLinkedList_1.createSinglyLinkedList(5);
 singlyLinkedList_1.insertNode(6);
 singlyLinkedList_1.insertNode(4);
 singlyLinkedList_1.reverseTraverseSinglyLinkedList();*/

 } // end main
staticclassNode{
publicintnodeValue;
publicNodenodeNext;
publicNodenodePrev;
 } // end Node Class

staticclassSinglyLinkedList{
publicNodehead;
publicNodetail;
publicintsize;
publicvoidcreateSinglyLinkedList(intnodeValue){
NodenewNode = newNode();
newNode.nodeValue = nodeValue;
newNode.nodeNext = null;
head = newNode;
tail = newNode;
size = 1;
 }
publicvoidinsertNode(intnodeValue){
NodenewNode = newNode();
newNode.nodeValue = nodeValue;
newNode.nodeNext = null;
tail.nodeNext = newNode;
tail = newNode;
size++;
 }

publicvoidtraverseSinglyLinkedList(){
NodetempNode = head;
for (inti = 0; i < size; i++) {
System.out.print(tempNode.nodeValue);
if (i != size - 1){
System.out.print(" -> ");
 }
tempNode = tempNode.nodeNext;
 }
System.out.println("\n");
 }

publicvoiddeleteDups(SinglyLinkedListsinglyLinkedList){
HashSet<Integer> hashSet = newHashSet<>();
Nodecurrent = singlyLinkedList.head;
Nodeprev = null;
while(current != null){
intcurval = current.nodeValue;
if (hashSet.contains(curval)) {
prev.nodeNext = current.nodeNext;
singlyLinkedList.size--;
 }else{
hashSet.add(curval);
prev = current;
 }
current = current.nodeNext;
 }
 }

 } // end LinkedList.SinglyLinkedList.java Class

}// end Main Class