Learn and practice the Sliding Window, and Union Find patterns to solve coding interview problems.

Speedrun the Microsoft Coding Interview: Top Problems in Python

Each pattern in this module exemplifies the power of dissecting a problem in detail and figuring out the least expensive operations required to solve it. In the Sliding Window pattern, we’ll gain practice in various techniques to ensure that a solution that seems to require nested loops actually executes in linear time. Using the Union Find pattern, we’ll learn to solve a diverse set of problems using the disjoint-set data structure.

Elegant by Design

# Statement

Given a string, `input_str`, return the length of the longest substring without repeating characters.

**Constraints:**

* $1$ $\leq$ `input_str.length` $\leq 10^5$
* `input_str` consists of English letters, digits, and spaces.




# Examples


What should be the output if the following string is given as an input?


str = "conceptoftheday"


What should be the output if the following string is given as an input?
str = “conceptoftheday”

What should be the output if the following string is given as an input?


str = "bbbbbbbbbbbbbbbb"



What should be the output if the following string is given as an input?
str = “bbbbbbbbbbbbbbbb”

What should be the output if the following string is given as an input?

str = "racecar"


What should be the output if the following string is given as an input?
str = “racecar”

What should be the output if the following string is given as an input?


str = "bankrupted"



What should be the output if the following string is given as an input?
str = “bankrupted”

Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

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


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: `find_longest_substring`\n- Candidate's submitted solution code: USER_CODE\n- Error: ERROR_DESCRIPTION\n- Failed test case: FAILED_TEST_CASE\n- Coding language: `Python`\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 `find_longest_substring` 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 `find_longest_substring`.\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) `find_longest_substring`. \n- While calculating time complexity, include the time complexity of built-in Python 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) `find_longest_substring`. \n- While calculating space complexity, include the space complexity of built-in Python 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
 """
 def find_longest_substring_eval(input_str):
 if len(input_str) == 0:
 return 0

 window_start, longest, window_length = 0, 0, 0

 last_seen_at = {}

 for index, val in enumerate(input_str):
 if val not in last_seen_at:
 last_seen_at[val] = index
 else:
 if last_seen_at[val] >= window_start:
 window_length = index - window_start
 if longest < window_length:
 longest = window_length
 window_start = last_seen_at[val] + 1

 last_seen_at[val] = index

 index += 1

 if longest < index - window_start:
 longest = index - window_start

 return longest

 
 # Expected output
 expected = find_longest_substring_eval(self.__inputs[0])

 # Actual output
 actual = self.__actual_outputs[0]

 # multiple outputs will be added at each index respectively for a single test_case
 expected_outputs = [] 

 # store the 1st expected output that should be displayed to the user 
 expected_outputs.append(expected)

 if json.dumps(expected) == json.dumps(actual):
 self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
 else:
 self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

 return self.__edu_result

def find_longest_substring(input_str):

   # Replace this placeholder return statement with your code
   return -1

PrivateTestCases (3).yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1: "abcdbea"
    output: 
    - 1: 0
  - name: "testcase 2"
    inputs:
    - 1: "aba"
    output:
    - 1 : 2
  - name: "testcase 3"
    inputs:
    - 1: "abccabcabcc"
    output:
    - 1: 3
  - name: "testcase 4"
    inputs:
    - 1: "aaaabaaa"
    output:
    - 1: 2
  - name: "testcase 5"
    inputs:
    - 1: "bbbbb"
    output:
    - 1: 1

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
 """
 input_str = self.__inputs[0]
 lower_bound = 1
 upper_bound = 10**5

 # inputs can be accessed using self.__inputs starting from 0 to len(self.__inputs) - 1
 if len(input_str) < lower_bound or len(input_str) > upper_bound:
 self.store_result ("expected 'input_str' to have " + str(lower_bound) + " <= size <= " + str(upper_bound) + " but got " + str(len(input_str)) , ValidationFunction.FAIL)

 else:
 self.store_result("", ValidationFunction.PASS)

Try to solve the Longest Substring without Repeating Characters problem.


Longest Substring without Repeating Characters

Try to solve the Longest Substring without Repeating Characters problem.

Sliding Window

Union Find

Conclusion

Longest Substring without Repeating Characters

Statement

Examples

Understand the problem

Figure it out!

Try it yourself