Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. You need to output the minimum number of words. For example, input: "aaaisaname" dict: ("a", "aaa", "is", "name") output: "aaa is a name" Wrong output: "a a a is a name"
A box is divided into 4 boxes which is further subdivided into 4 boxes and so on. What is the best Data structure suitable for this scenario?
Division without divide operator
The logic part was not that easy for me
easy
Find all prime numbers no bigger than x.
1) A puzzle to find 3 numbers in an array which summed to 0.
Can you think of an example of a scenario where you would want to use a tree with more degrees of branching than a binary tree?
Given a list of n elements...every element has a duplicate except one...Find that lone number?
There is a singly linked list of ints, write a function that takes the head pointer, and prints the list in reverse order
Viewing 651 - 660 interview questions