Coding
1 sections, 9 questions
Given two strings, find the length of the longest common subsequence which contains only vowels.
Example:
Input: input1 = "vowelpunish", input2 = "english"
Output: 2
Input: input1 = "prepinsta", input2 = "prepare"
Output: 2
Given N tokens arranged in a line with numbers written on them, find the length of the longest decreasing subsequence.
Example:
Input: n = 5, A = [5, 0, 3, 2, 9]
Output: 3
Explanation: The longest decreasing subsequence is [5, 3, 2]
Input: n = 9, A = [15, 27, 14, 38, 63, 55, 46, 65, 85]
Output: 3
Explanation: The longest decreasing subsequence is [63, 55, 46]
Maxwell filled his exam form with subject marks swapped by mistake. He wants to update his marks, but must pay a penalty equal to the sum of absolute differences between adjacent subject marks. Return the minimum penalty.
Example:
Input: arr = [5, 10, 1, 4, 8, 7]
Output: 9
Input: arr = [12, 10, 15, 22, 21, 20, 1, 8, 9]
Output: 18
Given an array, find the maximum difference between two elements such that the larger element appears after the smaller one.
Example:
Input: arr = [2, 3, 10, 6, 4, 8, 1]
Output: 8
Explanation: The maximum difference is between 10 and 2.
Input: arr = [7, 9, 5, 6, 3, 2]
Output: 2
Explanation: The maximum difference is between 9 and 7.
Given an array of integers (equal number of odd and even values), arrange them so odd and even values alternate in non-decreasing order. If the smallest value is even, print Even-Odd pattern; if odd, print Odd-Even pattern.
Example:
Input: arr = [1, 3, 2, 5, 4, 7, 10]
Output: 1, 2, 3, 4, 5, 10, 7
Explanation: Smallest value is 1 (odd), so output follows Odd-Even pattern.
Input: arr = [9, 8, 13, 2, 19, 14]
Output: 2, 9, 8, 13, 14, 19
Explanation: Smallest value is 2 (even), so output follows Even-Odd pattern.
Children sit in a line, each with a rating. Every child gets at least 1 candy. If two children sit next to each other, the one with the higher rating must get more candies. Minimize the total candies distributed.
Example:
Sample Input 0: ratings = [1, 2, 2]
Sample Output 0: 4
Explanation: Distribution [1, 2, 1] satisfies all constraints with minimum candies.
Sample Input 2: ratings = [2, 4, 3, 5, 2, 6, 4, 5, 2]
Sample Output 2: 12
Given a string, find the minimum number of adjacent swaps required to make it a palindrome. If not possible, return -1.
Example:
Input: "aabcb"
Output: 3
Explanation: After 1st swap: abacb, After 2nd swap: abcab, After 3rd swap: abcba
Input: "adbcdbad"
Output: -1
Given a string and a character x, remove all occurrences of x from the string.
Example:
Input: input1 = "Prepinsta", input2 = "i"
Output: "Prepnsta"
Explanation: All occurrences of 'i' are removed, keeping other characters.
Encryption replaces each letter with the letter 3 positions to the left (e.g., 'a' → 'x', 'd' → 'a'). Given an encrypted string, find the corresponding plaintext.
Example:
Input: "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
Output: "XYZABCDEFGHIJKLMNOPQRSTUVW"
Input: "ATTACKATONCE"
Output: "EXXEGOEXSRGI"