1. Given a list of non-unique integers and a target value, return the count of how many pairs of integers sum to the target value 2. Write a square root function (without using a built-in or library square root function) 3. Given a sorted linked list, remove all duplicate nodes 4. Implement a class that uses entry/exit swipe information (card, swipe, station) to answer queries of average transit time between pairs of stations. (design and implement api)
Questions focussed on data structures, using linked lists, hashmaps, and trees.
Try to reverse a linked list
Flatten a multilevel linked list (not a doubly linked list)
LeetCode Easy/Medium Design and Graph
leetcode medium 322. Coin Change
Why do you want to work for Bloomberg?
LeetCode medium - DFS through a graph
Time bases key value cache
The first interview was a leetcode easy, and the second was a leetcode medium graph traversal
Viewing 2131 - 2140 interview questions