Bloomberg

Find all possible paths from source node to target node in a directed acyclic graph (DAG)

Count the number of ways to make a given amount using coins

Determine if an undirected graph contains a cycle

Find the k smallest elements from an unsorted array

Group strings that are anagrams of each other together.

Find the length of the longest substring without repeating characters

Find minimum number of meeting rooms required using heap

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time

Move all zeros in an array to the end while maintaining the relative order of non-zero elements

Count the number of islands in a 2D grid

Calculate how much rainwater can be trapped between bars of different heights

Find the nth ugly number using heap-based approach

Determine if two strings are anagrams of each other