Doesn't seem to be any discernable improvement on the Zoom Cat Lawyer.
Readit Newsycitm commented on AI Avatars Escape the Uncanny Valley a16z.com/ai-avatars/... · Posted by u/asparagui
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
You can also play around with the code in the TypeScript playground:
https://www.typescriptlang.org/play?#code/PTAEEkDsAsEMBsCmAa...
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
An amazing read, and almost perfect!
There's a bug in the Solve "function" due to which you'll get the right answer only for 1x1, 5x5 and 7x7 (I checked till 8x8).
The base case makes a wrong assumption that there will always be a candidate available for the last row. If there are no candidates available, it should return Nil, and backtrack.
Basically, replace
Concat<candidates, placedQueens>
candidates extends Cons<infer x, any>
? Cons<x, placedQueens>
: NilAh, thank you so much! Great spot.
I've corrected this, and credited you in the errata - https://www.richard-towers.com/2023/03/11/typescripting-the-...
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
I don't really know what it means, but I've seen it used to work around depth issues in Typescript, but can this use a "trampoline"?
I don't think there's any way to do iteration in the type system (other than recursion), so there's no way around it.
I considered forking the compiler to set a deeper limit, but at some point Typescript itself is going to stack overflow. Also that probably goes a bit beyond what Criss is expecting in an interview...
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
Why did they only solve for 7 Queens and not 8 Queens?
I'm reminded of https://github.com/type-challenges/type-challenges -- I've only looked at some of the more challenging problems, but one involves writing a JSON parser in the type system. The easy problems look reasonably useful to solve.
I wondered if anyone would spot this :)
There's a recursion depth limit of 500 on the TypeScript compiler, which prevents this solution working for N > 7
Even Aphyr's original Haskell solution only demonstrates N = 6, so in some sense this is an improvement on the state of the art for type-level N Queens solutions /s
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
Can you link them? I couldn’t find them on his blog.
The series is actually by Aphyr: https://aphyr.com/tags/interviews
This post is a pastiche of https://aphyr.com/posts/342-typing-the-technical-interview
ycitm commented on TypeScripting the technical interview richard-towers.com/2023/0... · Posted by u/ycitm
So he wrote all that for the typescript lsp to respond with the answer, but when it compiles down it's nothing? And we're using runes as variables just because?
That is pretty neat, and silly.
I also think it highlights my natural aversion to static type checking in dynamic languages. I know that I could get sucked into writing a bunch of code for the checker, instead of using my energy for making the application work.
The runes are mostly "just because", but there is a reason.
Ideally, I would have written:
type Nil = unique symbol
I could also have done
type Nil = "nil"
https://www.richard-towers.com/2023/03/11/typescripting-the-...