CRED SDE-1 OA 2024 | No Pairs Allowed & Merchant Settlement Clusters

Problem 1 - No Pairs Allowed Problem Statement You are given an array of strings representing inventory codes. For each string, determine the minimum number of character substitutions required so that no two adjacent characters are identical. When performing a substitution, you may replace a character with any lowercase English letter. Return an array where each element represents the minimum substitutions required for the corresponding string. Constraints Constraint 1 ≤ Number of Strings ≤ 105 1 ≤ Length of Each ...