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.

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.

Building a Spring Boot Application in Jenkins

In this post we will be seeing how we can build our first Spring Boot maven based Java Project in Jenkins. If you're not sure what Jenkins is I would strictly recommend to go through Introduction to Jenkins, Jenkins Architecture, Build first project in Jenkins.

Relationship between Classes

As one starts learning any OOP(Object Oriented Programming) language be it C++, Java, Python etc, one of the concepts which most people fail to understand or go through it superficially is 'Relationship between Classes'.

Install Java on EC2

In this post we will be seeing how we can install Java on our EC2 instance.