657. 机器人能否返回原点
Easy | String, Simulation
Easy | String, Simulation
Medium | Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
Medium | Array, Hash Table, Greedy, Heap (Priority Queue)
Easy | Array, Matrix
Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree
Hard | String, Dynamic Programming
Medium | Array, Math
Hard | Math, Binary Search
Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree
Medium | Math, Greedy
Easy | Tree, Depth-First Search, Binary Tree
Medium | Math, Bit Manipulation, Depth-First Search, Breadth-First Search
Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree
Easy | Array
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Medium | Hash Table, String, Depth-First Search, Design, Trie
Medium | String, Dynamic Programming, Stack, Greedy
Hard | Array, Math, Backtracking
Easy | Two Pointers, String, Greedy
Easy | Array, Stack, Simulation