Round 1: Check if a binary tree B is a subtree of a binary tree A (20 min)- Solution O(m*n) \nRound 2: OOP, design a chess with implmentation of pawn move logic (a simple way: could only move one step forward, should be careful for different color) (20min)\nRound 3: https://leetcode.com/problems/jump-game/ and also min step, solution should be O(n * n) at least (20min)\nRound 4: System design - design a online book store (more focus on database & cache) (20min)

Round 1: Check if a binary tree B is a subtree of a binary tree A (20 min)- Solution O(m*n) \nRound 2: OOP, design a chess with implmentation of pawn move logic