CRED Off-Campus OA | No Pairs Allowed, Optimal Digit String Concatenation & Connected Drops

Problem 1 - No Pairs Allowed Problem Statement You are given an array of strings representing candidate passwords. A password is considered valid if it does not contain two identical consecutive characters. In one operation, you may replace any character in the string with any lowercase English letter. For each password, determine the minimum number of substitutions required to make the string valid. Input Format A list of strings words Output Format Return an array where the i-th element represents ...