Bloomberg Logo

Bloomberg - String Matching

String Matching questions asked by Bloomberg

Total: 11
Easy: 5
Medium: 4
Hard: 2
Progress: 0%
No. Question Title Link Difficulty Solved
1 Find Maximum Number of Non Intersecting Substrings Visit Medium
2 Find the Original Typed String II Visit Hard
3 Type of Triangle Visit Easy
4 Number of Sub-arrays With Odd Sum Visit Medium
5 Range Sum of Sorted Subarray Sums Visit Medium
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 11 questions for free!

Log In

Frequently Asked Questions

Common questions about Bloomberg interviews