To identify loop in the graph, We are going to use Find and Union technic with Path Compression. We are going to create subject of each vertex and we will represent one element of that subset as a parent, So next time we will take two vertex will check the parent of each, if both… Read more
To identify loop in the graph, We are going to use Find and Union technic. We are going to create subject of each vertex and we will represent one element of that subset as a parent, So next time we will take two vertex will check the parent of each, if both has same parent… Read more
This is the algorithm to find exact square root in java. We are going to use binary search to get exact result.
On Given Map of Character and Priority of character, design your own sorting algorithm to sort list of strings.
Base on given array of characters design your own sorting algorithm to sort array of string.
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
This is the algorithm to reverse the linked list.
In this algorithm we just need length of longest sub string of given string. We are going to solve this by O(n) Example : Input : zabac Output : 3 Just take a queue and add character in it one by one. Just before adding any new char, check if it is already there then… Read more
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Rotate an array of n elements to the right by k steps and then find an element at particular position in array. For example, with n = 5 and k = 3, the array [1,2,3,4,5] is rotated to [4,5,1,2,3]. Now after rotation we need element at position 3 which is 2 Consider this array as… Read more