Some binary tree problem, original LC problem.
New Grad Software Engineer Interview Questions
2,906 new grad software engineer interview questions shared by candidates
Not from the Bloomberg frequently asked questions. I had never seen those questions before
Design a LRU cache system
Phone screen- move zeros, design a MCU cache Onsite- meeting room leetcode question, random tree questions they clearly made up on the spot.
Leetcode medium System design q-n to design a system to monitor Bloomberg's large system
Maximize vision in a 2d forest matrix
Most of the questions were leetcode-esque. Started with easy level questions before moving up to around medium difficulty.
Optimal flights
Given a large string (a book) and a list of words (unique words), print all occurences where all the words appear consecutively in the string. (the order does not matter, but need to be all from the list and having no other words between them). Example: INPUT: string: "This is a test is. other a" list: ["is", "a", "test"] OUTPUT: 1,2
Definitely use Cracking the Coding Interview for this one, some of the questions were straight out of the book. Q1: Perform and print level order traversal of a binary tree Q2: Add 2 numbers whose digits are stored in a linked list, i.e. add(1->2->3->4, 4->5->6->7) is equivalent to adding 1234 + 4567. Q3: Print level at which node is in a binary tree Q4: Iterative Fibonacci
Viewing 771 - 780 interview questions