Programming Interview Questions

grave

Questions (20)

Comments (18)

Followers (2)

Reputation 1690

Page:

Comment hidden because of low score. Click to expand.

-1

of 1 vote

What is square root of an algorithm ?
Though, we can find the square root in O(logn) using binary search.
make low as 0 and high as number.
if mid*mid ==n then mid is square root if lesser,low mid+1
else high = mid-1
This wont work if the number is not perfect square.
We can use newton raphson method for that.

- grave June 27, 2013 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

If you join the strings of the array in any order you have to find the letter which is repeating continuously maximum number of time.
Here maximum is a -3
abbaac

- grave June 24, 2013 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

You just have to make ips from the given string.Why you are appending 0s?

- grave September 08, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

@dc360,the questions are being asked to my friends

- grave August 19, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

I think,the cuts should happen where the 2 parts has the minimum difference in length.
log length is 10.marks at 2 ,4,6 ,8
4 and 6 cost 10
4- at 2 cost 4
6- (2,4) cost 6
(2,4) divide 4 cost 4 total cost -10+6+4+4=24

- grave August 11, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

didnot get your b) step

- grave August 05, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

The question is about find the continous subarray . here it will be 998,999

- grave August 05, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Did not get you?How sorting will help.We have to find continous subarray

- grave August 05, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

stream aaaab pattern aab ,your algo will return false?

- grave August 05, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

node* leftmostcousin(node* root, int level,int value)
{
    if(root == NULL)
      return NULL;
      if(level<=0)
        return NULL;
        if(level ==1 &&(root->left->data == value ||root->right->data == value))
          return NULL;
          if(level ==1)
             {
                 if(root->left)
               return root->left;
               else if(root->right)
               return root->right;
               else 
                return NULL;
             }   
             node * lefti = leftmostcousin(root->left,level-1,value);
             if(lefti !=NULL)
              return lefti;
              else 
              return leftmostcousin(root->right,level-1,value);
              return NULL;
}

- grave August 05, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

this seems good,but it is failing in -
arr1- {4,1,6,3,5,4,6,8,4,1,9,5}
arr2-{4,1,6,8,9}
output={1,2,3,0,0,1,2,3,4,5,6,0}
Correct me if i am wrong

- grave August 04, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

i think,smallest window containing all integers in arr2 will itself be the answer.extra constraint is not necessary

- grave August 04, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

image 1 - a[0,0],a[0,1],a[1,1],a[2,1]
image 2 - a[1,4],a[2,4],a[2,3]
image3- a[4,0]
4- a[4,2]
5- a[4,4]

- grave July 31, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

Can we do,
take increasing sequence from root and monotonic decreasing sequence from root and compare.
After comparing number of elements and all elements are same.
e.g. {10 12 13 11 4 2 6 } and {10 12 11 13 4 6 2}
from 1st array 10,12,13 from second 10,12,13
decreasing 10 4 2 and 10 ,4,2
?

- grave July 31, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

int noSibSum(node* root)
{
    if(root == NULL ||(root->left==NULL && root->right == NULL))
    return 0;
    if(root->left!=NULL && root->right == NULL)
      return root->left->data + noSibSum(root->left);
      else if(root->right!=NULL && root->left == NULL)
      return root->right->data+noSibSum(root->right);
      else{
          return noSibSum(root->left)+noSibSum(root->right);
      }
}

- grave July 28, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 3 vote

I think,this can be like number of connected components.
We can do dfs from a 1 do dfs upto we find a zero.Also maintain another matrix which records if the cell is visited or not.then we can choose next 1 which is not visited and do dfs from there.
Comments or Solution?

- grave July 25, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 1 vote

when you find the root,set the matrix[row][root] =0 nad the row of of root as -1,find the rows with all zeroes to find the children

- grave July 21, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

of 0 vote

In worst case ,it will still be O(n^2).
{1 2 3 4 -1}

- grave July 07, 2012 | Flag Reply

Page:

CareerCup

grave

Books

Videos

Resume Review

Mock Interviews