Browse Source

Lines 760/1996

Anri Lombard 2 năm trước cách đây
mục cha
commit
38176c0138
1 tập tin đã thay đổi với 4 bổ sung1 xóa
  1. 4 1
      translations/README-af.md

+ 4 - 1
translations/README-af.md

@@ -753,4 +753,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [blueprint](https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems)
     - [ ] Implement:
         - binary search (op 'n gesorteerde skikking van heelgetalle)
-        - binary search met recursion
+        - binary search met recursion
+
+- ### Bitwise operations
+    - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/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)