Longest Unequal Adjacent Groups Subsequence I You are given a string array words and a binary array groups both of length n. A subsequence of words is alternating if for any two consecutive stri...

Total Characters in String After Transformations II You are given a string s consisting of lowercase English letters, an integer t representing the number of transformations to perform, and an ar...

Total Characters in String After Transformations I You are given a string s and an integer t, representing the number of transformations to perform. In one transformation, every character in s is...

Three Consecutive Odds Given an integer array arr, return true if there are three consecutive odd numbers in the array. Otherwise, return false.   Example 1: **Input:** arr = [2,6,4,1] **Output...

Minimum Equal Sum of Two Arrays After Replacing Zeros You are given two arrays nums1 and nums2 consisting of positive integers. You have to replace all the 0’s in both arrays with strictly posit...

Count Number of Balanced Permutations You are given a string num. A string of digits is called **balanced **if the sum of the digits at even indices is equal to the sum of the digits at odd indic...

Find Minimum Time to Reach Last Room II There is a dungeon with n x m rooms arranged as a grid. You are given a 2D array moveTime of size n x m, where moveTime[i][j] represents the minimum time ...

Find Minimum Time to Reach Last Room I There is a dungeon with n x m rooms arranged as a grid. You are given a 2D array moveTime of size n x m, where moveTime[i][j] represents the minimum time i...

Domino and Tromino Tiling You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes. Given an integer n, return the number of ways to tile an 2 x n boa...

Number of Equivalent Domino Pairs Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a == c and b == d), or (a == d and b == c) - that is,...