ashish0529 / competetive_coding Goto Github PK

Problem 1:-

Aggressive cows (SPOJ):-

Overview:- All the C cows must be placed in the N stalls such that the minimum distance between any two of them is as large as possible Print the largest distance.

Time complexity:- O(nlogn)

Problem 2:-

Element Index problem:-

Overview:- Program to return the (x,y) coordinate of an element in 2-d row wise and column wise sorted array

Time complexity:- O(m+n)

Problem 3:-

Overview:- Using Stack to do next greater element