【春种】清明前后 种瓜点豆# gardening - 拈花惹草
w*m
1 楼
常见的题目就不列了
A:0, B:1, C:2, ... , AA:26, AB:27, ... , given an integer, return
corresponding string
url normalization(smimilar to the one in leetcode OJ)
unknown size(could be very large) of memory, given start/end pos, return
number of bit 1. assume this is a library call which is called many
times. how to improve the effciency
given a matrix with 0 and 1, return the number of connected component（四向
）
with edge 1
e.g
1 0 1
1 0 1
0 1 1. return 2
trie implementation
a bunch of bars on table, two players, each one could only take n(n = 1,
2, 3) bars at one time, the loser is the one taking the last bar. If you
play first, figure out the strategy to make sure you could win
task dependency, figure out order of task execution
design a flight ticket broker system
design a flight control system
some machines in cluster with the same large file, the machine could
crash at any time, design a system which could guarantee the file could
be copied to the target successfully
A:0, B:1, C:2, ... , AA:26, AB:27, ... , given an integer, return
corresponding string
url normalization(smimilar to the one in leetcode OJ)
unknown size(could be very large) of memory, given start/end pos, return
number of bit 1. assume this is a library call which is called many
times. how to improve the effciency
given a matrix with 0 and 1, return the number of connected component（四向
）
with edge 1
e.g
1 0 1
1 0 1
0 1 1. return 2
trie implementation
a bunch of bars on table, two players, each one could only take n(n = 1,
2, 3) bars at one time, the loser is the one taking the last bar. If you
play first, figure out the strategy to make sure you could win
task dependency, figure out order of task execution
design a flight ticket broker system
design a flight control system
some machines in cluster with the same large file, the machine could
crash at any time, design a system which could guarantee the file could
be copied to the target successfully
