Given an array of integers, find the top k frequent numbers and their occurrences. Additionally, solve a grid pathfinding problem involving obstacles (unique paths II variant).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.