cho.sh

researchmini

3,252 notes

260729260729 260727260727 Claude Code Live Renaming30747B 260726260726 260722260722 I prefer TUIBB9A08 MarkRight8B0501 에이전트 런타임 서버 셋업1983DC Bun을 Rust로 재작성하다2BDED3 260721260721 Agent Runtime Server SetupC38C2C 260719260719 AutoBuilder63849A 260718260718 Slack Bots are the new CLIs3E662F 260717260717 WristcomputerD98BDF 260716260716 SalpakanA2940F AGENTS.mdDFE522 260714260714 260713260713 260712260712 260711260711

Real Interviews · cho.sh

Real Interviews

Real Interviews

Warning

This post is more than a year old. Information may be outdated.

See also: Real Exams

30E62A

For 2024

Ubuntu

Many Linux Foundation Knowledges

For 2023

Apple

Many CS fundamental questions (e.g., what is a Hash Table (pros/cons)?)
isPalindrome with a few edge cases

Palantir

technical design of a class registration system (higher level engineering)
technical design of a package manager proxy server (multithreading)

Grammarly

1 Q on removing adjacent duplicates
- simple algorithm

Backlinks7

231023 230131 221107 221024 220930 220922 Coding Tests

Comments

O(n^2)

improved to

O(n)

algorithm using stack

can improve space complexity from now on but cannot improve time complexity.

1 Followup Q on removing length adjacent duplicates arbitrarily

$O(nk)$ algorithm
Had even more time left, so I discussed with the interviewer and improved to $O(n)$ algorithm 😃

Learned that Grammarly has internal projects, Readerly (summarizing) and Speakerly (Generative Intelligence)

Palantir with Karat

3 basic questions (analyzing algorithms and complexities)
3 Leetcode Easy to Medium Problem
- Question involved constructing trees and traversing them
- Each question is built on top of previous queries, getting gradually harder.
- However, the most challenging question was still Leetcode Medium level.

Duolingo with Karat

3 basic questions (analyzing algorithms and complexities)
1 Leetcode Hard level question
- Involved in Game State Change, Constructing Adjacency List of Game States, and Pathfinding
- Given a Game Board, find a list of moves from the start state to the end state

Databricks

2 1-hour interview
- 1 conceptual, technical design (data pipelines & tradeoffs)
- 1 conditional BFS problem

Comments0

No comments yet. Be the first to share your thoughts.