LTI coding interview
questions, leaked.
4 problems reported across recent LTI interviews. Top patterns: array, sorting, sliding window. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
LTI's assessment leans technical. You're looking at four problems across a tight spread: three mediums and one hard. Arrays and sorting dominate the test, showing up in nearly every problem. Sliding window and binary search round out the core patterns. The problems aren't trick questions, but they're precise. If you freeze mid-OA on a sliding-window variant or can't quite pin down the sort order, StealthCoder runs invisibly and surfaces a working solution in seconds. You prep the stack. StealthCoder is your safety net on the day.
Top problems at LTI
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximum White Tiles Covered by a Carpet | MEDIUM | 100.0 | 35% | Array · Binary Search · Greedy |
| 02 | Reverse Integer | MEDIUM | 88.8 | 30% | Math |
| 03 | Closest Subsequence Sum | HARD | 88.8 | 42% | Array · Two Pointers · Dynamic Programming |
| 04 | Count Zero Request Servers | MEDIUM | 88.8 | 34% | Array · Hash Table · Sliding Window |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual LTI OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array3 · 75%
- sorting3 · 75%
- sliding window2 · 50%
- binary search1 · 25%
- greedy1 · 25%
- prefix sum1 · 25%
- math1 · 25%
- two pointers1 · 25%
- dynamic programming1 · 25%
- bit manipulation1 · 25%
Array manipulation and sorting form the backbone of LTI's assessment. Three of four problems touch arrays, and sorting appears in three as well. Sliding window shows up twice, often paired with binary search or greedy logic. The hard problem, Closest Subsequence Sum, combines bit manipulation, two pointers, and dynamic programming into a single multi-pattern challenge. Most candidates will nail the easy array work but stumble on the hard's layered approach. Sliding window is where time gets tight. You should be fluent in the classic two-pointer and expanding-window moves. Binary search is a secondary edge case, not a primary focus. If you hit the hard and can't partition the solution fast enough, StealthCoder delivers the breakdown in real time while the proctor sees only your screen.
Companies with similar patterns
If you prepped for LTI, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass LTI.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
LTI interview FAQ
Should I focus on sorting first for LTI?+
Yes. Sorting appears in three of four problems here. Start with merging sorted arrays, custom sort orders, and stable sorts. Then layer on binary search basics, since several problems combine the two. Get those two patterns to reflex speed first.
How much time should I spend on sliding window prep?+
Sliding window shows up twice in LTI's set. It's often paired with arrays and sorting, not standalone. Master the expand-and-contract pattern, then practice it with constraints like 'cover X with a window'. Skip edge cases until day-of.
Is the hard problem typical of what LTI asks?+
The hard, Closest Subsequence Sum, is a multi-pattern problem: array, bit manipulation, two pointers, and DP all in one. It's harder than the mediums, but LTI doesn't seem to lean pure algorithms. Focus on the three mediums first. The hard is the 10 percent case.
Do I need to study dynamic programming for LTI?+
Only one problem, Closest Subsequence Sum, explicitly calls for DP, and it's the hard. It's paired with bitmask and bit manipulation. If DP isn't your strong suit, aim to solve the three mediums cleanly, then face the hard with a working outline and accept partial credit.
What's the fastest way to prep LTI in a week?+
Day 1-2: nail array and sorting patterns. Day 3-4: sliding window with binary search. Day 5-6: one run-through of the hard (Closest Subsequence Sum). Day 7: mock test under interview conditions. Most of LTI's test is medium-difficulty; mastery there covers 75 percent of your score.