Nagendra Kumar | Activity Streams

Nagendra Kumar in the forum topic Implement Sqrt(x) in the group Facebook Interviews

unsigned long int l = 0;
unsigned long int b = 1+ (x / 2);
if(x == 1)
return 1;

while(l+1 b)
{
unsigned long int m = l + (b-l) / 2;
if(m *m == x)
[…]

1 person likes this.

Nagendra Kumar joined the group LinkedIn Interview 1 year ago

Nagendra Kumar in the forum topic Implement Pow(x, n) in the group LinkedIn Interview

I just copy paste the code of jcleetcode. it says time limit exceeded for larget input. Can some share me the solution which can pass the tle condition for large input

Nagendra Kumar joined the group Google Interview 1 year ago

Nagendra Kumar started the forum topic find the largest subset of it which form a sequence in the group Google Interview

Given an int array which might contain duplicates, find the largest subset of it which form a sequence.
Eg. {1,6,10,4,7,9,5}
then ans is 4,5,6,7

Sorting is an obvious solution. Can this be done in O(n) time

Nagendra Kumar joined the group Facebook Interviews 1 year, 1 month ago