SWE Prep

Your guide for nailing the technical interview

New Top What is SWE Prep?About

Lessons Learned: HashMaps

Apr 23

Question: Invert a binary tree. Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9 6 3 1 Solution Approach 1: Recursive The inverse of an emp…

Apr 14

Alice and Bob take turns playing a game, with Alice starting first. Initially, there is a number N on the chalkboard. On each player's turn, that playe…

Apr 7

Question: Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. Solution Approach 1: Hash Table W…

Mar 31

Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i]. After this process, we have some array B.…

Mar 24

Lessons Learned: TreeSet, Array Manipulation

Mar 7

Question: Implement an algorithm to print all valid (properly opened and closed) combinations of n pairs of parentheses.

Feb 28

SWE Prep

What is SWE Prep?Archive Authors My Account

#nojs-banner { position: fixed; bottom: 0; left: 0; padding: 16px 16px 16px 32px; width: 100%; box-sizing: border-box; background: red; color: white; font-family: -apple-system, "Segoe UI", Roboto, Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol"; font-size: 13px; line-height: 13px; } #nojs-banner a { color: inherit; text-decoration: underline; } This site requires JavaScript to run correctly. Please turn on JavaScript or unblock scripts