SWE Prep

Your guide for nailing the technical interview

New Top What is SWE Prep?About

Lessons Learned: Array parsing

Feb 21

The problem: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end.

Feb 14

Lessons learned: DFS

Feb 4

Question: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary wo…

Jan 27

👋 Hello! I’m gathering feedback on SWE Prep. If you like to provide suggestions or feedback, let us know on this survey here! Question: Given a string…

Jan 22

Lesson: Array Manipulation

Jan 14

👋 Hello! I want to take a second and thank all of you for subscribing to SWE Prep! It has been so great making articles for you all - I hope they were…

Jan 13

SWE Prep

What is SWE Prep?Archive 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