Insert a Node at the Tail of a Linked List HackerRank Solution.

Insert a Node at the Tail of a Linked List HackerRank Solution. You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.

Delete duplicate-value nodes from a sorted linked list Java (HackerRank)

Delete duplicate-value nodes from a sorted linked list Java. You're given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete as few nodes as possible so that the list does not contain any value more than once. The given head pointer may be null indicating that the list is empty.

Print Linked List in Reverse in Java(HackerRank).

Print Linked List in Reverse in Java

Insert a node at the head of a linked list in Java HackerRank.

Insert a node at the head of a linked list in Java

Square Root Using Binary Search in Java

Square Root Using Binary Search in Java (Asked in AMAZON, ACCOLITE, FLIPKART, VMWare..etc)

Kadane’s Algorithm in Java

(Asked by all big gaint tech compaines like AMAZON, PAYTM, MICROSOFT,,etc) Basicly, kaden's algorithm is used to find the longest sum contiguous subarray.

Wave Array in Java

WAVE ARRAY IN JAVA Given an unsorted array of integers, sort the array into a wave like array. An array ‘arr[0..n-1]’ is sorted in wave form if arr[0] >= arr[1] = arr[3] = …..

Array Rotation in Java

Array Rotation in Java. (Asked by top MNC's like Amazon, Microsoft, goldman sachs, wipro, TCS..etc)