Need Approach with better time complexity?@dutch @ne555 @lastchance Actually i faced this problem during my interviews and whatever i unders...

Need Approach with better time complexity?@dutch @booradley60 We have to select an index from A such that this selected index is always less...

Need Approach with better time complexity?Given 2 sorted arrays A and B, if we have to select A[i] and B[j] such that i <= j, find the Kth min...

DP@counter strike [code]it gives answer of 70282652 but answer is 26030209[/code] This is wrong becaus...

Can anybody suggest the solution in O(n)?@Duthomhas @ne555 I used the lcs for two strings but getting time limit exceed.Can you guyz help me ...

This user does not accept Private Messages