Two problems. (1) N-Queens: place N queens on an N x N board so that no two attack each other (same row, column or diagonal), using backtracking. (2) Merge overlapping intervals: given a list of…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.