DXC Technology coding interview
questions, leaked.
3 problems reported across recent DXC Technology interviews. Top patterns: array, two pointers, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
DXC Technology's assessment is shallow but fast. With only 3 problems on record, both at easy and medium difficulty, you're looking at a sprint, not a marathon. The catch: they're drilling fundamentals hard. Array manipulation appears twice, two-pointers shows up in multiple problems, and string work rounds it out. You won't see hard problems here, but you will see if you can execute cleanly under time pressure. If you freeze mid-problem, StealthCoder runs invisibly during the assessment and surfaces a working solution in seconds.
Top problems at DXC Technology
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Common Prefix | EASY | 100.0 | 45% | String · Trie |
| 02 | Sort Array By Parity | EASY | 100.0 | 76% | Array · Two Pointers · Sorting |
| 03 | Rotate Array | MEDIUM | 100.0 | 43% | Array · Math · Two Pointers |
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 DXC Technology OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoderThe topic distribution is tight and predictable. Array problems dominate (2 appearances), and two-pointers is woven through almost everything. Sorting and math show up once each, likely as sub-patterns within the array problems. String work, via the Longest Common Prefix problem, tests trie knowledge at an easy level, meaning it's checking if you know the pattern, not if you can optimize it. Start with the array and two-pointers problems because they're your bread and butter here. String and trie are lower friction. The difficulty skew toward easy means execution speed and clean code matter more than algorithmic insight. If you blank on a two-pointers or trie variant live, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for DXC Technology, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass DXC Technology.
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 by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
DXC Technology interview FAQ
How much time should I spend on array and two-pointers prep for DXC?+
Both topics appear multiple times in their problem set. Spend 60 percent of your prep on array manipulation and two-pointer techniques. The other 40 percent covers string, trie, and math. Since difficulty skews easy, focus on clean, bug-free implementations rather than advanced optimizations.
Do I need to study tries for this assessment?+
Yes, but lightly. The Longest Common Prefix problem requires trie knowledge, but it's marked easy, meaning you don't need advanced trie logic. Understand the basic structure and how to insert and search. One solid trie problem walkthrough is enough.
Should I worry about hard problems for DXC?+
No. Zero hard problems appear in their reported set. All three are easy or medium. Prioritize mastering the fundamentals cleanly rather than grinding advanced techniques. Speed and accuracy trump complexity here.
What's the fastest way to prep for this assessment?+
Solve the three reported problems multiple times until you can code them without hesitation. Then drill 5 to 10 more array and two-pointer variants to build pattern recognition. You're looking at 8 to 12 hours of solid prep, not weeks.
Is sorting important for DXC's interview?+
It appears once, as a sub-topic in the Sort Array By Parity problem. Understand when and how to use two-pointers as a sorting alternative, but don't spend time on quicksort or merge sort deep dives. The focus here is practical, in-place manipulation.