Bloomberg Interview Questions
Introduction
Easy
1.1 Move Zeroes
1.2 Same Tree
1.3 Roma to Integer
1.4 Reverse Linked List
1.5 Best Time to Buy and Sell Stock
1.6 Swap Nodes in Pairs
1.7 Linked List Cycle
1.8 First Unique Character in a String
1.9 Symmetric Tree
1.10 Balanced Binary Tree
1.11 Binary Tree Level Order Traversal
1.12 Remove Duplicates in Sorted Array
1.13 Implement Queue using Stacks
1.14 Factorial Trailing Zeros
1.15 Valid Parentheses
1.16 Implement Stack using Queues
1.17 Merge Sorted Array
1.18 Intersection of Two Linked Lists
1.19 TwoSum
1.20 Min Stack
1.21 Reverse Integer
1.22 Rotate Array
1.23 String to Integer(atoi)
Medium
2.1 Best Time to Buy and Sell Stock II
2.2 Missing Number
2.3 Kth Smallest Element in a BST
2.4 Unique Paths
2.5 Maximum Subarray
2.6 Lexicographical Numbers
2.7 Kth Largest Element in an Array
2.8 Container With Most Water
2.9 H-Index
2.10 Binary Tree Zigzag Level Order Traversal
2.11 Unique Paths
2.12 Group Anagrams
2.13 Path Sum II
2.14 Construct Binary Tree from Preorder and Inorder Traversal
2.15 3Sum Closest
2.16 Palindrome Partitioning
2.17 Pow(x, n)
2.18 Word Break
2.19 Sqrt(x)
2.20 Implement Trie Tree
2.21 Add Two Numbers
2.22 Word Search
2.23 Longest Substring Without Repeating Characters
2.24 Longest Palindrome Substring
2.25 Validate Binary Search Tree
2.26 3 SUM
2.27 Reverse words in a string
Hard
3.1 Find the Duplicate Number
3.2 Trapping Rain Water
3.3 Populating Next Right Pointers in Each Node II
3.4 Search in Rotated Sorted Array
3.5 Serialize and Deserialize Binary Tree
3.6 Merge Interval
3.7 Copy List with Random Pointer
3.8 Read N Characters Given Read4 II - Call multiple times
3.9 LRU Cache
3.10 Shortest Panlindrome
Powered by
GitBook
Introduction
Bloomberg Interview Questions
Question
Description
Method
Time and Space Complexity
Code
results matching "
"
No results matching "
"