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
First one asked me to design something simple on the web and second one was about create a form with some functionality.
Background Question on relevant experience.
What do you notice about our factory set up? Why do you think we put these pieces on the middle shelf?
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
One leetcode question was variation of count and say
Why do you want to work at bloomberg?
1. String to Integer 2. group anagrams
What is a market trend that you will be interested in and why?
Why Bloomberg and why this program
Viewing 2131 - 2140 interview questions