Oracle Interview Guide

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

Given a set of distinct positive integers, find the largest subset where every pair of elements (i, j) in the subset satisfies either i % j == 0 or j % i == 0. Return this largest divisible subset.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

Find the length of the longest strictly increasing subsequence within a given array of numbers. A subsequence doesn't need to be contiguous, but the elements must maintain their original order.

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

Find the k most frequent elements in a given array of numbers. Return the top k elements based on their frequency.

Find the maximum value within a sliding window of size k as it moves across an array. You'll need to efficiently update the maximum as the window slides.

You are given a list of meeting time intervals. Determine the minimum number of conference rooms required to accommodate all the meetings without any overlap.

The goal is to transform a given integer to zero using a special set of bit manipulation operations. Find the minimum number of operations needed for this conversion.

You are given a grid of oranges, some fresh, some rotten. Rotten oranges contaminate adjacent fresh oranges; find the minimum time until all oranges are rotten.

Given a binary tree, imagine you are standing on the right side of it. Return the values of the nodes you can see, ordered from top to bottom.

The problem involves decoding a string that follows a specific encoding rule: k[encoded_string], where the encoded_string inside the square brackets is repeated exactly k times. Your task is to decode the string and return the decoded string.

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. These consecutive numbers do not need to be adjacent in the original array.

You are given two linked lists, each representing a non-negative integer. Add the two numbers and return the sum as a linked list.