Must solve problems (List from LeetCode Data Structure and Algorithms crash course) Arrays and strings Arrays and strings are two of the most fundamental data structures seen in algorithm problems. They’re very similar when it comes to solving problems as they’re both an ordered collection of elements that can be iterated over. Arrays…

for standalone application WebRTC development The currently supported platforms are Windows, Mac OS X, Linux, Android and iOS. See the Android and iOS pages for…webrtc.googlesource.com git clone https://chromium.googlesource.com/chromium/tools/depot_tools.git export PATH=`pwd`/depot_tools:"$PATH" Create a workspace. I created “webrtc” directory for my workspace. webrtc$fetch - nohooks - no-history webrtc

some features of AV1 Partitioning 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. https://github.com/CppCon/CppCon2020/blob/main/Presentations/back_to_basics_move_semantics/back_to_basics_move_semantics__david_olsen__cppcon_2020.pdf

What will drive next-generation streaming Problems with existing solutions Drawbacks of WebSocket a message based protocol: a single ordered stream of messages on TCP Head Of Line Blocking poor fit for latency sensitive applications Drawbacks of WebRTC need ICE: not a good fit to non-browser-to-browser setting need a user-space SCTP (Stream Control Transmission Protocol) protected by DTLS a tightly-bound stack…

Hard skills get you hired, but soft skills get you promoted: from the LinkedIn article by Zain Kahn 1. Communication Listen without interrupting Speak with a positive tone Pay attention to your body language 2. Persuasion Identify what other people care about Create stories that resonate with them Communicate those stories with brevity and…

Backtracing problems 46 Permutations I Example 1: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Example 2: Input: nums = [0,1] Output: [[0,1],[1,0]] Solution class Solution { public: void permute(vector<vector<int>>& answer, vector<int> nums, int begin) { if (begin == nums.size()) { answer.push_back(nums); return; } for (int i=begin; i<nums.size(); …

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; } };

binary search A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n]…