CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-02-10 05:56:03 +08:00
Code Issues Packages Projects Releases Wiki Activity

misc: prettier format all files

Browse Source
This commit is contained in:
Yangshun Tay
2019-07-14 16:11:44 -07:00
parent a3ecceeaad
commit d2c2453554
39 changed files with 201 additions and 221 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
algorithms/string.md
View File

@@ -1,5 +1,4 @@
String
==
# String
- Output list of strings representing a page of hostings given a list of CSV strings.
- Given a list of words, find the word pairs that when concatenated form a palindrome.
@@ -42,7 +41,7 @@ String
- E.g. `1122344`, next: `21221324`, next: `12112211121214`.
- Count and say problem.
- Compress a string by grouping consecutive similar questions together:
- E.g. `'aaabbbcc' => `'a3b3c2'`.
- E.g. `'aaabbbcc' =>`'a3b3c2'`.
- You have a string consisting of open and closed parentheses, but parentheses may be imbalanced. Make the parentheses balanced and return the new string.
- Given a set of strings, return the smallest subset that contains prefixes for every string.
- E.g. `['foo', 'foog', 'food', 'asdf']` => `['foo', 'asdf']`.