Sliding Window Maximum: Given an array A of size N and an integer K, find the maximum of every subarray (window) of size K. Example Input: [2, 9, 3, -1, -4, -2, 7], K = 3 Expected Output: [9, 9, 3, -1, 7] Top K Elements from a Large Array: You are given an array of one billion numbers, and an integer K such that K is very small compared to N. Write the pseudocode to find the top K largest elements efficiently. Binary Tree Paths: Given a binary tree, write code to print all paths from the root node to every leaf node.
