Mastodawn

marco Jul 5, 2025

Any recs for screencasts of people building with Claude Code/Cursor/Gemini CLI/etc?

Doesn't have to be anything complex or long, just clearly showing workflow/interaction/etc.

Show thread

marco Feb 20, 2025

https://mcognetta.github.io/posts/leetcode-random-seed/

Finding a Random Seed That Solves a LeetCode Problem

marco Feb 20, 2025

This problem came up again, so I updated my old solution!

https://sigmoid.social/@mc/111662581917469235

marco (@mc@sigmoid.social)

The basic problem was: Give a list of `k` length-`k` bitstrings, find a new length-`k` bitstring that isn't present in the list. For example, for `[010, 111, 100]`, an answer could be `001`. The classic way to do this is via Cantor's diagonalization argument ```python def find_new_string_cantor(bitstrings): return ''.join('0' if b[i] == '1' else '1' for (i, b) in enumerate(bitstrings)) ``` #python #leetcode #codegolf #programming

Sigmoid Social

marco Feb 20, 2025

marco Dec 29, 2023

A few weeks ago I got bored and tried solving a leetcode problem "at random". Basically, I wanted to find a way to set a random seed such that randomly generating an answer solved all the test cases for the following problem: https://leetcode.com/problems/find-unique-binary-string/.

Through a little trial and error, I managed to solve it. Check out the writeup!

https://mcognetta.github.io/posts/leetcode-random-seed/

#python #leetcode #codegolf #programming #MaliciousCompliance

Find Unique Binary String - LeetCode

Can you solve this real interview question? Find Unique Binary String - Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. If there are multiple answers, you may return any of them. Example 1: Input: nums = ["01","10"] Output: "11" Explanation: "11" does not appear in nums. "00" would also be correct. Example 2: Input: nums = ["00","01"] Output: "11" Explanation: "11" does not appear in nums. "10" would also be correct. Example 3: Input: nums = ["111","011","001"] Output: "101" Explanation: "101" does not appear in nums. "000", "010", "100", and "110" would also be correct. Constraints: * n == nums.length * 1 <= n <= 16 * nums[i].length == n * nums[i] is either '0' or '1'. * All the strings of nums are unique.

LeetCode

Tokenization is an often-overlooked aspect of modern #NLP, but it’s experiencing a resurgence — thanks in large part to @karpathy and his classic tweet:

x.com/karpathy/sta...

Come hang out with us and let's fix these problems!