Capgemini interview experience Real time questions & tips from candidates to crack your interview

Java Developer

Capgemini
upvote
share-icon
2 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Application story
I applied for this role on Naukri.com, and after a day or so, I received a call from HR, followed by two technical interviews.
Preparation
Duration: 6 Months
Topics: Java, Spring Boot, MySQL, Docker, AWS, DSA, HTML, CSS, JavaScript
Tip
Tip

Tip 1: Initially, spend some time on DSA.

Tip 2: For example, do at least two projects with a primary focus on understanding every detail and the tech stack.

Application process
Where: Naukri
Eligibility: 5 years of experience in Spring Boot. (Salary Package: 16 LPA)
Resume Tip
Resume tip

Tip 1: Add some strong projects to your resume.

Tip 2: Don't include any false information.

Interview rounds

01
Round
Medium
Face to Face
Duration60 minutes
Interview date21 Dec 2024
Coding problem4

1. HTTP Methods

Explain the difference between GET, POST, PUT and PATCH. and What's Idempotent?

2. Microservices

Explain Microservices. (Learn)

3. SAGA and CQRS design

Explain SAGA and CQRS design patterns.

4. Remove Duplicates from Sorted Array

Easy
15m average time
85% success
0/40
Asked in companies
WalmartAppleCognizant

You are given a sorted integer array 'arr' of size 'n'.


You need to remove the duplicates from the array such that each element appears only once.


Return the length of this new array.


Note:
Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory. 


For example:
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Try solving now
02
Round
Medium
Face to Face
Duration45 minutes
Interview date21 Dec 2024
Coding problem3

1. Subarray With Given Sum

Moderate
15m average time
85% success
0/80
Asked in companies
Paytm (One97 Communications Limited)Thought WorksAdobe

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Try solving now

2. Java Questions

  • What is Data Injection? 
  • Different annotations you used in your Java projects. Explain them. (Learn)

3. Project Based Questions

Explain the current project you are working on. What challenges did you face in this project?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
3509 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS Associates
389 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
1409 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
959 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Java Developer
3 rounds | 20 problems
Interviewed by Ernst & Young (EY)
5449 views
2 comments
0 upvotes
company logo
Java Developer
3 rounds | 16 problems
Interviewed by Infosys
21298 views
1 comments
0 upvotes
company logo
Java Developer
3 rounds | 15 problems
Interviewed by Infosys
59539 views
4 comments
0 upvotes