algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-04 23:43:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Remove duplicate "count and say" question (#101)

Browse Source 
"Count and say" is at line 43 again
This commit is contained in:
Yao Ding
2018-08-10 12:56:28 -04:00
committed by Yangshun Tay
parent af08a87e27
commit 9876a76272
1 changed files with 0 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
algorithms/string.md
View File

@ -16,7 +16,6 @@ String
- 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.
- Given a list of names (strings) and the width of a line, design an algorithm to display them using the minimum number of lines.
- Design a spell-checking algorithm.
- Count and say problem.
- Longest substring with `K` unique characters.
- [Source](http://blog.gainlo.co/index.php/2016/04/12/find-the-longest-substring-with-k-unique-characters/)
- Given a set of random strings, write a function that returns a set that groups all the anagrams together.