Subscribe to Code to Architecture’s news feed.
Click on “Follow” and decide if you want to get news from Code to Architecture via RSS, as email newsletter, via mobile or on your personal news page.
Subscription to Code to Architecture comes without risk as you can unsubscribe instantly at any time.
You can also filter the feed to your needs via topics and keywords so that you only receive the news from Code to Architecture which you are really interested in. Click on the blue “Filter” button below to get started.
Title: Code to Architecture
Meet in the middle is the exponential-search optimization pattern for splitting a hard search space into two smaller halves. Strong candidates explain the exponent trade clearly: 2^n is too large, but 2^(n/2) on two halves plus a smart merge step is often tractable.
Interview lens
A strong explanation should name the invariant, the safe transition, and the cond...
Rolling hash is the string and sequence pattern for updating a window fingerprint in O(1) as the window slides. Strong candidates explain exactly what leaves the hash, what enters, and why collision risk means hashes are usually verification tools, not absolute truth.
Interview lens
A strong explanation should name the invariant, the safe transition, and the co...
Manacher’s algorithm is the palindrome pattern for computing longest palindromic spans around every center in linear time. Strong candidates explain the transformed-string trick and the current palindrome window, because those are what eliminate repeated center expansion.
Interview lens
A strong explanation should name the invariant, the safe transition, and th...
The Z algorithm is the string-matching pattern for reusing previously known match intervals against the full string prefix. Strong candidates explain the [L, R] box invariant clearly, because that is what turns repeated character comparisons into a linear scan.
Interview lens
A strong explanation should name the invariant, the safe transition, and the condition...
Rabin-Karp is the rolling-hash string-matching pattern for comparing many same-length substrings quickly. Strong candidates emphasize that the hash is a fast filter, not a proof by itself, and they explain collision handling explicitly.
Interview lens
A strong explanation should name the invariant, the safe transition, and the condition that makes this pattern ...