Adobe

Determine if an array is sorted in ascending, descending, or not sorted at all

Count the number of distinct ways to reach the top of n stairs

Create a deep copy of an undirected graph represented with adjacency lists

Connect ropes with minimum cost using greedy approach with heap

Determine if you can finish all courses given prerequisite relationships using topological sorting

Find and return the second largest element in an array of integers

Design and implement a stack data structure with push, pop, top, and empty operations

Check if a graph can be colored with exactly two colors such that no two adjacent nodes have the same color

Find the largest rectangle that can be formed in a histogram

Find the longest palindromic substring in a given string

Find the length of the longest substring without repeating characters

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

Find the minimum window substring that contains all characters of another string

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

Find the time it takes for a signal to reach all nodes in a network using shortest path algorithms

Implement regular expression matching with support for '.' and '*'

Reorganize string so no two adjacent characters are the same

Reverse the order of elements in an array in-place and return the modified array

Rotate an array to the right by k steps where k is non-negative

Find the minimum time for all oranges to rot using BFS

Serialize a binary tree to a string and deserialize it back to the original tree

Find the maximum element in each sliding window of size k

Find the smallest substring that contains all characters of a given pattern

Sort characters in string by frequency using heap or bucket sort

Calculate the span of stock prices for each day

Schedule tasks with cooling period using greedy approach with heap

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

Determine if the input string has valid brackets that are properly opened and closed

Traverse a binary tree vertically and return nodes by columns

Find the shortest transformation sequence from beginWord to endWord using single character changes

Traverse a binary tree level by level in zigzag order