Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Arrays Backtracking Hash

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S whose sum is exactly x. ...
Arrays Backtracking Hash

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S whose sum is exactly x. ...
Arrays Divide and Conquer ABCO

Find the Rotation Count in Rotated Sorted array

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (clockwise) k number of times. Given such an array, find the value of k. ...
Arrays Randomized Searching

K’th Smallest/Largest Element in Unsorted Array Set 2 (Expected Linear Time)

We recommend reading following post as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 Given an array and a number k where...
Arrays Heap Searching

K’th Smallest/Largest Element in Unsorted Array Set 1

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array ...
Arrays Searching ABCO

K’th Smallest/Largest Element in Unsorted Array Set 3 (Worst Case Linear Time)

We recommend reading following posts as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 K’th Smallest/Largest Eleme...
Arrays Divide and Conquer ABCO

Find the Rotation Count in Rotated Sorted array

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (clockwise) k number of times. Given such an array, find the value of k. ...
Arrays Searching ABCO

K’th Smallest/Largest Element in Unsorted Array Set 3 (Worst Case Linear Time)

We recommend reading following posts as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 K’th Smallest/Largest Eleme...
Arrays Backtracking Hash

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S whose sum is exactly x. ...
Arrays Heap Searching

K’th Smallest/Largest Element in Unsorted Array Set 1

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array ...

Subscribe to Our Newsletter