gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Merge pull request #349 from melongbob/master

Browse Source 
Fix typos in README.md
This commit is contained in:
John Washam 2018-06-25 21:31:47 -07:00 committed by GitHub
commit a95a521d86
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -5,7 +5,7 @@
> as a Software Development Engineer at Amazon](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)! > as a Software Development Engineer at Amazon](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
> You probably won't have to study as much as I did. Anyway, everything you need is here. > You probably won't have to study as much as I did. Anyway, everything you need is here.
> >
> The items listed here will prepare you well for in an interview at just about any software company, > The items listed here will prepare you well for an interview at just about any software company,
> including the giants: Amazon, Facebook, Google or Microsoft. > including the giants: Amazon, Facebook, Google or Microsoft.
> >
> *Best of luck to you!* > *Best of luck to you!*
@ -1669,7 +1669,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
- [ ] [CS 61B Lecture 39: Augmenting Data Structures](https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc) - [ ] [CS 61B Lecture 39: Augmenting Data Structures](https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc)
- ### Balanced search trees - ### Balanced search trees
- Know least one type of balanced binary tree (and know how it's implemented): - Know at least one type of balanced binary tree (and know how it's implemented):
- "Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular. - "Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
A particularly interesting self-organizing data structure is the splay tree, which uses rotations A particularly interesting self-organizing data structure is the splay tree, which uses rotations
to move any accessed key to the root." - Skiena to move any accessed key to the root." - Skiena