Author Archives

Every programmer is an good author!

• Wave Array in Java

  By Prajwal Zade PZ on 6 Jun 2020 • ( 0 )

  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

  By Prajwal Zade PZ on 5 Jun 2020 • ( 0 )

  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

  By Prajwal Zade PZ on 4 Jun 2020 • ( 0 )

  Binary Numbers HackerRank solution(30 days Code) in Java

• Merge Sort in Java

  By Prajwal Zade PZ on 4 Jun 2020 • ( 1 )

  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

  By Prajwal Zade PZ on 2 Jun 2020 • ( 0 )

  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

  By Prajwal Zade PZ on 2 Jun 2020 • ( 1 )

  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

  By Prajwal Zade PZ on 31 May 2020 • ( 1 )

  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

  By Prajwal Zade PZ on 15 Apr 2020 • ( 0 )

  Balanced Brackets Hackerrank Solution