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 14 problems of 25
- #1easyfoundational
1. Two Sum
Given an array of integers and a target, return indices of the two numbers that sum to the target.
- #2easyfoundational
2. Valid Parentheses
Given a string containing brackets, determine if every opening bracket is properly closed in the right order.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list by splicing nodes together.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Remove duplicates in-place from a sorted array, returning the new length.
- #5easyfoundational
5. Remove Element
Remove all occurrences of a value in-place from an array and return the new length.
- #6easyfoundational
6. Search Insert Position
Given a sorted array and a target, return the index where the target is or should be inserted.
- #7easyfoundational
7. Plus One
Given a non-empty array representing digits of an integer, increment by one and return the array.
- #8easyfoundational
8. Merge Sorted Array
Merge two sorted arrays in-place into the first array, which has enough trailing space.
- #9easyfoundational
9. Binary Tree Inorder Traversal
Return the inorder traversal of a binary tree's node values.
- #10easyfoundational
10. Single Number
Given a non-empty array where every element appears twice except one, find that single element in O(n) time and O(1) space.
- #11easyfoundational
11. Linked List Cycle
Detect whether a singly linked list has a cycle using O(1) extra space.
- #12easyfoundational
12. Best Time to Buy and Sell Stock
Given an array of daily prices, find the maximum profit from a single buy-then-sell pair.
- #13easyfoundational
13. Symmetric Tree
Determine whether a binary tree is a mirror of itself around its center.
- #14easyfoundational
14. Maximum Depth of Binary Tree
Return the maximum depth of a binary tree, defined as the number of nodes along the longest root-to-leaf path.