2037. 让每个学生都有座位的最少移动次数
Easy | Array, Greedy, Sorting, Counting Sort
Easy | Array, Greedy, Sorting, Counting Sort
Hard | Array, Binary Search
Medium | Array, Hash Table, Design, Simulation
Medium | Array, Backtracking, Bit Manipulation, Enumeration
Medium | Array, Tree, Depth-First Search, Binary Tree
Hard | Array, Dynamic Programming, Graph Theory, Topological Sort
Easy | Array, Hash Table, String, Counting
Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)
Medium | Array, String, Binary Search, Prefix Sum
Hard | Array, String, Backtracking, Simulation