Hello Programmers/Coders, Today we are going to share solutions of Programming problems of 30 Days Of Code, HackerRank. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Day 24: More Linked Lists in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use โCtrl+Fโ To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A โFindโ Option There. Use These Option to Get Any Random Questions Answer.
Link for the Problem – Day 24: More Linked Lists โ Hacker Rank Solution
Day 24: More Linked Lists โ Hacker Rank Solution
Problem:
Objective
Check out the Tutorial tab for learning materials and an instructional video!
Task
A Node class is provided for you in the editor. A Node object has an integer data field, , and a Node instance pointer, , pointing to another node (i.e.: the next node in a list).
A removeDuplicates function is declared in your editor, which takes a pointer to the node of a linked list as a parameter. Complete removeDuplicates so that it deletes any duplicate nodes from the list and returns the head of the updated list.
Note: The pointer may be null, indicating that the list is empty. Be sure to reset your pointer when performing deletions to avoid breaking the list.
Input Format
You do not need to read any input from stdin. The following input is handled by the locked stub code and passed to the removeDuplicates function:
The first line contains an integer, , the number of nodes to be inserted.
The subsequent lines each contain an integer describing the value of a node being inserted at the list’s tail.
Constraints
- The data elements of the linked list argument will always be in non-decreasing order.
Output Format
Your removeDuplicates function should return the head of the updated linked list. The locked stub code in your editor will print the returned list to stdout.
Sample Input
6 1 2 2 3 3 4
Sample Output
1 2 3 4
Explanation
, and our non-decreasing list is . The values and both occur twice in the list, so we remove the two duplicate nodes. We then return our updated (ascending) list, which is .
Day 24: More Linked Lists โ Hacker Rank Solution
import java.util.HashSet; import java.util.Scanner; import java.util.Set; /** * @author Techno-RJ * */ public class Day24MoreLinkedLists { static class Node { int data; Node next; Node(int d) { data = d; next = null; } } public static Node removeDuplicates(Node head) { if (head == null) return head; Set<Integer> s = new HashSet<Integer>(); Node node = head; s.add(node.data); Node newNode = new Node(node.data); node = node.next; Node newHead = newNode; while (node != null) { if (!s.contains(node.data)) { s.add(node.data); newNode.next = new Node(node.data); newNode = newNode.next; } node = node.next; } return newHead; } public static Node insert(Node head, int data) { Node p = new Node(data); if (head == null) head = p; else if (head.next == null) head.next = p; else { Node start = head; while (start.next != null) start = start.next; start.next = p; } return head; } public static void display(Node head) { Node start = head; while (start != null) { System.out.print(start.data + " "); start = start.next; } } public static void main(String args[]) { Scanner sc = new Scanner(System.in); Node head = null; int T = sc.nextInt(); while (T-- > 0) { int ele = sc.nextInt(); head = insert(head, ele); } head = removeDuplicates(head); display(head); sc.close(); } }
tadalafil 20mg us best cialis sites online ed pills cheap
order cefadroxil 500mg without prescription lamivudine usa buy propecia tablets
buy estrace 2mg online purchase lamotrigine without prescription minipress 1mg pill
order generic fluconazole ampicillin ca order ciprofloxacin 500mg online
buy mebendazole without prescription order tretinoin gel sale purchase tadalafil generic
order generic flagyl order keflex 500mg for sale buy cephalexin 250mg generic
buy generic avana online buy avanafil no prescription order generic voltaren 100mg
buy clindamycin online cheap buy erythromycin best ed drugs
indomethacin cost purchase indomethacin online cheap order generic suprax
nolvadex where to buy buy generic budesonide over the counter ceftin pill
purchase careprost buy bimatoprost order trazodone 100mg sale
clonidine 0.1mg over the counter order generic catapres cheap tiotropium bromide
order sildenafil pills buy sildenafil 50mg how to get sildalis without a prescription
minocin 100mg cost purchase minocycline pills order actos generic
buy generic arava 20mg order arava 10mg azulfidine oral
buy isotretinoin 20mg generic order accutane 20mg pills order generic azithromycin
order tadalafil 20mg pills cialis 5mg cheap guaranteed cialis overnight delivery usa
azithromycin online buy buy azithromycin 250mg generic gabapentin oral
order furosemide without prescription order lasix 100mg online cheap ventolin over the counter
vardenafil 20mg usa buy generic tizanidine order plaquenil online cheap
order ramipril 10mg online cheap buy glimepiride 1mg sale buy etoricoxib online cheap
order levitra 10mg pills order hydroxychloroquine pill cheap hydroxychloroquine 400mg
asacol us azelastine drug avapro where to buy
olmesartan 10mg cost purchase benicar online cheap divalproex 500mg oral
buy clobetasol sale order buspirone 5mg for sale amiodarone 100mg generic
order acetazolamide 250 mg sale order imdur 20mg imuran price
coreg 25mg tablet brand coreg 6.25mg chloroquine 250mg us
order generic digoxin 250 mg lanoxin 250mg pill molnunat 200mg sale
naproxen 250mg sale buy omnicef 300 mg generic buy generic prevacid
buy albuterol 100 mcg generic brand pantoprazole pyridium price