Sunday, February 2, 2014

How to prepare for an interview - 10

Back to a new set of problems. If you didn't read previous posts start from here. Read previous post here.

Remember you should discuss these solutions with me, and refer if there are mistakes or other good solutions.


92. Combinations(n, k).

93. Write a program to sum two binary numbers represented as strings.

94. Compute the cubic root.

95. You have two lists with meetings scheduling (start time, end time) Meetings in single list don't intersect. Find all intersecting meetings across the two lists.

96. Given a binary search tree, write an algorithm to find the kth smallest element.

97. Given a string, return true if it's a palindrome. Only alphanumeric characters considered. Do this in one pass through the string.

99. Write a function that calculates input strings with operators +,-,*,/ eg. "5+5*6" should output 35.

100. Longest common substring between two strings A and B.

101. Find the predecessor of a binary search tree.

Now we finished this post, Read next post. Please share this post on your Facebook, Linkedin, and Twitter.

No comments:

Post a Comment