SWE Prep
Your guide for nailing the technical interview
Share
NewTopWhat is SWE Prep?AboutAbout
Lessons Learned: HashMaps
Share
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…
Share
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 player…
Share
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 We…
Share
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…
Share
Lessons Learned: TreeSet, Array Manipulation
Share
Question: Implement an algorithm to print all valid (properly opened and closed) combinations of n pairs of parentheses. 
Share
See all

SWE Prep


What is SWE Prep?ArchiveAuthorsMy Account
© 2022 Sameer Khoja. See privacy, terms and information collection notice
Publish on Substack
SWE Prep is on Substack – the place for independent writing