algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-05 16:12:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix typo issue (#20)

Browse Source 
Fix the issue: https://github.com/yangshun/tech-interview-handbook/issues/19
The given example was not correct:
'E.g. "abba" and "redblueredblue" should return true'
It has ben fixed by changing the input "redblueredblue" to "redbluebluered"
This commit is contained in:
Olivier Perbellini
2017-10-02 14:03:45 +01:00
committed by Yangshun Tay
parent 36769c6d4d
commit f7fb1ed366
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms/string.md
View File

@ -10,7 +10,7 @@ String
- Write a function called `eval`, which takes a string and returns a boolean. This string is allowed 6 different characters: `0`, `1`, `&`, `|`, `(`, and `)`. `eval` should evaluate the string as a boolean expression, where `0` is `false`, `1` is `true`, `&` is an `and`, and `|` is an `or`.
- E.g `"(0 | (1 | 0)) & (1 & ((1 | 0) & 0))"`
- Given a pattern string like `"abba"` and an input string like `"redbluebluered"`, return `true` if and only if there's a one to one mapping of letters in the pattern to substrings of the input.
- E.g. `"abba"` and `"redblueredblue"` should return `true`.
- E.g. `"abba"` and `"redbluebluered"` should return `true`.
- E.g. `"aaaa"` and `"asdasdasdasd"` should return `true`.
- E.g. `"aabb"` and `"xyzabcxzyabc"` should return `false`.
- If you received a file in chunks, calculate when you have the full file. Quite an open-ended question. Can assume chunks come with start and end, or size, etc.