DXC Technology

American multinational B2B IT services provider.

4 Rounds ~21 Days Medium

Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

All Roles Backend Engineer 8 Data Engineer 4 Data Scientist 3 Frontend Engineer 2 Full Stack Engineer 6 Machine Learning Engineer 4 Software Engineer 8

All Topics Algorithms 8 System Design 7 Culture Fit 6 Core Java 4 Spring Boot 4 SQL 2 Leadership 1 Security 1

Backend Engineer • Coding • easy

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. Assume exactly one solution exists.

#Arrays #Hash Table

Practice

Backend Engineer • Coding • medium

Given a string s, find the length of the longest substring without repeating characters.

#Strings #Sliding Window #Hash Set

Practice

Backend Engineer • Coding • medium

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

#Arrays #Sorting

Practice

Backend Engineer • Coding • easy

Reverse a singly linked list. Provide both iterative and recursive solutions.

#Linked List #Recursion

Practice

Backend Engineer • Coding • medium

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

#Heap #Quickselect #Arrays

Practice

Backend Engineer • Coding • medium

Design and implement a data structure for Least Recently Used (LRU) cache. It should support get and put operations in O(1) time complexity.

#Design #Hash Table #Doubly Linked List

Practice

Backend Engineer • Coding • easy

Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.

#Strings #Hash Table

Practice

Backend Engineer • Coding • medium

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

#Trees #Breadth-First Search (BFS) #Queue

Practice

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now