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.

Recursion in Java

In this post we will be seeing What is Recursion in Java. Recursion is a part of algorithms in which function calling itself until some base condition is not occur.

Quick Sort in java

QuickSort is a sorting algorithm which follows Divide and Conquer apporach. It picks an element as pivot and partitions the given array around the picked pivot.

Balanced Brackets 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.

HackerRank 30 Days code Question 2 Solution

This is hackerrank question (30 day code) in which we have to find the total meal cost For this we have given meal price (base cost of a meal), tip percent (the percentage of the meal price being added as tip), and tax percent (the percentage of the meal price being added as tax) for a meal, we have to find the total meal cost in integer