From 6e55e199783fc7da50b95657a877c4d0523a84b2 Mon Sep 17 00:00:00 2001 From: John Washam Date: Wed, 22 Apr 2020 08:53:29 -0700 Subject: [PATCH] Fixes typo in file name. --- README.md | 2 +- ...s-cheat-cheet.pdf => bits-cheat-sheet.pdf} | Bin translations/README-ar.md | 2 +- translations/README-bn.md | Bin 285802 -> 285802 bytes translations/README-cn.md | 2 +- translations/README-de.md | 2 +- translations/README-es.md | 2 +- translations/README-fr.md | 2 +- translations/README-he.md | 2 +- translations/README-hi.md | 2 +- translations/README-id.md | 2 +- translations/README-ko.md | 2 +- translations/README-pl.md | 2 +- translations/README-ptbr.md | 2 +- translations/README-th.md | 2 +- translations/README-uk.md | 2 +- translations/README-vi.md | 2 +- 17 files changed, 15 insertions(+), 15 deletions(-) rename extras/cheat sheets/{bits-cheat-cheet.pdf => bits-cheat-sheet.pdf} (100%) diff --git a/README.md b/README.md index 9bb001c..da4bfa7 100644 --- a/README.md +++ b/README.md @@ -628,7 +628,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/extras/cheat sheets/bits-cheat-cheet.pdf b/extras/cheat sheets/bits-cheat-sheet.pdf similarity index 100% rename from extras/cheat sheets/bits-cheat-cheet.pdf rename to extras/cheat sheets/bits-cheat-sheet.pdf diff --git a/translations/README-ar.md b/translations/README-ar.md index 8346fb1..d5c0ffb 100644 --- a/translations/README-ar.md +++ b/translations/README-ar.md @@ -717,7 +717,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-bn.md b/translations/README-bn.md index 826e9884a303e2edcb87669c2819cff98fb762a8..753a2cd0594e97e503e0d92645162ae7bb58c966 100644 GIT binary patch delta 31 jcmaF0L-5rO!G>、<< - [ ] [字码（words）](https://en.wikipedia.org/wiki/Word_(computer_architecture)) diff --git a/translations/README-de.md b/translations/README-de.md index bf272e9..e5a91da 100644 --- a/translations/README-de.md +++ b/translations/README-de.md @@ -693,7 +693,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit - Binärsuche mittels Rekursion - ### Bitweise Operationen - - [ ] [Bits Spickzettel](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - man sollte viele der Zweierpotenzen kennen (von 2^1 über 2^16 und 2^32) + - [ ] [Bits Spickzettel](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - man sollte viele der Zweierpotenzen kennen (von 2^1 über 2^16 und 2^32) - [ ] Erhalte sehr gutes Verständnis Bits zu manipulieren mit: &, |, ^, ~, >>, << - [ ] [Wörter](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Gute Einführung: diff --git a/translations/README-es.md b/translations/README-es.md index 0995f5b..f3c244d 100644 --- a/translations/README-es.md +++ b/translations/README-es.md @@ -636,7 +636,7 @@ Escriba código en un pizarrón o en papel no en la computadora. Pruebe con algu - Búsqueda binaria usando recursión - ### Operaciones bit a bit - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - Debería conocer varias de las potencias de 2 a partir de (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - Debería conocer varias de las potencias de 2 a partir de (2^1 to 2^16 and 2^32) - [ ] Obtenga un buen entendimiento de la manipulación de bits con: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Buena introducción: diff --git a/translations/README-fr.md b/translations/README-fr.md index 65fb769..c66547f 100644 --- a/translations/README-fr.md +++ b/translations/README-fr.md @@ -703,7 +703,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-he.md b/translations/README-he.md index efdec4b..250fc5b 100644 --- a/translations/README-he.md +++ b/translations/README-he.md @@ -697,7 +697,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-hi.md b/translations/README-hi.md index bd8f86d..2e83edc 100644 --- a/translations/README-hi.md +++ b/translations/README-hi.md @@ -549,7 +549,7 @@ memory" का एरर न दे, और तब मुजे कोई वै - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-id.md b/translations/README-id.md index e04e3d5..f12d3d6 100644 --- a/translations/README-id.md +++ b/translations/README-id.md @@ -669,7 +669,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-ko.md b/translations/README-ko.md index b67b075..42c8854 100644 --- a/translations/README-ko.md +++ b/translations/README-ko.md @@ -720,7 +720,7 @@ Anki format의 내 flashcard 데이터베이스: https://ankiweb.net/shared/info - 재귀를 사용한 이진 탐색 - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] 비트 연산자(&, |, ^, ~, >>, <<) 제대로 이해하기 - [ ] [워드](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] 시작하기 좋은 곳: diff --git a/translations/README-pl.md b/translations/README-pl.md index 687f09e..58128df 100644 --- a/translations/README-pl.md +++ b/translations/README-pl.md @@ -617,7 +617,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr - binary search using recursion - ### Operacje bitowe - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Dobrze zrozum manipulowanie bitami korzystając z: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-ptbr.md b/translations/README-ptbr.md index c2c7dd3..c015ecc 100644 --- a/translations/README-ptbr.md +++ b/translations/README-ptbr.md @@ -650,7 +650,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u - busca binária usando recursividade - ### Lógica binária - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) (Folha de consultas sobre Bits) - você deve conhecer várias das potências de 2 de (2^1 até 2^16 e 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) (Folha de consultas sobre Bits) - você deve conhecer várias das potências de 2 de (2^1 até 2^16 e 2^32) - [ ] Consiga um bom entendimento sobre manipulação de bits com: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) (palavras) - [ ] Boa introdução: diff --git a/translations/README-th.md b/translations/README-th.md index be3064f..e33cbc6 100644 --- a/translations/README-th.md +++ b/translations/README-th.md @@ -628,7 +628,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-uk.md b/translations/README-uk.md index 5dc1fe7..f6e8c22 100644 --- a/translations/README-uk.md +++ b/translations/README-uk.md @@ -626,7 +626,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - binary search using recursion - ### Bitwise operations - - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) + - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32) - [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) - [ ] Good intro: diff --git a/translations/README-vi.md b/translations/README-vi.md index 0a92d0e..8ad65bc 100644 --- a/translations/README-vi.md +++ b/translations/README-vi.md @@ -662,7 +662,7 @@ Hãy viết code trên bảng đen hoặc trên giấy. Đừng sử dụng máy - Tìm kiếm nhị phân sử dụng đệ quy - ### Toán tử trên bit - - [ ] [Bits cheat sheet](/extras/cheat%20sheets/bits-cheat-cheet.pdf) - bạn nên thuộc lòng nhiều lũy thừa của 2 (từ 2^1 đến 2^16 và 2^32) + - [ ] [Bits cheat sheet](/extras/cheat%20sheets/bits-cheat-sheet.pdf) - bạn nên thuộc lòng nhiều lũy thừa của 2 (từ 2^1 đến 2^16 và 2^32) - [ ] Hãy chuẩn bị một nền tảng tốt về các biến đổi bit với các toán tử: &, |, ^, ~, >>, << - [ ] [words (thuật ngữ trong kiến trúc máy tính)](https://en.wikipedia.org/wiki/Word_(computer_architecture) ) - [ ] Bài mở đầu: