Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1≤ i ≤n) he makes money. Kefa loves progress, that’s why he wants to know the length of the maximum non-decreasing…
The problem is from CodinGame with difficulty level Easy.
You are given N maps for a dungeon. Each map may contain a path to a treasure T, from starting position [ startRow…
N
T
startRow
A left rotation operation on an array of size n shifts each of the array’s elements 1 unit to the left. For example, if 2 left rotations are performed on array [1, 2, 3, 4, 5], then the array would become [3…
[1, 2, 3, 4, 5]
[3
Like mergesort, quicksort also follows divide-and-conquer approach. The algorithm selects an element as…
Merge sort follows divide-and-conquer approach. It divides an array of elements into two subarrays of n/2…
Heapsort is implemented using heap data structure. Heap helps us to represent binary tree without using any…
