Learn and practice the In-place Manipulation of a Linked List, Stacks, and Matrices patterns to solve coding interview problems.

Speedrun the Oracle Coding Interview: Top Problems in C++

Interviewers want to be sure that the candidate is comfortable manipulating linked lists, arrays, and data structures based on them, such as stacks and matrices. This module will provide the practice you need to review the concepts and techniques needed to solve common problems involving these data structures.

Basic Data Structures

# Statement
You are given a string consisting of lowercase English letters. Repeatedly remove adjacent duplicate letters, one pair at a time. Both members of a pair of adjacent duplicate letters need to be removed.

**Constraints:**
* $1 \leq$ `string.length` $\leq 10^3$
* `string` consists of lowercase English alphabets.

# Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

What will be the output after removing all adjacent duplicates from the string given below?

string = "azxxzy"

What will be the output after removing all adjacent duplicates from the string given below?
string = “azxxzy”

What will be the output after removing all adjacent duplicates from the string given below?

string = "abcde"

What will be the output after removing all adjacent duplicates from the string given below?
string = “abcde”

What will be the output after removing all adjacent duplicates from the string given below?

string = "aabbccdd"

What will be the output after removing all adjacent duplicates from the string given below?
string = “aabbccdd”

Remove All Adjacent Duplicates In String

Remove All Adjacent Duplicates In String


# Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

# Try it yourself
Implement your solution in the following coding playground. 


# Quick Fix\nYou are Edward, a Senior Software Engineer who specializes in coding interview patterns, data structures and algorithms, and is great at debugging issues in code.\n\n- Edward, please keep in mind that you do not have to print the data of the placeholders. Also, do not mention anything about yourself.\n\nEdward, you are given the following data in the placeholders:\n- Function name: `RemoveDuplicates`\n- Candidate's submitted solution code: USER_CODE\n- Error: ERROR_DESCRIPTION\n- Failed test case: FAILED_TEST_CASE\n- Coding language: `C++`\n\n- Edward, your task is to understand the type of error that is occurring in the coding language provided.\n- Once you've understood the error as per the error’s description, and why the test case failed, you will suggest how the candidate can improve their solution code to fix the error.\n- Edward, you will not give the corrected code, just a hint on what the error tells, and how to fix it.\n- Edward, please limit your response strictly to 100 words. No more words than the limit.

# Review Code\nEdward, your current task is to review the `RemoveDuplicates` function(s) and the other function(s) invoked in it/them.\n\n-Take your time and review the candidate's solution code.\n- Do not review any extra/helper files or functions not invoked in the solution function `RemoveDuplicates`.\n- Do not review the code of data structure objects instantiated like a binary tree, linked list, trie, union find, etc., in the solution functions. Just review the solution/algorithm function of the problem. \n- Also, if the solution code doesn’t use the coding pattern stated above, then please encourage the candidate to reattempt the problem using that pattern corectly.

# Review time complexity\n- Please provide a brief time complexity analysis of the function(s) `RemoveDuplicates`. \n- While calculating time complexity, include the time complexity of built-in C++ functions invoked by the code. \n- The answer should be to the point in approximately 60 words.

# Review space complexity\n- Please provide a brief space complexity analysis of the function(s) `RemoveDuplicates`. \n- While calculating space complexity, include the space complexity of built-in C++ functions invoked by the code. \n- Do not include the space used for the input parameters and the space used for just returning an output (not used as a scratch space). \n- The answer should be to the point in approximately 60 words.

def evaluate_results(self) -> object:
        """
        self.__inputs is the list of inputs that are passed as input to function
        self.__actual_output is a list of outputs that is produced by the learner's code
        return : self.__edu__result object
        """
        # multiple outputs will be added at each index respectively for a single test_case

        def remove_duplicates(string):

            stack = []
            for char in string:
                if stack and stack[-1] == char:
                    stack.pop()
                else:
                    stack.append(char)
            
            return "".join(stack)





        expected_outputs = [] 
        # store the 1st expected output that should be displayed to the user 
        expected_outputs.append(remove_duplicates(self.__inputs[0]))

        if json.dumps(remove_duplicates(self.__inputs[0])) == json.dumps(self.__actual_outputs[0]):
            self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
        else:
            self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

        return self.__edu_result






string RemoveDuplicates(string s) {
    
    // Replace this placeholder return statement with your code
    return "";
}

remove_adjacent_duplicates_in_a_string (1)_append.yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1 : "g"
    output: 
    - 1 : "g"
  - name: "testcase 2"
    inputs:
    - 1: "ggaabcdeb"
    output:
    - 1 : "bcdeb"
  - name: "testcase 3"
    inputs:
    - 1: "abbddaccaaabcd"
    output:
    - 1 : "abcd"
  - name: "testcase 4"
    inputs:
    - 1: "aabbccdd"
    output:
    - 1 : ""
  - name: "testcase 5"
    inputs:
    - 1: "aannkwwwkkkwna"
    output:
    - 1 : "kwkwna"


def sum(input_1, input_2):
    return input_1+input_2

def validate_inputs(self) -> None:
 """
 self.__inputs is the list of inputs that are passed as input to function
 store the result using the self.store_result(error_msg, status)
 return : void
 """
 from string import ascii_lowercase
 # inputs can be accessed using self.__inputs starting from 0 to len(self.__inputs) - 1
 strings=self.__inputs[0]

 if not (1 <= len(strings) <= 10**3):
 self.store_result ("Length of 'string' should be between 1 and 10^3", ValidationFunction.FAIL)

 
 elif not all(x in ascii_lowercase for x in strings):
 self.store_result("'string' should contain only lowercase english alphabet", ValidationFunction.FAIL)

 else:
 self.store_result("", ValidationFunction.PASS)

Try to solve the Remove All Adjacent Duplicates In String problem.

In-place Manipulation of a Linked List

Stacks

Matrices

Conclusion

Remove All Adjacent Duplicates In String

Statement

Understand the problem

Figure it out!

Try it yourself