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

Java Interface

Problem Statement A Java interface can only contain method signatures and fields. Interface can be used to achieve polymorphism. In this problem you will practice your knowledge on interfaces. You are given an interface   AdvancedArithmetic   which contains a method signature   public abstract int divisorSum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum   function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1,2,3 and 6, so   divisorSum   should return 12. Value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.   Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. import java.util.*; interface AdvancedArithmetic{   p...
Post a Comment
Read more

Java Abstract Class

Problem Statement A Java abstract class is a class that can't be instantiated, that means you cannot create new instances of an abstract class. It works as a base for subclasses. You should learn about Java Inheritence before attempting this challenge. Following is an example of abstact class: abstract class Book {     String title;     abstract void setTitle(String s);     String getTitle()     {         return title;     } } If you try to create an instance of this class like the following line you will get an error: Book new_novel=new Book(); You have to create another class that extends the abstract class. Then you can create instance of the new class. Notice that   setTitle   method is abstract too and has no body. That means you must implement the body of the that method in the child class. In the editor we have provided ...
Post a 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