Welcome to a new post of the How to prepare for an interview series, In this post I will solve a new set of problems. If you didn't read previous post, Read it from here.
52. Implement a hash table.
53. How to validate is a binary search tree is legit?
54. Implement a pow(base, exp) function.
55. Implement the pow function iteratively.
56. Given like -77288.100, a772sb, 2000.00.11. return if it's a number.
57. Find maximum successive sum in an array.
58. Reverse words in a sentence.
59. Check if an element is present in a completely sorted 2D array.
60. Determine if a graph is bipartite.
61. How would you implement division without +, - or *?
Now we finished this post. Read the next post. Please share this post to your Facebook, Linkedin, Twitter if you liked it.
Remember you should discuss these solutions with me, and refer if there are mistakes or other good solutions.
Problems
53. How to validate is a binary search tree is legit?
54. Implement a pow(base, exp) function.
55. Implement the pow function iteratively.
56. Given like -77288.100, a772sb, 2000.00.11. return if it's a number.
57. Find maximum successive sum in an array.
58. Reverse words in a sentence.
59. Check if an element is present in a completely sorted 2D array.
60. Determine if a graph is bipartite.
61. How would you implement division without +, - or *?
Now we finished this post. Read the next post. Please share this post to your Facebook, Linkedin, Twitter if you liked it.
No comments:
Post a Comment