some features of AV1

## Partitioning

- superblock 128x128
- Tiles / Tile groups
- recursive tree for each superblock

some features of AV1

- superblock 128x128
- Tiles / Tile groups
- recursive tree for each superblock

back to basic by David Olsen

This lecture by David Olsen is the best “move semantics” video ever.

bitwise operation

Medium

2391184Add to ListShare

Given two integers `left`

and `right`

that represent the range `[left, right]`

, return *the bitwise AND of all numbers in this range, inclusive*.

**Example 1:**

**Input:** left = 5, right = 7

**Output:** 4

**Example 2:**

**Input:** left = 0, right = 0

**Output:** 0

**Example 3:**

**Input:** left = 1, right = 2147483647

**Output:** 0

**solution:**

`class Solution {`

public:

int rangeBitwiseAnd(int left, int right) {

while (right > left) {

right = right & (right - 1);

}

return left & right;

}

};