Half Monotonous String - Google Top Interview Questions
Problem Statement :
You are given a lowercase alphabet string s of even length consisting of lowercase alphabet letters. Return the minimum number of characters that need to be updated such that one of the following three conditions is true for all 0 ≤ i < n/2 and n/2 ≤ j < n: s[i] > s[j] or s[i] < s[j] or s[i] == s[j] Constraints 0 ≤ n ≤ 100,000 where n is the length of s Example 1 Input s = "aa" Output 0 Explanation This string already meets the s[i] == s[j] condition Example 2 Input s = "aaabba" Output 1 Explanation If we change the last "a" to "b", then we can satisfy the s[i] < s[j] condition. Example 3 Input s = "bccbba" Output 1 Explanation If we change the first "b" to "c", then we can satisfy the s[i] > s[j] condition.
Solution :
Solution in C++ :
int solve(string s) {
int len = s.length(), maxCnt = 0;
vector<int> cnt(26, 0);
for (int i = 0; i < len; i++) {
cnt[s[i] - 'a']++;
maxCnt = max(maxCnt, cnt[s[i] - 'a']);
}
int res = len - maxCnt;
for (char ch = 'b'; ch < 'z'; ch++) {
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0;
for (int i = 0; i < len / 2; i++) {
if (s[i] >= ch) {
cnt1++;
} else if (s[i] <= ch - 1) {
cnt2++;
}
}
for (int i = len / 2; i < len; i++) {
if (s[i] >= ch) {
cnt3++;
}
if (s[i] <= ch - 1) {
cnt4++;
}
}
res = min({res, cnt1 + cnt4, cnt2 + cnt3});
}
return res;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(String s) {
int N = s.length();
int[] A = new int[26];
int[] B = new int[26];
for (int i = 0; i < N; i++) {
int c = s.charAt(i) - 'a';
if (i < N / 2)
A[c] += 1;
else
B[c] += 1;
}
int ans = Integer.MAX_VALUE;
// fix all characters in A to be greater than i and all the characters in B to be less than
// or equal to i.
for (int i = 0; i < 26; i++) {
int fix = 0;
for (int j = 0; j <= i; j++) fix += A[j];
for (int j = i + 1; j < 26; j++) fix += B[j];
ans = Math.min(ans, fix);
}
// fix all characters in A to be less than i and all the characters in B to be greater than
// or equal to i.
for (int i = 0; i < 26; i++) {
int fix = 0;
for (int j = i; j < 26; j++) fix += A[j];
for (int j = 0; j < i; j++) fix += B[j];
ans = Math.min(ans, fix);
}
// fix all characters in A and B to equal i.
for (int i = 0; i < 26; i++) {
int fix = N - (A[i] + B[i]);
ans = Math.min(ans, fix);
}
return ans;
}
}
Solution in Python :
class Solution:
def solve(self, s):
n = len(s)
left = Counter(s[: n >> 1])
right = Counter(s[n >> 1 :])
ans = n
for pivot in ascii_lowercase:
# All same
ans = min(ans, n - left[pivot] - right[pivot])
# left <= pivot < right
good = sum(left[c] for c in left if c <= pivot)
good += sum(right[c] for c in right if c > pivot)
ans = min(ans, n - good)
# right <= pivot < left
good = sum(left[c] for c in left if c > pivot)
good += sum(right[c] for c in right if c <= pivot)
ans = min(ans, n - good)
return ans
View More Similar Problems
Print in Reverse
Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing
View Solution →Reverse a linked list
Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio
View Solution →Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →