# Algorithm Interview Questions

“If you had 5,623 participants in a tournament, how many games would need to be played to determine the winner” |

“Given the daily values of a stock, find how you can lose the most with one buy-sell trading.” |

“Number of 1's in binary representation of integer?” |

**We want your feedback**– Is this interview information helpful to you? Yes | No

“Given an array of integers where each element points to the index of the next element how would you detect if there is a cycle in this array?” |

“Write a function Brackets(int n) that prints all combinations of well-formed brackets. For Brackets(3) the output would be ((())) (()()) (())() ()(()) ()()()” |

“Print a singly-linked list backwards, in constant space and linear time.” |

“Given an array of integers eg [1,2,-3,1] find whether there is a sub-sequence that sums to 0 and return it (eg 1,2,-3 or 2,-3,1) Checking every sub-sequence is O(n^2) which is too inefficient...” |

“Implement a power function to raise a double to an int power, including negative powers.” |

“Implement a function to validate whether a given binary tree is a BST (i.e. write an isBST() function).” |

“(a) first, write a function to calculate the hamming distance between two binary numbers (b) write a function that takes a list of binary numbers and returns the sum of the hamming distances for...” |

**1**–

**10**of

**792**Interview Questions