Initial solution, which was off. Mostly prototyping around incomplete idea.

First attempt, getting closer, but still didn't see key to unlock solving the problem.

Note: Close but incorrect

Really close, but too slow.

Version 2: Bottom-up approach using MaxInt32 for min comparison

Version 1: Top-down approach using recursion

Initial solution, which failed to recognize that the removal order isn't necessarily a part of the start sorted sequence.

Second solution, which is correct but time limit exceeded.

This approach is slow (exponential runtime). It works, but times out on leetcode. We can do better.

This approach is also slow (O(2^n) runtime. It works, but times out on leetcode. We can do better.

Note: Wrong approach. Good lessons though!

Second solution based on sorting the strings

Note: good attempt with 152 / 154 test cases passed. This got messy. Tried to merge newInterval into intervals. Can do better!

Based on in-order traversal being a palindrome. Wrong approach but good lesson on array appending in recursive function.

Note: study again.

Note: first attempt that passed test cases in description examples. Isn't correct in all cases.

First, O(n^2) solution.

First solution

Note: original solution with array shifting

Note: solution from rotate_string_796 interview that stumped me for a bit. Wanted to solve without shifting and was tricky.

Initial solution. Pretty close, but overly complicated and assumed that duplicates of t were not allowed, meaning the substring of s must have exactly

Reverses the passed list without creating a new list by prepending front nodes to the end.

Note: original solution from mock interview. I learned how to reverse string in place by using []rune or []byte. Having to reverse by string concatena

Note: Study again

Note: this was accepted into leetcode and uses O(1) space. There is a different solution that was hinted at that works better with ALL input. This alg

twoSumSortedInput assumes that nums is sorted.