Data Structures
matrix
11 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | graph breadth-first search depth-first search +3 more | 49.4% | easy |
2 | graph matrix depth-first search +2 more | 47.5% | easy |
3 | breadth-first search depth-first search recursion +2 more | 38.5% | easy |
4 | matrix recursion depth-first search | 27.4% | easy |
5 | graph breadth-first search depth-first search +4 more | 62.6% | Med. |
6 | graph matrix depth-first search +1 more | 19.1% | Med. |
7 | array matrix two pointers +1 more | 58.3% | hard |
8 | binary search sorting matrix +1 more | 55.8% | hard |
9 | depth-first search backtracking graph algorithms +3 more | 28.7% | Med. |
10 | matrix hash set hash map +2 more | 35.8% | Med. |
11 | depth-first search breadth-first search graph +1 more | 30.3% | Med. |