Bonterra LeetCode Interview Questions

Practice 33 coding problems currently tagged to Bonterra. Use the frequency and topic signals to build a focused software engineering interview practice plan.

11 Easy

14 Medium

8 Hard

Using AI during your Bonterra interview

AI Interview Copilot →

How the copilot answers coding, system design and behavioral questions live.

Coding Interview Copilot →

Screenshot the problem, get the approach, complexity and code.

AI Interview Assistant →

Listens to the interviewer and answers spoken questions, even from your phone.

Problem	DifficultyDiff	Frequency	Topics	Action
Product of Array Except Self 100%	MediumM	100%	Array Prefix Sum	Solve→
Flip Columns For Maximum Number of Equal Rows 92%	MediumM	92%	Array Hash Table+1	Solve→
Find the Index of the First Occurrence in a String 84%	EasyE	84%	Two Pointers String+1	Solve→
The Earliest Moment When Everyone Become Friends 83%	MediumM	83%	Array Union Find+1	Solve→
Minimum Window Substring 82%	HardH	82%	Hash Table String+1	Solve→
Check if One String Swap Can Make Strings Equal 78%	EasyE	78%	Hash Table String+1	Solve→
Buildings With an Ocean View 77%	MediumM	77%	Array Stack+1	Solve→
Pow(x, n) 73%	MediumM	73%	Math Recursion	Solve→
Squares of a Sorted Array 67%	EasyE	67%	Array Two Pointers+1	Solve→
Alien Dictionary 67%	HardH	67%	Array String+4	Solve→
Trapping Rain Water 64%	HardH	64%	Array Two Pointers+3	Solve→
Word Ladder II 62%	HardH	62%	Hash Table String+2	Solve→
Minimum Remove to Make Valid Parentheses 61%	MediumM	61%	String Stack	Solve→
Missing Ranges 60%	EasyE	60%	Array	Solve→
Number of Ships in a Rectangle 59%	HardH	59%	Array Divide and Conquer+1	Solve→
Lowest Common Ancestor of a Binary Search Tree 56%	MediumM	56%	Tree Depth-First Search+2	Solve→
Design an Ordered Stream 55%	EasyE	55%	Array Hash Table+2	Solve→
Diagonal Traverse 54%	MediumM	54%	Array Matrix+1	Solve→
Zigzag Conversion 53%	MediumM	53%	String	Solve→
Toeplitz Matrix 49%	EasyE	49%	Array Matrix	Solve→
House Robber II 48%	MediumM	48%	Array Dynamic Programming	Solve→
Isomorphic Strings 44%	EasyE	44%	Hash Table String	Solve→
Subarrays with K Different Integers 43%	HardH	43%	Array Hash Table+2	Solve→
Word Break II 42%	HardH	42%	Array Hash Table+5	Solve→
Linked List Cycle 41%	EasyE	41%	Hash Table Linked List+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Longest Increasing Path in a Matrix 34%	HardH	34%	Array Dynamic Programming+6	Solve→
Interval List Intersections 33%	MediumM	33%	Array Two Pointers	Solve→
Remove All Adjacent Duplicates In String 30%	EasyE	30%	String Stack	Solve→
Maximum Sum Circular Subarray 30%	MediumM	30%	Array Divide and Conquer+3	Solve→
Convert Binary Search Tree to Sorted Doubly Linked List 27%	MediumM	27%	Linked List Stack+5	Solve→
Min Stack 23%	MediumM	23%	Stack Design	Solve→
Palindrome Linked List 21%	EasyE	21%	Linked List Two Pointers+2	Solve→
First Unique Character in a String 20%	EasyE	20%	Hash Table String+2	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Blizzard Entertainment

33 problems

Frequently Asked Questions

What LeetCode problems are tagged to Bonterra?

Our current Bonterra practice dataset contains 33 tagged coding problems, including Product of Array Except Self, Flip Columns For Maximum Number of Equal Rows, Find the Index of the First Occurrence in a String. The difficulty breakdown is 11 Easy, 14 Medium, and 8 Hard problems.

How should I prepare for a Bonterra coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Bonterra interviews typically emphasize Array and String. Practice explaining your thought process while coding.

What is the difficulty level of Bonterra coding interviews?

Based on our data, Bonterra interviews include 11 Easy (33%), 14 Medium (42%), and 8 Hard (24%) problems.

Ready to ace your Bonterra interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Bonterra LeetCode Interview Questions

Practice 33 coding problems currently tagged to Bonterra. Use the frequency and topic signals to build a focused software engineering interview practice plan.

11 Easy

14 Medium

8 Hard

Problem	DifficultyDiff	Frequency	Topics	Action
Product of Array Except Self 100%	MediumM	100%	Array Prefix Sum	Solve→
Flip Columns For Maximum Number of Equal Rows 92%	MediumM	92%	Array Hash Table+1	Solve→
Find the Index of the First Occurrence in a String 84%	EasyE	84%	Two Pointers String+1	Solve→
The Earliest Moment When Everyone Become Friends 83%	MediumM	83%	Array Union Find+1	Solve→
Minimum Window Substring 82%	HardH	82%	Hash Table String+1	Solve→
Check if One String Swap Can Make Strings Equal 78%	EasyE	78%	Hash Table String+1	Solve→
Buildings With an Ocean View 77%	MediumM	77%	Array Stack+1	Solve→
Pow(x, n) 73%	MediumM	73%	Math Recursion	Solve→
Squares of a Sorted Array 67%	EasyE	67%	Array Two Pointers+1	Solve→
Alien Dictionary 67%	HardH	67%	Array String+4	Solve→
Trapping Rain Water 64%	HardH	64%	Array Two Pointers+3	Solve→
Word Ladder II 62%	HardH	62%	Hash Table String+2	Solve→
Minimum Remove to Make Valid Parentheses 61%	MediumM	61%	String Stack	Solve→
Missing Ranges 60%	EasyE	60%	Array	Solve→
Number of Ships in a Rectangle 59%	HardH	59%	Array Divide and Conquer+1	Solve→
Lowest Common Ancestor of a Binary Search Tree 56%	MediumM	56%	Tree Depth-First Search+2	Solve→
Design an Ordered Stream 55%	EasyE	55%	Array Hash Table+2	Solve→
Diagonal Traverse 54%	MediumM	54%	Array Matrix+1	Solve→
Zigzag Conversion 53%	MediumM	53%	String	Solve→
Toeplitz Matrix 49%	EasyE	49%	Array Matrix	Solve→
House Robber II 48%	MediumM	48%	Array Dynamic Programming	Solve→
Isomorphic Strings 44%	EasyE	44%	Hash Table String	Solve→
Subarrays with K Different Integers 43%	HardH	43%	Array Hash Table+2	Solve→
Word Break II 42%	HardH	42%	Array Hash Table+5	Solve→
Linked List Cycle 41%	EasyE	41%	Hash Table Linked List+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Longest Increasing Path in a Matrix 34%	HardH	34%	Array Dynamic Programming+6	Solve→
Interval List Intersections 33%	MediumM	33%	Array Two Pointers	Solve→
Remove All Adjacent Duplicates In String 30%	EasyE	30%	String Stack	Solve→
Maximum Sum Circular Subarray 30%	MediumM	30%	Array Divide and Conquer+3	Solve→
Convert Binary Search Tree to Sorted Doubly Linked List 27%	MediumM	27%	Linked List Stack+5	Solve→
Min Stack 23%	MediumM	23%	Stack Design	Solve→
Palindrome Linked List 21%	EasyE	21%	Linked List Two Pointers+2	Solve→
First Unique Character in a String 20%	EasyE	20%	Hash Table String+2	Solve→