Hey guys,\nI made a post recently about applying to OpenAI, in which I was asking about what I might expect from the phone screen. That\'s here --> https://leetcode.com/discuss/interview-question/5908027/any-idea-what-to-expect-from-new-grad-phone-interview/2713911\n\nI got a good amount of comments asking how it went, and the kind of questions they asked. I totally didn\'t see this until now haha. So it ended up going well--moved to onsite, and that\'s this week. Although I was quite surprised, since I didn\'t think I had done extremely well.\n\nSince I didn\'t sign an NDA, I can give a bit of information on the question they asked (while ommitting some details that I think OpenAI wouldn\'t want me to say). It was sort of a Leetcode system design based question, very similar to Leetcode\'s [Time Based Key Value Store](http://https://leetcode.com/problems/time-based-key-value-store/description/). The main idea was you\'re given a series of post/delete statements you need to process (unsorted), and a timestamp associated with each of them. The goal is to compute a balance at any arbitrary timestamp, not necessraily given to you by the statements. The sharp among you will see this as a priority question, or tree map question, or both. I used both to solve it (pq sorts statements, tree map fetches balance at an arbitrary timestamp). \n\nAnyways, I did sign an NDA for the onsite, so I probably can\'t give too much details there. But let me know if you guys have questions about this screen. Presumably the onsite\'s question will be similar, probably a bit harder but we\'ll see.

Hey guys,\nI made a post recently about applying to OpenAI, in which I was asking about what I might expect from the phone screen. That\'s here --> https://leet