Skip to main content

Posts

Showing posts with the label Data Structures

Print the Elements of a Linked List Hackerrank Solution - java

 Print the Elements of a Linked List Hackerrank Solution - java For Explanation Watch Video : code: import  java.io.*; import  java.math.*; import  java.security.*; import  java.text.*; import  java.util.*; import  java.util.concurrent.*; import  java.util.regex.*; public   class  Solution {      static   class  SinglyLinkedListNode {          public   int  data;          public  SinglyLinkedListNode next;          public  SinglyLinkedListNode( int  nodeData) {              this .data = nodeData;              this .next = null;         }     }      static   class  SinglyLinkedList {          public  SinglyLinkedListNode head;          public  SinglyLinkedListNode tail;          public  SinglyLinkedList() {              this .head = null;              this .tail = null;         }          public   void  insertNode( int  nodeData) {             SinglyLinkedListNode node =  new  SinglyLinkedListNode(nodeData);              if  ( this .head == null) {                  this .head = node;   

Print in Reverse Hackerrank Solution - java

 Print in Reverse Hackerrank Solution - java For Explanation Watch Video: Code: import  java.io.*; import  java.math.*; import  java.security.*; import  java.text.*; import  java.util.*; import  java.util.concurrent.*; import  java.util.regex.*; public   class  Solution {      static   class  SinglyLinkedListNode {          public   int  data;          public  SinglyLinkedListNode next;          public  SinglyLinkedListNode( int  nodeData) {              this .data = nodeData;              this .next = null;         }     }      static   class  SinglyLinkedList {          public  SinglyLinkedListNode head;          public  SinglyLinkedListNode tail;          public  SinglyLinkedList() {              this .head = null;              this .tail = null;         }          public   void  insertNode( int  nodeData) {             SinglyLinkedListNode node =  new  SinglyLinkedListNode(nodeData);              if  ( this .head == null) {                  this .head = node;             }  else  {