This question is asked by Apple. You are serving people in a lunch line and need to ensure each person gets a "balanced" meal. A balanced meal is a meal where there exists the same number of food items as drink items. Someone is helping you prepare the meals and hands you food items (i.e. F) or a drink items (D) in the order specified by the items string. Return the maximum number of balanced meals you are able to create without being able to modify items.
This question is asked by Amazon. Given two strings, passage and text, return whether or not the characters in text can be used to form the given passage.
This question is asked by Microsoft. Given a message that is encoded using the following encryption method:
This question is asked by Amazon. Given a valid IP address, defang it.
This question is asked by Google. Given two strings s and t, return the minimum number of operations needed to convert s into t where a single operation consists of inserting a character, deleting a character, or replacing a character.
Given two strings s and t, return the index of the first occurrence of t within s if it exists; otherwise, return -1.
This question is asked by Facebook. Given an integer N, where N represents the number of pairs of parentheses (i.e. "(" and ")") you are given, return a list containing all possible well-formed parentheses you can create.
This question is asked by Microsoft. Implement a trie class that supports insertion and search functionalities.
This question is asked by Google. Given two strings s and t, return whether or not s is a subsequence of t.
Given a list of words, return all the words that require only a single row of a keyboard to type.
Given a string s, return the length of the last word.
This question is asked by Amazon. Given a string s consisting of only letters and digits, where we are allowed to transform any letter to uppercase or lowercase, return a list containing all possible permutations of the string.
This question is asked by Google. Given a string of digits, return all possible text messages those digits could send.
This question is asked by Google. Given two strings, s and t, return the length of their longest subsequence.
Given a string s, return the length of the longest substring containing at most two distinct characters.
Given a string s, return the length of the longest substring that contains only unique characters.
Given an array of words, return the length of the longest phrase, containing only unique characters, that you can form by combining the given words together.
Given a string s, return true if it is a palindrome, and false otherwise. Ignore non-alphanumeric characters and case.
This question is asked by Google. Given a string s, return all possible partitions of s such that each substring is a palindrome.
Given a string s containing only lowercase characters, return a list of integers representing the size of each substring you can create such that each character in s only appears in one substring.
Given a string s, remove the minimum number of parentheses to make s valid. Return all possible results.
This question is asked by Amazon. Given a string s, remove all the vowels it contains and return the resulting string.
This question is asked by Facebook. Given a string, check if it can be modified such that no two adjacent characters are the same. If it is possible, return any string that satisfies this condition and if it is not possible return an empty string.
Given a string s, return all of its repeated 10 character substrings.
This question is asked by Facebook. Given a string, reverse the vowels of it.
Given a string s, reverse the words.
Given a string s and a character c, return an array of integers where each index is the shortest distance from the character at that position to the nearest occurrence of c in the string.
This question is asked by Facebook. Given a character array, compress it in place and return the new length of the array.
Given a list of words, return the top k frequently occurring words.
This question is asked by Amazon. Given a string s and a list of words representing a dictionary, return whether or not the entirety of s can be segmented into dictionary words.
Given a string s and a string code, return whether or not s could have been encrypted using the pattern represented in code.