Data Structures
matrix
13 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | graph depth-first search union-find +3 more | 41.6% | Med. |
2 | matrix graph matrix traversal +4 more | 49.3% | easy |
3 | matrix breadth-first search depth-first search +4 more | 47.4% | easy |
4 | breadth-first search depth-first search recursion +3 more | 38.4% | easy |
5 | array matrix depth-first search +2 more | 27.3% | easy |
6 | graph matrix breadth-first search +3 more | 62.6% | Med. |
7 | graph depth-first search matrix +1 more | 19.1% | Med. |
8 | 58.2% | hard | |
9 | binary search sorting matrix +1 more | 55.8% | hard |
10 | depth-first search backtracking graph +2 more | 28.6% | Med. |
11 | graph depth-first search union-find +3 more | 41.6% | Med. |
12 | matrix hash set hash map +2 more | 35.8% | Med. |
13 | depth-first search breadth-first search graph +1 more | 30.2% | Med. |