Write a function in language of your choice that takes in two strings, and returns true if they match. Constraints are as follows: String 1, the text to match to, will be alphabets and digits. String 2, the pattern, will be alphabets, digits, '.' and '*'. '.' means either alphabet or digit will be considered as a "match". "*" means the previous character is repeat 0 or more # of times. For example: Text: Facebook Pattern: F.cebo*k returns true
Given a m*n grid starting from (1, 1). At any point (x, y), you has two choices for the next move: 1) move to (x+y, y); 2) move to (x, y+x); From point (1, 1), how to move to (m, n) in least moves? (or there's no such a path)
# Question 3: # -- % Of sales that had a valid promotion, the VP of marketing # -- wants to know what % of transactions occur on either # -- the very first day or the very last day of a promotion campaign.
Share an example of when you showed Ho’okipa?
Given a wireless channel with loss rate 0.1, what's the throughput one can get with retransmission.
Are you happy to work with us
what is United as a brand and how would you represent them
Do you have a criminal history
Why do you want the job and why do you think you can do it?
Write a recursive function to determine prime number
Viewing 2451 - 2460 interview questions