algorithm/coding-interview-university
1
0
Fork 0
mirror of https://github.com/jwasham/coding-interview-university.git synced 2025-07-14 03:18:48 +08:00
Code Issues Packages Projects Releases Wiki Activity

Lines 700/1996

Browse Source
This commit is contained in:
Anri Lombard
2022-07-16 17:14:51 +02:00
parent 4eec4d8069
commit c320804004
1 changed files with 15 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
translations/README-af.md
View File

@ -688,4 +688,18 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
- [ ] front() - kry waarde van voorste item
- [ ] back() - kry waarde van laaste item
- [ ] insert(indeks, waarde) - voeg waarde by indeks, so huidige item by daardie indeks word gewys na deur nuwe item by daardie indeks
- [ ]
- [ ] erase(indeks) - verwyder node by gegewe indeks
- [ ] value_n_from_end(n) - lewer die waarde van die node by nth posisie van die einde van die lys af
- [ ] reverse() - keer die lys om
- [ ] remove_value(waarde) - verwyder die eerste item in die lys met dié waarde
- [ ] Doubly-linked List
- [Deskripsie (video)](https://www.coursera.org/lecture/data-structures/doubly-linked-lists-jpGKD)
- Nie nodig om te implimenteer nie
- ### Stapel
- [ ] [Stacks (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
- [ ] Sal nie implementeer nie. Implementering met skikking is maklik
- ### Queue
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)