Facebook Interview Report
- 12of 12 votes
AnswersGiven a mapping of alphabets to integers as follows:
- skrish August 13, 2014 in United States
1 = A
2 = B
3 = C
...
26 = Z
Given any combination of the mapping numbers as string, return the number of ways in which the input string can be split into sub-strings and represented as character strings. For e.g. given
"111" -> "AAA", "AK", "KA" -> 3
Valid combinations are ({1,1,1}, {1,11},{11,1}) = 3
"11" -> "AA", "K" -> 2
Valid combinations are ({1,1},{11}) = 2
"123" -> "ABC", "LC", "AW" -> 3
Valid combinations are ({1,2,3},{1,23},{12,3}) = 3
You don't have to return all the mappings, only the number of valid mappings.| Report Duplicate | Flag | PURGE
Facebook Senior Software Development Engineer String Manipulation - 2of 4 votes
AnswersFind the maximum depth of binary tree?
- skrish August 13, 2014 in United States
Once I wrote the code for this, interviewer asked me next question| Report Duplicate | Flag | PURGE
Facebook Senior Software Development Engineer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.