<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Bad Cat on Medium]]></title>
        <description><![CDATA[Stories by Bad Cat on Medium]]></description>
        <link>https://medium.com/@badcat410?source=rss-6b3ffd136ffd------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*Dai61Om7AxhSogsv.jpg</url>
            <title>Stories by Bad Cat on Medium</title>
            <link>https://medium.com/@badcat410?source=rss-6b3ffd136ffd------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 16:23:04 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@badcat410/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Byte Me: Surviving My First Year in the TikTok Hive as Engineering Manager (4)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-4-394d77173bc9?source=rss-6b3ffd136ffd------2"><img src="https://cdn-images-1.medium.com/max/2600/1*WCRkOsstoz94BqCAoVZxuQ.jpeg" width="3072"></a></p><p class="medium-feed-snippet">Missed the earlier episodes of this workplace dramedy?</p><p class="medium-feed-link"><a href="https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-4-394d77173bc9?source=rss-6b3ffd136ffd------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-4-394d77173bc9?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/394d77173bc9</guid>
            <category><![CDATA[engineering]]></category>
            <category><![CDATA[tıktok]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[tiktok-app]]></category>
            <category><![CDATA[ti̇ktok]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Sat, 14 Jun 2025 07:34:21 GMT</pubDate>
            <atom:updated>2025-06-14T07:35:42.003Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Byte Me: Surviving My First Year in the TikTok Hive as Engineering Manager (3)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">Previously in the Byte Me Cinematic Universe&#x2122;&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-3-55cb5dca0b18?source=rss-6b3ffd136ffd------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-3-55cb5dca0b18?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/55cb5dca0b18</guid>
            <category><![CDATA[tiktok-app]]></category>
            <category><![CDATA[tik-tok]]></category>
            <category><![CDATA[ti̇ktok]]></category>
            <category><![CDATA[tıktok]]></category>
            <category><![CDATA[engineering]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Sat, 07 Jun 2025 05:55:12 GMT</pubDate>
            <atom:updated>2025-06-07T05:55:12.165Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Byte Me: Surviving My First Year in the TikTok Hive as Engineering Manager (2)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">Missed the prequel? Click here to pretend you didn&#x2019;t: Byte Me: Surviving My First Year in the TikTok Hive as Engineering Manager (1)</p><p class="medium-feed-link"><a href="https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-2-619f33c5275f?source=rss-6b3ffd136ffd------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-2-619f33c5275f?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/619f33c5275f</guid>
            <category><![CDATA[ti̇ktok]]></category>
            <category><![CDATA[tıktok]]></category>
            <category><![CDATA[company-culture]]></category>
            <category><![CDATA[engineering]]></category>
            <category><![CDATA[tiktok-app]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Mon, 26 May 2025 07:40:11 GMT</pubDate>
            <atom:updated>2025-05-26T07:40:11.357Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Byte Me: Surviving My First Year in the TikTok Hive as Engineering Manager]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">Day 1: Welcome to the Circus</p><p class="medium-feed-link"><a href="https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-79488d62d87f?source=rss-6b3ffd136ffd------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@badcat410/byte-me-surviving-my-first-year-in-the-tiktok-hive-as-engineering-manager-79488d62d87f?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/79488d62d87f</guid>
            <category><![CDATA[ti̇ktok]]></category>
            <category><![CDATA[bytedancetiktok]]></category>
            <category><![CDATA[engineering-management]]></category>
            <category><![CDATA[bytedance]]></category>
            <category><![CDATA[software-engineering]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Sat, 24 May 2025 07:38:27 GMT</pubDate>
            <atom:updated>2025-05-24T17:30:12.817Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Stories of Mount St. Helens]]></title>
            <link>https://medium.com/@badcat410/stories-of-mount-st-helens-1fecbe562364?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/1fecbe562364</guid>
            <category><![CDATA[volcano]]></category>
            <category><![CDATA[mt-st-helens]]></category>
            <category><![CDATA[st-helens]]></category>
            <category><![CDATA[ｍountain]]></category>
            <category><![CDATA[mount-st-helens]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Wed, 21 May 2025 05:30:45 GMT</pubDate>
            <atom:updated>2025-05-21T05:30:45.346Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*cnULzuzxsXufa2vW1QsWhw.jpeg" /></figure><p>So on my flight back to Seattle, I took this picture and it made me interested about stories of Mount St. Helens.</p><p><strong>Aerial view of three mountains:</strong> Mount Rainier (on the left, Washington’s highest peak), Mount Adams (in the middle, the state’s second tallest), and Mount St. Helens (on the right). Legend has it that two immortal brothers fell for the same maiden, and their bitter rivalry sparked a violent clash that devastated the land. Their divine father then transformed them into Mount Hood and Mount Adams, while the maiden became Mount St. Helens.</p><p><strong>On 1980/5/18,</strong> Mount St. Helens erupted with a force equivalent to 27,000 Hiroshima atomic bombs — seven times the power of the Tsar Bomba, the largest nuclear weapon ever tested. It became the most destructive volcanic eruption in modern U.S. history and the largest recorded in the contiguous 48 states. The volcano collapsed by 400 meters, plummeting from Washington’s fifth-tallest peak to beyond 30th place, forming its iconic horseshoe-shaped crater.</p><p><strong>Two months before the eruption,</strong> the temperamental beauty developed a “pimple” — a bulge on its slope growing by 1.8 meters daily. Local bars ran betting pools on “when it would blow,” with wagers ranging from beer to tractors. One geologist wagered $100 on the correct date based on data but couldn’t collect his winnings — the bar was gone by eruption day. Young partiers threw a “Volcano Bash” with the slogan <em>Live fast, die hot</em>; the site was later buried under three meters of ash. Survivors opened a bar named <em>Last Call</em>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JfloJV2b5oqta2tXu1XUOw.jpeg" /></figure><p><strong>A logging crew on the volcano’s north slope</strong> was directly in the blast path. Rescuers found only their steel-toed boots and tools — their bodies had vaporized. Scientists explained: the 300°C pyroclastic flow could carbonize a human in 0.1 seconds.</p><p><strong>Harry Truman (namesake of the U.S. president),</strong> the 84-year-old lodge owner, refused to evacuate, declaring, “Me and my 16 cats are staying right here — we’ll die if we must!” Post-eruption, his lodge was swept by lahars into Spirit Lake; no remains were ever found. Later, the lake surfaced with a “ghost armada” of floating tree trunks, dubbed <em>Truman’s Navy</em>.</p><p><strong>Photographer Robert,</strong> just 10 km from the volcano during the eruption, knew escape was impossible. He calmly captured the pyroclastic flow’s approach, stashed his camera in his backpack, and shielded the film with his body. Seventeen days later, rescuers recovered his remains — the intact footage became the most harrowing death-recorded documentation of the disaster.</p><p><strong>Volcanologist David Johnston,</strong> stationed at Coldwater Ridge, radioed the eruption’s first report moments before his observation post was engulfed: <em>“Vancouver! Vancouver! This is it!”</em> His body was never found. The Johnston Ridge Observatory now stands where he monitored the volcano.</p><p><strong>Aftermath antics:</strong> Farmers used ash in chicken coops (claiming it repelled fleas), only for the birds to develop silicosis. A gym marketed it as “natural dumbbell powder” until halted (inhalation risk). Bootleg “Limited Edition St. Helens Air Cans” (just regular air + dust) surfaced, while black-market “volcanic diamonds” (actually volcanic glass) scammed collectors. In 1982, a couple wed on the crater’s rim, vowing <em>“Till death do us part, hot as lava.”</em> Their geologist-officiant used volcanic glass rings — they divorced three months later for “irreconcilable differences.”</p><p><strong>By 1983,</strong> scientists spotted the first plant — fireweed — sprouting in the ash-barren plains, symbolizing life’s return. A blue ski run on Mount Hood was later named after this resilient flower.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ak6EBpR-8eRx1W3mNHqB4A.jpeg" /></figure><p>“You should go hike to the summit. The view is stunning.” My friend said to me. Surely I believe him.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1fecbe562364" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Python cheat sheet to crack tech interview]]></title>
            <link>https://medium.com/@badcat410/python-cheat-sheet-to-crack-tech-interview-5d6eadc3664d?source=rss-6b3ffd136ffd------2</link>
            <guid isPermaLink="false">https://medium.com/p/5d6eadc3664d</guid>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[interview-tips]]></category>
            <category><![CDATA[tech-interview]]></category>
            <category><![CDATA[python-cheat-sheet]]></category>
            <category><![CDATA[coding-interviews]]></category>
            <dc:creator><![CDATA[Bad Cat]]></dc:creator>
            <pubDate>Sun, 27 Feb 2022 06:09:21 GMT</pubDate>
            <atom:updated>2022-02-27T06:09:21.551Z</atom:updated>
            <content:encoded><![CDATA[<p>Life is short, use Python. This cheat sheet is by no means an exhaustive list, but I found it’s helpful to review some handy code snippet before coding Python in tech interview.</p><p>1. <a href="https://docs.python.org/3/library/functools.html">@cache, @lru_cache</a></p><p>Some dynamic programming will be much easier to code the <a href="https://en.wikipedia.org/wiki/Memoization">Memoization</a> version. How handy it is to have 1-liner to magically memorize things for you!</p><p>Sample (@cache is available in Python 3.9+, or use @lru_cache in earlier version, especially if the collaborative interview tool doesn’t support higher Python version)</p><pre>@cache</pre><pre>def factorial(n):</pre><pre> return n * factorial(n-1) if n else 1</pre><pre>&gt;&gt;&gt; factorial(10) # no previously cached result, makes 11 recursive calls</pre><pre>3628800</pre><pre>&gt;&gt;&gt; factorial(5) # just looks up cached value result</pre><pre>120</pre><pre>&gt;&gt;&gt; factorial(12) # makes two new recursive calls, the other 10 are cached</pre><pre>479001600</pre><p>2. <a href="https://docs.python.org/3/library/bisect.html">bisect</a></p><p>bisect module supports binary searching in a sorted list, and inserting into a sorted list using binary search.</p><p><strong>bisect.bisect_left(a, x, lo=0, hi=len(a), *, key=None)</strong> returns the insertion point for x in a to maintain sorted order. The parameters lo and hi may be used to specify a subset of the list which should be considered; by default the entire list is used. If x is already present in a, the insertion point will be before (to the left of) any existing entries. In Python 3.10+, “key” parameter is available to specify a key function of one argument that is used to extract a comparison key from each input element.</p><p><strong>bisect.bisect_right(a, x, lo=0, hi=len(a), *, key=None)</strong> and <strong>bisect.bisect(a, x, lo=0, hi=len(a), *, key=None)</strong>, similar to bisect_left(), but returns an insertion point which comes after (to the right of) any existing entries of x in a.</p><p><strong>insort_left(a, x, lo=0, hi=len(a), *, key=None)</strong> and <strong>insort_right(a, x, lo=0, hi=len(a), *, key=None)</strong> inserts x into proper place in sorted list a</p><p>3. <a href="https://docs.python.org/3/library/collections.html#deque-objects">collections.deque</a></p><p>Double-ended queue, can be used as stack and queue, working like a sequence type plus extra methods: <strong>appendleft, extendleft, popleft</strong></p><p>When using as stack: <strong>append, extend, pop</strong></p><p>When using as queue: <strong>append, extend, popleft</strong></p><p>4. <a href="https://docs.python.org/3/library/collections.html#ordereddict-objects">collections.OrderedDict</a></p><p>Ordered dictionaries are just like regular dictionaries but have some extra capabilities relating to ordering operations. Perfect to implement LRU cache.</p><p>Method <strong>popitem(last=True) </strong>returns and removes a (key, value) pair. The pairs are returned in LIFO order if last is true or FIFO order if false.</p><p>Method <strong>move_to_end(key, last=True)</strong> moves an existing key to either end of an ordered dictionary. The item is moved to the right end if last is true (the default) or to the beginning if last is false. Raises KeyError if the key does not exist.</p><p>5. <a href="https://docs.python.org/3/library/collections.html#counter-objects">collections.Counter</a></p><p>Counter is a dict subclass for counting hashable objects, supporting convenient and rapid tallies. It is a collection where elements are stored as dictionary keys and their counts are stored as dictionary values. Counts are allowed to be any integer value including zero or negative counts.</p><p>Method <strong>most_common([n])</strong> returns a list of the n most common elements and their counts from the most common to the least (insertion order is kept)</p><p>Sample</p><pre>&gt;&gt;&gt;from collection import Counter<br>&gt;&gt;&gt;Counter([‘red’, ‘blue’, ‘red’, ‘green’, ‘blue’, ‘blue’])</pre><pre>Counter({‘blue’: 3, ‘red’: 2, ‘green’: 1})</pre><p>6. <a href="https://docs.python.org/3/library/collections.html#defaultdict-objects">collections.defaultdict</a></p><p>defaultdict is a subclass of the built-in dict class. It supports dict to have a default value customized by a factory method, when accessing a key not in dict yet.</p><p>Sample 1 Using list as the default_factory, it is easy to group a sequence of key-value pairs into a dictionary of lists:</p><pre>from colletions import defaultdict</pre><pre>s = [(‘yellow’, 1), (‘blue’, 2), (‘yellow’, 3), (‘blue’, 4), (‘red’, 1)]</pre><pre>d = defaultdict(list)</pre><pre>for k, v in s:</pre><pre>  d[k].append(v)</pre><pre>sorted(d.items())</pre><pre>[(‘blue’, [2, 4]), (‘red’, [1]), (‘yellow’, [1, 3])]</pre><p>Sample 2 Implement <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> tree</p><pre>from collections import defaultdict</pre><pre>def default_factory():</pre><pre>  return defaultdict(default_factory)</pre><pre>trie = defaultdict(default_factory)</pre><pre>for word in [‘hello’, ‘world’]:</pre><pre>  node = trie</pre><pre>for c in word:</pre><pre>  node = node[c]</pre><pre>node[‘$’] = None</pre><p>7. <a href="https://docs.python.org/3/library/heapq.html">heapq</a></p><p>heapq module provides an implementation of the priority queue algorithm. It’s a “min heap” with heap[0] as the smallest item.</p><p>Methods for heapq h:</p><ul><li>to build a heap from list h: <strong>heapq.heapify(h)</strong></li><li>basics: <strong>heapq.heappush(h, item)</strong> and <strong>heapq.heappop(h)</strong></li><li>advanced: <strong>heapq.heappushpop(h, item), heapq.heapreplace(h, item), heapq.merge(*iterables, key=None, reverse=False)</strong> returns an iterator after merging multiple sorted inputs.</li><li>super handy: <strong>heapq.nlargest(n, iterable, key=None) </strong>and<strong> heapq.nsmallest(n, iterable, key=None)</strong> returns a list with the n largest or smallest elements from the dataset defined by iterable.</li></ul><p>Q: It’s common to build a heapq with a Tuple, 1st item being priority and 2nd being some object, but the comparison breaks if some tuples have the same priority and the 2nd item objects do not have a default comparison order. What do we do to make it work?</p><p>A: One option is to add entry sequence order or <strong>time() </strong>as the tie breaker (the 2nd item), and move the original 2nd item object as the 3rd item in Tuple.</p><p>8. Common integer operations</p><ul><li>/ (division) returns float, // (floor division) returns int</li><li>quotient, remainder = <strong>divmod(x, y)</strong> 1 liner replaces quotient = x//y and remainder = x%y.</li><li><a href="https://docs.python.org/3/library/functions.html#bin"><strong>bin</strong></a><strong>(x)</strong> converts an integer number to a binary string prefixed with “0b” or “-0b”.</li><li><a href="https://docs.python.org/3/library/functions.html#int"><strong>int</strong></a><strong>(‘FF’, 16)</strong> converts a hexadecimal number string to integer, and <strong>hex(x)</strong> the other way around</li><li>math functions and constants: <strong>math.floor(x), math.ceil(x), math.inf</strong></li></ul><p>9. Common <a href="https://docs.python.org/3/library/stdtypes.html#sequence-types-list-tuple-range">sequence type</a> operations</p><p>manipulating elements in the sequence s:</p><ul><li><strong>x in s</strong> returns if element x is in s</li><li><strong>s[i]</strong> returns the element at index i, negative index means looking backward, e.g. s[-1] is the last element.</li><li><strong>s[i:j]</strong> returns a slice of s, starting from index i and ending at index j-1.</li><li><strong>s.append(x)</strong> appends x to the list</li><li><strong>s.index(x[, i[, j]])</strong> returns the first occurrence of x in s[i:j], ValueError if not found.</li><li><strong>s.count(x)</strong> returns number of occurrence of x in s</li><li><strong>s.insert(i,x)</strong> inserts x at index i</li><li><strong>s.pop([i])</strong> returns and removes the last element if i is absent</li><li><strong>s.remove(x)</strong> removes the first occurrence of x in s, ValueError if not found.</li></ul><p>manipulating the sequence:</p><ul><li><strong>len(s), max(s), min(s), sum(s), s1.extend(s2) or s1+=s2, s.clear(), s.copy(), ‘ab’ * 2</strong> returns ‘abab’, <strong>list(s) </strong>converts s to list</li><li><a href="https://docs.python.org/3/library/functions.html#sorted"><strong>sorted</strong></a><strong>(iterable, key=None, reverse=False)</strong> built-in function builds a new sorted list from an iterable. Sorting is stable.</li><li><a href="https://docs.python.org/3/library/functions.html#reversed"><strong>reversed</strong></a><strong>(iterable)</strong> built-in function Return a reverse iterator.</li></ul><p>for list only:</p><ul><li><strong>l.sort(key=None, reverse=False) </strong>sorts the list in place. Sorting is stable, so to sort by multiple fields like sorting students by score then id, see 2 options in sample</li></ul><pre># students has type List[Student]</pre><pre># Option 1<br>students.sort(key=lambda x:x.id)<br>students.sort(key=lambda x:x.score)</pre><pre># Option 2<br>Student.__lt__ = lambda self, other: self.score &lt; other.score or self.score == other.score and self.id &lt; other.id<br>students.sort()</pre><ul><li><a href="https://docs.python.org/3/tutorial/datastructures.html#list-comprehensions">More</a> on list comprehension.</li></ul><p>for str only:</p><ul><li>“isX”: <strong>isalnum, isalpha, isascii, isdigit, islower, isnumeric, isspace, isupper</strong></li><li>case: <strong>capitalize, lower, upper</strong></li><li>prefix and suffix: <strong>endswith(suffix[, start[, end]]), startswith(prefix[, start[, end]]), lstrip([chars]), rstrip([chars]), strip([chars]), removeprefix(prefix), removesuffix(suffix)</strong></li><li>formating: <strong>center(width[, fillchar]), format(*args, **kwargs), zfill(width)</strong></li><li>searching and replacing: <strong>count(sub[, start[, end]]), find(sub[, start[, end]]) </strong>returns -1 if not found<strong>, index(sub[, start[, end]]) </strong>ValueError if not found<strong>, replace(old,new[,count]), rfind(sub[, start[, end]]), rindex(sub[, start[, end]])</strong></li><li>join and split: <strong>join(iterable), partition(sep), split(sep=None, maxsplit=-1), splitlines(keepends=True)</strong></li></ul><p>10. Common <a href="https://docs.python.org/3/library/stdtypes.html#set-types-set-frozenset">Set</a> and <a href="https://docs.python.org/3/library/stdtypes.html#mapping-types-dict">Dict</a> operations</p><p>Set s</p><ul><li>basics: <strong>len(s), x in s, add(x), discard(x), remove(x)</strong> KeyError if not found, <strong>pop()</strong> returns and removes a random element, <strong>clear(), update(iterable)</strong></li><li>operators: <strong>s1&lt;s2, s1&lt;=s2, s1|s2, s1&amp;s2, s1-s2, s1^s2</strong></li></ul><p>Dict d</p><ul><li>basics:<strong> len(d), k in d, d[k]=v, d.get(k, [default]), d.setdefault(k, [default]), d.pop(k, [default]), d.update([other])</strong></li><li>for keys: <strong>list(d), d.keys(), reversed(d)</strong></li><li>common looping pattern: <strong>for k,v in d.items():</strong> …</li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5d6eadc3664d" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>