Adobe Interview Questions

A special binary string has equal numbers of 0s and 1s, and any prefix has at least as many 1s as 0s. You need to recursively make the lexicographically largest special string possible from a given special binary string.

You are given a matrix and a series of update operations. Each operation specifies a submatrix that should have all its elements incremented by one. Your goal is to perform all the updates and return the modified matrix.

Convert a string into a 32-bit signed integer. Handle leading whitespace, signs, invalid input, and integer overflow according to the rules of the atoi function.

The N-Queens problem asks you to place N chess queens on an N×N chessboard so that no two queens threaten each other. Your task is to find all possible distinct solutions for placing the queens.

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

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 all unique triplets in an array that sum to zero. You'll need to consider the potential for duplicate numbers and avoid duplicate triplets in your solution.

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

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

Write a function that returns the string 'Hello, World!'. This is a classic first coding challenge.

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

You are given two sorted integer arrays. Merge the second array into the first one, maintaining the sorted order.

Find the element that appears more than n/2 times in a given array of size n. Essentially, you need to identify the majority element.

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

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

You are climbing a staircase with n steps. Find how many distinct ways you can climb to the top, given that you can climb one or two steps at a time.

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

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.