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] = …..

# HackerRank Questions

## 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.

## Count the node of linked list in Java

In this post we will be Count the node of linked list in Java. Given a singly linked list. The task is to find the length of the linked list, where length is defined as the number of nodes in the linked list.

## Balanced Brackets Hackerrank Solution

Balanced Brackets Hackerrank Solution

## Print the Elements of a Linked List Hackerrank Solution

Print the Elements of a Linked List Hackerrank Solution

## Anagram of String

In this post we will be seeing Solution of Hackerran Question for Anagram of String. An anagram of a string is another string that contains same characters, only the order of characters can be different. For example, “abcd” and “dabc” are anagram of each other.