Skip to main content

Write Code to Remove Duplicates from a Singly Linked List.

File1: Employee.java
-------------------------------------------------------
package org.developersbrain.solutions;

public class Employee {
int empID;
String empFirstName;
String empLastName;
String dateOfBirth;
String  empZipCode;

public Employee(){
empID = 0;
empFirstName = "";
empLastName  = "";
dateOfBirth = "<YYYYMMDD>";
empZipCode = "000-0000";
}

public Employee(int empID,String empFirstName,String empLastName,String dateOfBirth,String empZipCode){
this.empID  = empID;
this.empFirstName = empFirstName;
this.empLastName  = empLastName;
this.dateOfBirth = dateOfBirth;
this.empZipCode = empZipCode;
}

public int getEmpID() {
return empID;
}

public void setEmpID(int empID) {
this.empID = empID;
}

public String getEmpFirstName() {
return empFirstName;
}

public void setEmpFirstName(String empFirstName) {
this.empFirstName = empFirstName;
}

public String getEmpLastName() {
return empLastName;
}

public void setEmpLastName(String empLastName) {
this.empLastName = empLastName;
}

public String getDateOfBirth() {
return dateOfBirth;
}

public void setDateOfBirth(String dateOfBirth) {
this.dateOfBirth = dateOfBirth;
}

public String getEmpZipCode() {
return empZipCode;
}

public void setEmpZipCode(String empZipCode) {
this.empZipCode = empZipCode;
}

public void printAll(){
System.out.println("--------------------------------------------------------------------------------------");
System.out.println("Employee Number :"+this.empID);
System.out.println("Name :"+this.empFirstName+" "+this.empLastName);
System.out.println("DOB :"+this.dateOfBirth);
System.out.println("ZipCode :"+this.empZipCode);
System.out.println("----------------------END OF RECORD---------------------------------------------------");
}

public void printRecord(char delimiter){
System.out.println(this.empID+""+delimiter+this.empFirstName+delimiter+this.empLastName+delimiter+this.dateOfBirth+delimiter+this.empZipCode);
}

@Override
public String toString(){
//printAll();
printRecord(',');
return "";
}

public boolean equals(Employee e){
return this.empID==e.empID;
}
}

File2: Node.java
-----------------------------------------------------
package org.developersbrain.solutions;

public class Node<T> {
//Single linked list implementation
//Generic Class implementation
private T t;
private Node<T> nextNode;

Node(T t){
this.t = t;
this.nextNode=null;
}

//Non-recursive function
public void add(T t){
Node<T> newN = new Node<T>(t);
Node<T> nextN=this;
while(nextN.nextNode != null){

nextN = nextN.nextNode;
}
nextN.nextNode = newN;
}

                                         public void removeDuplicates(){
                                                Node head=this;
                                                 Node next;
                                                 Node previous;
                                                Employee emp;
                                               Employee emp1;
                                                if(head==null) return;
                                                 while(head!=null){
                                                              emp = (Employee) head.t;
                                                               next=head.nextNode;
                                                               previous = head;
                                                                        while(next!=null){
                                                                                     emp1=(Employee) next.t;
                                                                                      if(emp.equals(emp1)){
                                                                                                    previous.nextNode=next.nextNode;
                                                                                      }else{
                                                                                                      previous = next;
                                                                                    }
                                                                                  next=next.nextNode;
                                                                   }
                                                            head=head.nextNode;
                                        }

public void traverse(){
Node<T> nextN=this;
while(nextN != null){
nextN.t.toString();
nextN=nextN.nextNode;
};
}
}


File3 : MainClass.java
-----------------------------------------------------
package org.developersbrain.solutions;

public class MainClass {

public static void main(String[] args){
Node<Employee> listV=new Node<Employee>(
new Employee(100,"First Name","Last Name","19750101","123-4567")
);
listV.add(new Employee(100,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(200,"First Name","Last Name","19800101","123-4567"));
listV.add(new Employee(300,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(300,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(500,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(600,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(700,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(800,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(900,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1000,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1110,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1200,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1300,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1300,"First Name","Last Name","19670101","123-2327"));
listV.add(new Employee(1300,"First Name","Last Name","19670101","123-2327"));
System.out.println("Before Removing Duplicates(BY Employee ID)");
System.out.println("------------------------------------------");
listV.traverse();
listV.removeDuplicates();
System.out.println();
System.out.println("After Removing Duplicates(BY Employee ID)");
System.out.println("------------------------------------------");
listV.traverse();
}
}


Output:
-------------------------------------------------------------------------------

Before Removing Duplicates(BY Employee ID)
------------------------------------------
100,First Name,Last Name,19750101,123-4567
100,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
200,First Name,Last Name,19800101,123-4567
300,First Name,Last Name,19670101,123-2327
300,First Name,Last Name,19670101,123-2327
500,First Name,Last Name,19670101,123-2327
600,First Name,Last Name,19670101,123-2327
700,First Name,Last Name,19670101,123-2327
800,First Name,Last Name,19670101,123-2327
900,First Name,Last Name,19670101,123-2327
1000,First Name,Last Name,19670101,123-2327
1110,First Name,Last Name,19670101,123-2327
1200,First Name,Last Name,19670101,123-2327
1300,First Name,Last Name,19670101,123-2327
1300,First Name,Last Name,19670101,123-2327
1300,First Name,Last Name,19670101,123-2327

After Removing Duplicates(BY Employee ID)
------------------------------------------
100,First Name,Last Name,19750101,123-4567
200,First Name,Last Name,19800101,123-4567
300,First Name,Last Name,19670101,123-2327
500,First Name,Last Name,19670101,123-2327
600,First Name,Last Name,19670101,123-2327
700,First Name,Last Name,19670101,123-2327
800,First Name,Last Name,19670101,123-2327
900,First Name,Last Name,19670101,123-2327
1000,First Name,Last Name,19670101,123-2327
1110,First Name,Last Name,19670101,123-2327
1200,First Name,Last Name,19670101,123-2327
1300,First Name,Last Name,19670101,123-2327

Comments

Post a Comment

Popular posts from this blog

CODILITY: Determine whether given string of parentheses is properly nested.

Task description A string S consisting of N characters is called  properly nested  if: S is empty; S has the form " (U) " where U is a properly nested string; S has the form " VW " where V and W are properly nested strings. For example, string " (()(())()) " is properly nested but string " ()) " isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. For example, given S = " (()(())()) ", the function should return 1 and given S = " ()) ", the function should return 0, as explained above. Assume that: N is an integer within the range [ 0 .. 1,000,000 ]; string S consists only of the characters " ( " and/or " ) ". Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(1) (not counting the storage requi...
1 comment
Read more

Distinct: Compute number of distinct values in an array.

Task description Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −1,000,000 .. 1,000,000 ]. For example, given array A consisting of six elements such that: A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1 the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. Complexity: expected worst-case time complexity is O(N*log(N)); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified. class Solution { public int solution ( int [] A) { // write your code in Java SE 8 int len=A.length; int count= 1 ; ...
1 comment
Read more

Dominator: Find an index of an array such that its value occurs at more than half of indices in the array.

Dominator Find an index of an array such that its value occurs at more than half of indices in the array. Task description A zero-indexed array A consisting of N integers is given. The dominator  of array A is the value that occurs in more than half of the elements of A. For example, consider array A such that A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3 The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8. Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −2,147,483,648 .. 2,147,483...
Post a Comment
Read more