All Bloomberg Coding Interview Questions
1024 questions we track for Bloomberg, most frequently asked first. Practice any of them in the code editor and get AI feedback on your solution.
- Junior32% (325)
- Mid/Senior54% (557)
- Staff14% (142)
Questionspage 10 of 11
- Minimum Number of Changes to Make Binary String Beautiful4 companiesMid/Senior
- Find Building Where Alice and Bob Can Meet5 companiesStaff
- Find Words Containing Character6 companiesJunior
- Find Common Elements Between Two Arrays5 companiesJunior
- Count Subarrays Where Max Element Appears at Least K Times6 companiesMid/Senior
- Find Missing and Repeated Values6 companiesJunior
- Divide Array Into Arrays With Max Difference6 companiesMid/Senior
- Minimum Number Game5 companiesJunior
- Maximum Square Area by Removing Fences From a Field3 companiesMid/Senior
- Find Longest Special Substring That Occurs Thrice I5 companiesMid/Senior
- Count Elements With Maximum Frequency8 companiesJunior
- Find Beautiful Indices in the Given Array I5 companiesMid/Senior
- Divide an Array Into Subarrays With Minimum Cost I6 companiesJunior
- Alice and Bob Playing Flower Game5 companiesMid/Senior
- Type of Triangle5 companiesJunior
- Find the Number of Ways to Place People I4 companiesMid/Senior
- Maximum Palindromes After Operations8 companiesMid/Senior
- Count Prefix and Suffix Pairs I6 companiesJunior
- Find the Length of the Longest Common Prefix17 companiesMid/Senior
- Find the Largest Area of Square Inside Two Rectangles5 companiesMid/Senior
- Apple Redistribution into Boxes3 companiesJunior
- Minimum Deletions to Make String K-Special3 companiesMid/Senior
- Longest Strictly Increasing or Strictly Decreasing Subarray7 companiesJunior
- Score of a String5 companiesJunior
- Find the Integer Added to Array I2 companiesJunior
- Minimum Array End4 companiesMid/Senior
- Valid Word8 companiesJunior
- Taking Maximum Energy From the Mystic Dungeon5 companiesMid/Senior
- Special Array I6 companiesJunior
- Special Array II6 companiesMid/Senior
- Find the Number of Distinct Colors Among the Balls3 companiesMid/Senior
- Lexicographically Minimum String After Removing Stars7 companiesMid/Senior
- Clear Digits5 companiesJunior
- Maximum Total Damage With Spell Casting7 companiesMid/Senior
- Find Minimum Operations to Make All Elements Divisible by Three4 companiesJunior
- Minimum Operations to Make Binary Array Elements Equal to One I6 companiesMid/Senior
- Find the Minimum Area to Cover All Ones I5 companiesMid/Senior
- Find the Maximum Length of Valid Subsequence II6 companiesMid/Senior
- Alternating Groups II4 companiesMid/Senior
- Generate Binary Strings Without Adjacent Zeros4 companiesMid/Senior
- Delete Nodes From Linked List Present in Array5 companiesMid/Senior
- Find the Winning Player in Coin Game1 companyJunior
- Minimum Length of String After Operations3 companiesMid/Senior
- Maximum Number of Operations to Move Ones to the End4 companiesMid/Senior
- Minimum Operations to Make Array Equal to Target4 companiesStaff
- Count the Number of Substrings With Dominant Ones5 companiesMid/Senior
- Find the Power of K-Size Subarrays I3 companiesMid/Senior
- Final Array State After K Multiplication Operations I4 companiesJunior
- Check if Two Chessboard Squares Have the Same Color3 companiesJunior
- Find a Safe Walk Through a Grid2 companiesMid/Senior
- Find the K-th Character in String Game I5 companiesJunior
- Count of Substrings Containing Every Vowel and K Consonants II3 companiesMid/Senior
- Find the K-th Character in String Game II3 companiesStaff
- Remove Methods From Project1 companyMid/Senior
- Construct the Minimum Bitwise Array I5 companiesJunior
- Find X-Sum of All K-Long Subarrays I5 companiesJunior
- Find X-Sum of All K-Long Subarrays II2 companiesStaff
- Find the Original Typed String I7 companiesJunior
- Find the Original Typed String II5 companiesStaff
- Find Minimum Time to Reach Last Room I4 companiesMid/Senior
- Maximum Frequency of an Element After Performing Operations I4 companiesMid/Senior
- Maximum Frequency of an Element After Performing Operations II3 companiesStaff
- Adjacent Increasing Subarrays Detection I4 companiesJunior
- Make Array Elements Equal to Zero5 companiesJunior
- Zero Array Transformation I5 companiesMid/Senior
- Zero Array Transformation II5 companiesMid/Senior
- Zero Array Transformation III5 companiesMid/Senior
- Find the Maximum Number of Fruits Collected2 companiesStaff
- Minimum Array Sum6 companiesMid/Senior
- Minimum Operations to Make Array Values Equal to K4 companiesJunior
- Maximum Subarray Sum With Length Divisible by K4 companiesMid/Senior
- Count Beautiful Splits in an Array2 companiesMid/Senior
- Check if Grid can be Cut into Sections3 companiesMid/Senior
- Minimum Number of Operations to Make Elements in Array Distinct5 companiesJunior
- Maximum Number of Distinct Elements After Operations4 companiesMid/Senior
- Find the Lexicographically Largest String From the Box I5 companiesMid/Senior
- Count Special Subsequences2 companiesMid/Senior
- Count the Number of Arrays with K Matching Adjacent Elements5 companiesStaff
- Maximum Amount of Money Robot Can Earn5 companiesMid/Senior
- Maximum Difference Between Adjacent Elements in a Circular Array5 companiesJunior
- Maximum and Minimum Sums of at Most Size K Subsequences3 companiesMid/Senior
- Paint House IV3 companiesMid/Senior
- Count Partitions with Even Sum Difference5 companiesJunior
- Count Mentions Per User4 companiesMid/Senior
- Maximum Frequency After Subarray Operation4 companiesMid/Senior
- Reschedule Meetings for Maximum Free Time I5 companiesMid/Senior
- Reschedule Meetings for Maximum Free Time II4 companiesMid/Senior
- Maximum Manhattan Distance After K Changes4 companiesMid/Senior
- Maximum Difference Between Even and Odd Frequency II6 companiesStaff
- Separate Squares I4 companiesMid/Senior
- Maximize the Distance Between Points on a Square2 companiesStaff
- Find Minimum Cost to Remove Array Elements3 companiesMid/Senior
- Find the Largest Almost Missing Integer2 companiesJunior
- Choose K Elements With Maximum Sum1 companyMid/Senior
- Fruits Into Baskets III4 companiesMid/Senior
- Maximize Subarrays After Removing One Conflicting Pair5 companiesStaff
- Maximum Unique Subarray Sum After Deletion5 companiesJunior
- Closest Equal Element Queries4 companiesMid/Senior
- Find the Minimum Amount of Time to Brew Potions6 companiesMid/Senior
- Minimum Operations to Make Array Elements Zero4 companiesStaff