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)

Day 10: Binary Numbers HackerRank solution(30 days Code) in Java

Binary Numbers HackerRank solution(30 days Code) in Java

Merge Sort in Java

Like QuickSort, Merge Sort also divide and conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, left, mid, right) is key process that assumes that arr[left..mid] and arr[mid+1..right] are sorted and merges the two sorted sub-arrays into one.