<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://scorego.github.io/</id><title>Evan Wang</title><subtitle>A blog of a software development engineer.</subtitle> <updated>2026-02-04T04:38:53-08:00</updated> <author> <name>Evan Wang</name> <uri>https://scorego.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://scorego.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://scorego.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 Evan Wang </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Binary Search Pattern in Coding Interviews</title><link href="https://scorego.github.io/posts/binary-search-pattern-in-coding-interviews/" rel="alternate" type="text/html" title="Binary Search Pattern in Coding Interviews" /><published>2026-01-30T01:00:00-08:00</published> <updated>2026-02-04T04:38:21-08:00</updated> <id>https://scorego.github.io/posts/binary-search-pattern-in-coding-interviews/</id> <content type="text/html" src="https://scorego.github.io/posts/binary-search-pattern-in-coding-interviews/" /> <author> <name>Evan Wang</name> </author> <category term="Algorithms" /> <summary>“Although the basic idea of binary search is comparatively straightforward, the details can be surprisingly tricky.” — Donald E. Knuth, The Art of Computer Programming If you’ve ever prepared for a coding interview, you’ve definitely encountered Binary Search (also known as half-interval search, logarithmic search, or binary chop). We all know the classic version: Problem: return the index...</summary> </entry> </feed>
