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

update readme-pl

Browse Source 
updated
This commit is contained in:
Michal 2020-04-09 13:48:54 +02:00 committed by GitHub
parent 822d1ebc3c
commit f7c0570e64
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 42 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

82
translations/README-pl.md
View File

@ -75,41 +75,41 @@ Jeśli chcesz być inżynierem ds. niezawodności i bezpieczeństwa lub systemó
- [Złożoność algorytmiczna / Big-O / Analiza asymptotyczna](#złożoność-algorytmiczna--big-o--analiza-asymptotyczna) - [Złożoność algorytmiczna / Big-O / Analiza asymptotyczna](#złożoność-algorytmiczna--big-o--analiza-asymptotyczna)
- [Struktury danych](#struktury-danych) - [Struktury danych](#struktury-danych)
- [Arrays](#arrays) - [Arrays](#arrays)
- [Linked Lists](#linked-lists) - [Listy łączone](#listy-łączone)
- [Stack](#stack) - [Stos](#stos)
- [Queue](#queue) - [Kolejka](#kolejka)
- [Hash table](#hash-table) - [Hash table](#hash-table)
- [Więcej wiedzy](#więcej-wiedzy) - [Więcej wiedzy](#więcej-wiedzy)
- [Binary search](#binary-search) - [Binary search](#binary-search)
- [Bitwise operations](#bitwise-operations) - [Operacje bitowe](#operacje-bitowe)
- [Drzewa](#drzewa) - [Drzewa](#drzewa)
- [Trees - Notes & Background](#trees---notes--background) - [Drzewa - uwagi & zarys](#trees---uwagi--zarys)
- [Binary search trees: BSTs](#binary-search-trees-bsts) - [Binary search trees: BSTs - drzewa binarne](#binary-search-trees-bsts--drzewa-binarne)
- [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap) - [Sterta / kolejka priorytetowa / sterta binarna](#sterta--kolejka-priorytetowa--sterta-binarna)
- balanced search trees (general concept, not details) - balanced search trees (general concept, not details)
- traversals: preorder, inorder, postorder, BFS, DFS - traversals: preorder, inorder, postorder, BFS, DFS
- [Sortowanie](#sortowanie) - [Sortowanie](#sortowanie)
- selection - selection (sortowanie przez wybieranie)
- insertion - insertion (sortowanie przez wstawianie)
- heapsort - heapsort (sortowanie przez kopcowanie)
- quicksort - quicksort (sortowanie szybkie)
- merge sort - merge sort (sortowanie przez scalanie)
- [Grafy](#grafy) - [Grafy](#grafy)
- directed - skierowany
- undirected - nieskierowany
- adjacency matrix - macierz sąsiedztwa
- adjacency list - lista sąsiedztwa
- traversals: BFS, DFS - traversals: BFS, DFS
- [Znów więcej wiedzy](#znów-więcej-wiedzy) - [Znów więcej wiedzy](#znów-więcej-wiedzy)
- [Recursion](#recursion) - [Rekursja](#rekursja)
- [Dynamic Programming](#dynamic-programming) - [Programowanie dynamiczne](#programowanie-dynamiczne)
- [Object-Oriented Programming](#object-oriented-programming) - [Object-Oriented Programming - programowanie obiektowe](#object-oriented-programming--programowanie-obiektowe)
- [Design Patterns](#design-patterns) - [wzorce-projektowe](#wzorce-projektowe)
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability) - [Kombinatoryka (n choose k) & probabilistyka](#kombinatoryka-n-choose-k--probabilistyka)
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms) - [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
- [Caches](#caches) - [Caches](#caches)
- [Processes and Threads](#processes-and-threads) - [Procesy i wątki](#procesy-i-wątki)
- [Testing](#testing) - [Testowanie](#testowanie)
- [Scheduling](#scheduling) - [Scheduling](#scheduling)
- [String searching & manipulations](#string-searching--manipulations) - [String searching & manipulations](#string-searching--manipulations)
- [Tries](#tries) - [Tries](#tries)
@ -1038,23 +1038,25 @@ Grafy mogą być wykorzystane do przedstawienia wielu problemów w informatyce,
If you need more detail on this subject, see "String Matching" section in [Additional Detail on Some Subjects](#additional-detail-on-some-subjects) If you need more detail on this subject, see "String Matching" section in [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
- ### Tries - ### Tries
> Trie to drzewo węzłów, które obsługuje operacje Znajdź i Wstaw [etc (...)](https://pl.wikipedia.org/wiki/Drzewo_trie)
- Uwaga: istnieją różne rodzaje drzew tries. Niektóre mają prefixy, niektóre nie, a niektóre używają stringów zamiast bitów Trie to drzewo węzłów, które obsługuje operacje Znajdź i Wstaw [etc (...)](https://pl.wikipedia.org/wiki/Drzewo_trie)
do śledzenia ścieżki.
- Czytam kod, ale go nie implementuję. - Uwaga: istnieją różne rodzaje drzew tries. Niektóre mają prefixy, niektóre nie, a niektóre używają stringów zamiast bitów
- [ ] [Sedgewick - Tries (3 videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4) do śledzenia ścieżki.
- [ ] [1. R Way Tries](https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries) - Czytam kod, ale go nie implementuję.
- [ ] [2. Ternary Search Tries](https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries) - [ ] [Sedgewick - Tries (3 videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
- [ ] [3. Character Based Operations](https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations) - [ ] [1. R Way Tries](https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries)
- [ ] [Notes on Data Structures and Programming Techniques](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries) - [ ] [2. Ternary Search Tries](https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries)
- [ ] Short course videos: - [ ] [3. Character Based Operations](https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations)
- [ ] [Introduction To Tries (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries) - [ ] [Notes on Data Structures and Programming Techniques](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries)
- [ ] [Performance Of Tries (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries) - [ ] Short course videos:
- [ ] [Implementing A Trie (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie) - [ ] [Introduction To Tries (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries)
- [ ] [The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure) - [ ] [Performance Of Tries (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries)
- [ ] [TopCoder - Using Tries](https://www.topcoder.com/community/competitive-programming/tutorials/using-tries/) - [ ] [Implementing A Trie (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie)
- [ ] [Stanford Lecture (real world use case) (wideo)](https://www.youtube.com/watch?v=TJ8SkcUSdbU) - [ ] [The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure)
- [ ] [MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through) (wideo)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) - [ ] [TopCoder - Using Tries](https://www.topcoder.com/community/competitive-programming/tutorials/using-tries/)
- [ ] [Stanford Lecture (real world use case) (wideo)](https://www.youtube.com/watch?v=TJ8SkcUSdbU)
- [ ] [MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through) (wideo)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
- ### Floating Point Numbers - ### Floating Point Numbers
- [ ] simple 8-bit: [Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)](https://www.youtube.com/watch?v=ji3SfClm8TU) - [ ] simple 8-bit: [Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)](https://www.youtube.com/watch?v=ji3SfClm8TU)