Courses

Jobs

Interviews

Discussions

Interviews
Companies
Capgemini

Capgemini Interview Guide

Showing 24 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Capgemini. The higher the ranking, the more likely you'll encounter it in a Capgemini interview.

Question

Frequency

Difficulty

Two Sum

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Arrays

Very likely

If you have a Capgemini interview, it's very likely that you will get this question

Easy

#1. Two Sum

Easy

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Arrays

This question is very likely to be asked in your Capgemini interview

Reverse Degree of a String

Given a string, find the most frequent character that appears earliest in the string. Return the length of the shortest substring that contains all occurrences of this character.

Strings

Very likely

If you have a Capgemini interview, it's very likely that you will get this question

Easy

#2. Reverse Degree of a String

Easy

Given a string, find the most frequent character that appears earliest in the string. Return the length of the shortest substring that contains all occurrences of this character.

Strings

This question is very likely to be asked in your Capgemini interview

Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicate elements in-place such that each unique element appears only once. Return the new length of the array.

ArraysTwo Pointers

Very likely

If you have a Capgemini interview, it's very likely that you will get this question

Easy

#3. Remove Duplicates from Sorted Array

Easy

Given a sorted array, remove the duplicate elements in-place such that each unique element appears only once. Return the new length of the array.

ArraysTwo Pointers

This question is very likely to be asked in your Capgemini interview

Count Elements With Maximum Frequency

Find the number of elements in an array that appear with the highest frequency. Essentially, count how many times the most frequent number occurs.

Arrays

Somewhat likely

If you have a Capgemini interview, you might get this question

Easy

#4. Count Elements With Maximum Frequency

Easy

Find the number of elements in an array that appear with the highest frequency. Essentially, count how many times the most frequent number occurs.

Arrays

This question is somewhat likely to be asked in your Capgemini interview

Best Time to Buy and Sell Stock

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

ArraysDynamic Programming

Somewhat likely

If you have a Capgemini interview, you might get this question

Easy

#5. Best Time to Buy and Sell Stock

Easy

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

ArraysDynamic Programming

This question is somewhat likely to be asked in your Capgemini interview

Move Zeroes

Given an array, rearrange it so that all zeros are moved to the end while maintaining the relative order of the non-zero elements.

ArraysTwo Pointers

Somewhat likely

If you have a Capgemini interview, you might get this question

Easy

#6. Move Zeroes

Easy

Given an array, rearrange it so that all zeros are moved to the end while maintaining the relative order of the non-zero elements.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Capgemini interview

Palindrome Number

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.

Somewhat likely

If you have a Capgemini interview, you might get this question

Easy

#7. Palindrome Number

Easy

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.

This question is somewhat likely to be asked in your Capgemini interview

Longest Substring Without Repeating Characters

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

StringsSliding WindowsTwo Pointers

Somewhat likely

If you have a Capgemini interview, you might get this question

Medium

#8. Longest Substring Without Repeating Characters

Medium

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

StringsSliding WindowsTwo Pointers

This question is somewhat likely to be asked in your Capgemini interview

Longest Common Prefix

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

Strings

Somewhat likely

If you have a Capgemini interview, you might get this question

Easy

#9. Longest Common Prefix

Easy

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

Strings

This question is somewhat likely to be asked in your Capgemini interview

Merge Two Sorted Lists

You're given two sorted lists. Combine them into a single sorted list containing all elements from both original lists.

Linked ListsRecursion

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Easy

#10. Merge Two Sorted Lists

Easy

You're given two sorted lists. Combine them into a single sorted list containing all elements from both original lists.

Linked ListsRecursion

This question is not likely to be asked in your Capgemini interview

Rotate Array

Given an array, rotate the elements to the right by a specified number of steps. The goal is to modify the original array in-place with the rotated elements.

ArraysTwo Pointers

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#11. Rotate Array

Medium

Given an array, rotate the elements to the right by a specified number of steps. The goal is to modify the original array in-place with the rotated elements.

ArraysTwo Pointers

This question is not likely to be asked in your Capgemini interview

Find First and Last Position of Element in Sorted Array

Given a sorted array, find the first and last position of a given target value. If the target is not found, return [-1, -1].

ArraysBinary Search

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#12. Find First and Last Position of Element in Sorted Array

Medium

Given a sorted array, find the first and last position of a given target value. If the target is not found, return [-1, -1].

ArraysBinary Search

This question is not likely to be asked in your Capgemini interview

Longest Happy String

Construct the longest possible string using limited quantities of 'a', 'b', and 'c', ensuring that no three consecutive characters are the same. Return the longest string satisfying this constraint.

StringsGreedy Algorithms

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#13. Longest Happy String

Medium

Construct the longest possible string using limited quantities of 'a', 'b', and 'c', ensuring that no three consecutive characters are the same. Return the longest string satisfying this constraint.

StringsGreedy Algorithms

This question is not likely to be asked in your Capgemini interview

Add Two Numbers

You are given two linked lists, each representing a non-negative integer. Add the two numbers and return the sum as a linked list.

Linked Lists

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#14. Add Two Numbers

Medium

You are given two linked lists, each representing a non-negative integer. Add the two numbers and return the sum as a linked list.

Linked Lists

This question is not likely to be asked in your Capgemini interview

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Easy

#15. Valid Parentheses

Easy

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

This question is not likely to be asked in your Capgemini interview

Coin Change

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.

ArraysDynamic Programming

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#16. Coin Change

Medium

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.

ArraysDynamic Programming

This question is not likely to be asked in your Capgemini interview

Longest Consecutive Sequence

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. These consecutive numbers do not need to be adjacent in the original array.

Arrays

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#17. Longest Consecutive Sequence

Medium

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. These consecutive numbers do not need to be adjacent in the original array.

Arrays

This question is not likely to be asked in your Capgemini interview

Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Hard

#18. Median of Two Sorted Arrays

Hard

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

This question is not likely to be asked in your Capgemini interview

Trapping Rain Water

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

ArraysTwo PointersDynamic ProgrammingStacks

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Hard

#19. Trapping Rain Water

Hard

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

ArraysTwo PointersDynamic ProgrammingStacks

This question is not likely to be asked in your Capgemini interview

Sort Colors

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers

Not likely

If you have a Capgemini interview, it's unlikely that you will get this question. Capgemini does ask it, but it's rare

Medium

#20. Sort Colors

Medium

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers