Chime Coding Interview Questions
25 Chime coding interview problems with full optimal solutions — 14 easy, 8 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Chime interviewer values, and a FAQ section.
Showing 3 problems of 25
- #23hardfoundational
23. Sliding Window Maximum
Return the maximum of every contiguous window of size k as it slides across the array.
- #24hardfoundational
24. Serialize and Deserialize Binary Tree
Design serialize() and deserialize() functions that round-trip an arbitrary binary tree through a string.
- #25hardfoundational
25. Burst Balloons
Maximize the coins you collect by bursting balloons in an optimal order, where the gain from a burst depends on its current neighbors.