Larsen & Toubro coding interview
questions, leaked.
2 problems reported across recent Larsen & Toubro interviews. Top patterns: array, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Larsen & Toubro's online assessment is lean and focused. You're looking at two reported problems, both easy difficulty, both solvable in under five minutes if you know the patterns. Arrays dominate the signal here. The good news: the bar is low enough that a solid foundation in array iteration and basic math covers most of what they're testing. The bad news: two problems means zero margin for error. If you blank on subarray logic mid-OA, StealthCoder runs invisibly and surfaces a working solution before the proctor notices.
Top problems at Larsen & Toubro
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Strictly Increasing or Strictly Decreasing Subarray | EASY | 100.0 | 65% | Array |
| 02 | Find the Sum of Encrypted Integers | EASY | 100.0 | 74% | Array · Math |
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 Larsen & Toubro OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoderArray problems represent your whole surface area. Both reported questions hinge on linear scans or window logic, not complex data structures. The first tests your ability to track state while iterating (consecutive comparisons). The second adds a light math component on top of array traversal. Neither requires sorting, hashing, or dynamic programming. This is a pattern-recognition game at the easy tier. Drill subarrays until the code flows automatically. Math is secondary and paired with array work, so don't isolate it. If you've solved 20 array problems on standard platforms, you'll recognize the shape. StealthCoder is your hedge for the one pattern you somehow missed in prep, not your primary defense.
Companies with similar patterns
If you prepped for Larsen & Toubro, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Larsen & Toubro.
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. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Larsen & Toubro interview FAQ
What should I study first for Larsen & Toubro's OA?+
Array iteration and subarray patterns. Both reported problems test this. Solve 10-15 easy array problems that involve traversals, state tracking across elements, and edge cases (single element, all increasing, all decreasing). Math topics are secondary and usually layered on top of array logic here.
Is two problems enough to predict the full assessment?+
No. Two reports are a weak signal. Assume the real OA has 3-4 problems spanning easy to medium difficulty. Use these two as anchors for array and math topics, but prep for breadth across basic data structures. Don't over-index on just these patterns.
How much time should I spend on math prep?+
Minimal. Math appears paired with array problems, not standalone. Spend 80 percent of your time on array mechanics (nested loops, pointers, state machines). The math component is usually digit manipulation or simple arithmetic, not number theory. Focus on the array first.
Should I use a hash table for these problems?+
Not based on the reported problems. Both lean on direct iteration. Hash tables are safer for medium-difficulty arrays, but the two reported questions solve cleanly with index-based logic and O(n) scans. Master the simple approach first.
How confident should I be going into this OA?+
Cautiously confident on difficulty, humble on coverage. All reported problems are easy, which is good. But only two data points means you're flying partially blind. Prep solid array fundamentals, assume one medium curveball, and rely on your foundation to adapt. That's the honest math.