Maximal Points From Deleting Two Character Substrings- Google Top Interview Questions
Problem Statement :
You are given a string s containing "1"s and "0"s and integers zeroone and onezero. In one operation you can remove any substring "01" and receive zeroone points. Or you can remove any substring "10" and receive onezero points. Return the maximum number of points you can receive, given that you can make any number of operations. Constraints n ≤ 100,000 where n is the length of s Example 1 Input s = "101010" zeroone = 3 onezero = 1 Output 7 Explanation We can delete "01" twice to receive 3 points each. The resulting string then becomes "10" and then you can delete it to receive 1 point.
Solution :
Solution in C++ :
int solve(string s, int zeroone, int onezero) {
bool flag = 0;
if (zeroone > onezero) flag = 1;
stack<char> st;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (st.empty()) {
st.push(s[i]);
continue;
}
if (s[i] == '0' && st.top() == '1' && !flag) {
ans += onezero;
st.pop();
} else if (s[i] == '1' && st.top() == '0' && flag) {
ans += zeroone;
st.pop();
} else
st.push(s[i]);
}
int one = 0, zero = 0;
while (!st.empty()) {
if (st.top() == '0') zero++;
if (st.top() == '1') one++;
st.pop();
}
if (flag)
ans += (onezero * min(zero, one));
else
ans += (zeroone * min(zero, one));
return ans;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(String s, int A, int B) {
int N = s.length();
int[] nums = new int[N];
int X = 0;
for (int i = 0; i < N; i++) {
nums[i] = s.charAt(i) - '0';
if (nums[i] == 0)
X++;
}
X = Math.min(X, N - X);
if (A < B) {
int temp = A;
A = B;
B = temp;
for (int i = 0; i < N; i++) {
nums[i] = 1 - nums[i];
}
}
int zero = 0;
int get = 0;
for (int i = 0; i < N; i++) {
if (nums[i] == 0) {
zero++;
} else {
if (zero > 0) {
zero--;
get++;
}
}
}
int ans = get * A + (X - get) * B;
return ans;
}
}
Solution in Python :
class Solution:
def solve(self, S, pts01, pts10):
A = list(map(int, S))
if pts01 < pts10:
pts01, pts10 = pts10, pts01
for i in range(len(A)):
A[i] ^= 1
ans = 0
stack = []
for x in A:
if stack and stack[-1] < x:
stack.pop()
ans += pts01
else:
stack.append(x)
ans += pts10 * min(stack.count(0), stack.count(1))
return ans
View More Similar Problems
2D Array-DS
Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t
View Solution →Dynamic Array
Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.
View Solution →Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →Print the Elements of a Linked List
This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode
View Solution →