DXC Technology

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

Software Engineer Coding easy

Write a function to find the first non-repeating character in a string and return its index. If it doesn't exist, return -1.

#Strings #Hash Tables
Software 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
Software Engineer Coding easy

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

#Stacks #Strings
Software Engineer Coding medium

Find the longest substring without repeating characters in a given string.

#Sliding Window #Hash Tables #Strings
Software Engineer Coding easy

Write a program to detect if a cycle exists in a linked list.

#Linked Lists #Two Pointers
Software Engineer Coding medium

Given an array of strings, group the anagrams together. You can return the answer in any order.

#Hash Tables #Strings #Sorting
Software Engineer Coding easy

Implement a binary search algorithm to find a target value in a sorted array.

#Binary Search #Arrays
Software 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 #Queues

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