Posts by Collection

algos

Bit DP Problems

4 minute read

Published:

Bit DP is use a binary number to represent a state which a state is consisted of several varying substate(likely two states on and off), we use bit 1, 0 to represent these varying substates.

4/19 Problems

7 minute read

Published:

1420 Build Array Where You Can Find The Maximum Exactly K Comparisons find how many combs there exist so that 1)n ints 2)every int is leq m. 3)search cost is K(search cost will increase by 1 if current number is larger than maximum)

plan for competitive programming

less than 1 minute read

Published:

I planned to start competitive programming and I will follow the tasks below. I list them so that I can regularly check my progress. Hopefully I can be a red coder in 1 year or 2. At the same time I will post problems I solved randomly. Watch on!

portfolio

publications

talks

teaching

Teaching experience 1

Undergraduate course, University 1, Department, 2014

This is a description of a teaching experience. You can use markdown like any other post.

Teaching experience 2

Workshop, University 1, Department, 2015

This is a description of a teaching experience. You can use markdown like any other post.