Bloomberg Interview Questions — 100 DSA Problems

100 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Bloomberg LeetCode questions for software engineering interviews.

• Two Sum (EASY) — Array, Hash Table
• Merge Intervals (MEDIUM) — Array, Sorting
• Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Valid Parentheses (EASY) — String, Stack
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers
• Longest Common Prefix (EASY) — String, Trie
• Palindrome Number (EASY) — Math
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Roman to Integer (EASY) — Hash Table, Math, String
• Reverse Integer (MEDIUM) — Math
• Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Subsets (MEDIUM) — Array, Backtracking, Bit Manipulation
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Next Permutation (MEDIUM) — Array, Two Pointers
• Validate Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Rotate Image (MEDIUM) — Array, Math, Matrix
• Pow(x, n) (MEDIUM) — Math, Recursion
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
• Remove Element (EASY) — Array, Two Pointers
• Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
• Sqrt(x) (EASY) — Math, Binary Search
• Binary Tree Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Find the Index of the First Occurrence in a String (EASY) — Two Pointers, String, String Matching
• Unique Paths (MEDIUM) — Math, Dynamic Programming, Combinatorics
• Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
• 4Sum (MEDIUM) — Array, Two Pointers, Sorting
• String to Integer (atoi) (MEDIUM) — String
• Swap Nodes in Pairs (MEDIUM) — Linked List, Recursion
• 3Sum Closest (MEDIUM) — Array, Two Pointers, Sorting
• Search Insert Position (EASY) — Array, Binary Search
• Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy
• Permutations (MEDIUM) — Array, Backtracking
• Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Construct Binary Tree from Preorder and Inorder Traversal (MEDIUM) — Array, Hash Table, Divide and Conquer, Tree, Binary Tree
• Combination Sum (MEDIUM) — Array, Backtracking