contents: revamp basic algo content

contents/algorithms/binary.md

@@ -1,37 +1,53 @@
 ---
 id: binary
 title: Binary
+toc_max_heading_level: 2
 ---
 
-## Study links
+## Introduction
 
-- [Bits, Bytes, Building With Binary](https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa)
-
-## Notes
-
-Questions involving binary representations and bitwise operations are asked sometimes and you must be absolutely familiar with how to convert a number from decimal form into binary form (and vice versa) in your chosen programming language.
-
-Some helpful utility snippets:
-
-- Test k<sup>th</sup> bit is set: `num & (1 << k) != 0`.
-- Set k<sup>th</sup> bit: `num |= (1 << k)`.
-- Turn off k<sup>th</sup> bit: `num &= ~(1 << k)`.
-- Toggle the k<sup>th</sup> bit: `num ^= (1 << k)`.
-- To check if a number is a power of 2, `(num & num - 1) == 0` or `(num & (-num)) == num`.
-- Swapping two variables: `num1 ^= num2; num2 ^= num1; num1 ^= num2`
+Knowledge of binary number system and bit manipulation is less important in coding interviews as most Software Engineers do not have to deal with bits, which is more commonly used when dealing with lower level systems and programming languages. They are still asked sometimes, so you should at least still know how to convert a number from decimal form into binary form, and vice versa, in your chosen programming language.
 
 ## Corner cases
 
 - Be aware and check for overflow/underflow
 - Negative numbers
 
-## Recommended LeetCode questions
+## Techniques
+
+Questions involving binary representations and bitwise operations are asked sometimes and you must be absolutely familiar with how to convert a number from decimal form into binary form (and vice versa) in your chosen programming language.
+
+Some helpful utility snippets:
+
+| Technique | Code |
+| --- | --- |
+| Test k<sup>th</sup> bit is set | `num & (1 << k) != 0`. |
+| Set k<sup>th</sup> bit | <code>num &#124;= (1 << k)</code> |
+| Turn off k<sup>th</sup> bit | `num &= ~(1 << k)`. |
+| Toggle the k<sup>th</sup> bit | `num ^= (1 << k)`. |
+| Multiple by 2<sup>k</sup> | `num << k` |
+| Divide by 2<sup>k</sup> | `num >> k` |
+| Check if a number is a power of 2 | `(num & num - 1) == 0` or `(num & (-num)) == num` |
+| Swapping two variables | `num1 ^= num2; num2 ^= num1; num1 ^= num2` |
+
+## Learning resources
+
+- Readings
+  - [Bits, Bytes, Building With Binary](https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa), basecs
+  - [Bitwise operation](https://en.wikipedia.org/wiki/Bitwise_operation), Wikipedia
+- Videos
+  - [Algorithms: Bit Manipulation](https://www.youtube.com/watch?v=NLKQEOgBAnw), HackerRank
+- Practice
+  - [Practice with bit operations](https://pconrad.github.io/old_pconrad_cs16/topics/bitOps/)
+
+## Recommended questions
 
 - [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)
 - [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)
 - [Counting Bits](https://leetcode.com/problems/counting-bits/)
 - [Missing Number](https://leetcode.com/problems/missing-number/)
 - [Reverse Bits](https://leetcode.com/problems/reverse-bits/)
+- [Single Number](https://leetcode.com/problems/single-number/)
 
 ## Recommended courses