Repeated Deletion Sequel - Amazon Top Interview Questions


Problem Statement :


Given a string s and an integer k, repeatedly delete the earliest k consecutive duplicate characters.

Constraints

k, n ≤ 100,000 where n is the length of s.

Example 1

Input

s = "baaabbdddd"

k = 3

Output

"d"

Explanation

First we delete the "a"s to get "bbbdddd". Then we delete the "b"s to get "dddd". Then we delete three of 
the four "d"s to get "d"



Solution :



title-img




                        Solution in C++ :

string solve(string s, int k) {
    if (k == 1) return "";
    vector<pair<int, char>> stack{{0, '#'}};

    for (auto &c : s) {
        if (stack.back().second != c) {
            stack.push_back({1, c});
        } else if (++stack.back().first == k) {
            stack.pop_back();
        }
    }

    string result = "";

    for (int i = 1; i < stack.size(); i++) {
        for (int j = 0; j < stack[i].first; j++) {
            result += stack[i].second;
        }
    }

    return result;
}
                    


                        Solution in Java :

import java.util.*;
class pair { // created  a class pair to store char and its count.
    char val;
    int num;
    pair(char val, int num) {
        this.val = val;
        this.num = num;
    }
}
class Solution {
    public String solve(String s, int k) {
        Stack<pair> st = new Stack<>(); // stack which has pair as attribute.

        for (int i = 0; i < s.length(); i++) {
            if (st.isEmpty()) { // check if stack is empty then simply push with count 1.
                st.push(new pair(s.charAt(i), 1));
            } else if (s.charAt(i)
                == st.peek().val) { // check if incoming value is equal to peak value or not.
                st.push(new pair(s.charAt(i), st.peek().num + 1));
                // if its equal to stack top value, we'll insert this into stack with count 1+ of
                // peek.
            } else {
                st.push(new pair(
                    s.charAt(i), 1)); // last entered char was different so simply push with 1.
            }
            if (st.peek().num == k) { // if we arrive to that point where top value count = k.
                int x = st.peek().num;
                while (x > 0) { // we will pop all k values from stack.
                    st.pop();
                    x--;
                }
            }
        }
        String fin = ""; // answer string.
        while (st.size() > 0) { // while we dont get empty stack.
            fin = st.pop().val + fin;
        }
        return fin;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, s, k):
        stack = []

        for c in s:
            if stack and c == stack[-1][0]:
                stack[-1][1] += 1
            else:
                stack.append([c, 1])

            if stack[-1][1] == k:
                stack.pop()

        return "".join([x * f for x, f in stack])
                    


View More Similar Problems

Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

View Solution →

Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →

Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →

Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →

Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →