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

GenC Elevate

Cognizant
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5-6 months
Topics: Data Structures, OOPS, Algorithms, Core Java, DBMS, SQL
Tip
Tip

Tip 1: Practise at least 5 coding questions daily
Tip 2: Do at least 2 projects
 

Application process
Where: Campus
Eligibility: 60% in 10th,12th and graduation.
Resume Tip
Resume tip

Tip 1 : Having at least one good project is necessary in which you have good knowledge about everything.
Tip 2 : Be honest don't put extra things just for filling resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date15 Jul 2021
Coding problem3

The exam started somewhat around 2 P.M. First there were MCQs and after attempting the MCQs there were three coding questions and at last two SQL questions. It was a properly proctored exam with a camera and mic on. Any suspicious activity would cancel your exam.

1. Number of ones in the smallest repunit

Moderate
30m average time
70% success
0/80
Asked in companies
AdobeAmazonExpedia Group

Given a positive integer ‘N’ whose unit digit is 3. Find the number of 1's in the smallest repunit, which is divisible by the given number N. Every number whose unit digit is 3 has a repunit as its multiple. A repunit is a number that has only 1. It is of the form (10 * N – 1)/9.

Try solving now
Moderate
0/80
Asked in companies
Thought WorksPaytm (One97 Communications Limited)Salesforce

Given an input string (STR), print all possible permutations of the input string.

Note:
The input string may contain the same characters, so there will also be the same permutations.
The order of permutations doesn’t matter.
Try solving now

3. Subarray Remainder

Moderate
15m average time
30% success
0/80
Asked in companies
FacebookCognizantAmazon

You are given an integer array 'A' of length 'N'. Your task is to find a subarray A[L, R] for which following conditions hold:

1 <= L < R <= N.
Let S = A[L] + A[L+1] + …. + A[R-1] + A[R], then S % K = 0.

Your task is to find whether there exists a subarray for which above conditions hold. If such a subarray is found, return 1, else return 0.

Try solving now
02
Round
Medium
Video Call
Duration40 minutes
Interview date5 Aug 2021
Coding problem3

This was a technical round Scheduled in the afternoon. I was waiting in the lobby, then a young man appeared on the screen and then wished me and asked how I was doing. I was nervous because It was going to be my first interview. He made me comfortable by talking very gently and he told me to start with my introduction. I introduced myself very nicely and then as I completed my introduction he started with my hobby which I mentioned about blogging, so he asked very curiously what topics you cover in your blogs. That made me very comfortable because I answered that part very confidently and that was the point where my interview started going well. Then he asked me questions from Computer Networking, there were around 3-4 questions from CN. I answered 2 questions out of 4. Then he asked me questions from OOPS. Started with the 4pillars of OOPS. I answered that very confidently. Then he further asked about overriding and overloading and other properties of OOPS like inheritance etc. Then he asked me a few questions from DBMS and OS I was able to answer most of them, maybe not accurately but still, he was satisfied, and after that, he told me to solve a switch case problem in the chat box. I solved the problem and then he asked me two apti questions and told me to solve them on paper and show the working with the answer and I solved both the apti questions. He asked that am I aware of any latest technology or not, then I told him about cloud storage and big data a little bit. So overall it was a very interactive and positive conversation, it was not that dull and boring type of an interview. The way he was responding I got the idea that he was impressed by me and I might get selected.

1. Conceptual Question

He asked me to solve a switch case problem in the chat box and the screen was being shared.

Problem approach

After listening to the conditions of the problem I started typing the logic and he was satisfied with the code.

2. DBMS Questions

1)What is normalization? Explain all types of Normalization.
2) ACID properties
3) Indexing.
4) Different types of keys.

Problem approach

Tip 1 : Read all the basics and fundamentals of DBMS.
Tip 2 : Practise SQL queries.
 

3. Operating System Questions

1) What is virtual Memory?
2) What is kernel?
3) What is a thread?
4) What is deadlock? Explain.

Problem approach

Tip 1 : OS fundamentals and basics should be clear.
Tip 2 : Study OS interview questions for last-minute preparations.
 

03
Round
Easy
HR Round
Duration20 minutes
Interview date27 Aug 2021
Coding problem1

HR round was scheduled around 10 in the morning and was just like a formality. The interviewer asked 4-5 straight HR questions nothing else. Explained each question in detail and depth. HR Interview was pretty easy for me. Top 20 HR questions helped. I practiced everything and wrote my own answer. I just revised that questions just before that Interview. Overall experience was pretty good.

1. Basic HR Questions

1) Why Cognizant?
2) Are you okay with any technology?
3) Are you okay with any location?
4) Your strengths.
 

Here's your problem of the day

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

Skill covered: Programming

To make an AI less repetitive in a long paragraph, you should increase:

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Cognizant
1746 views
1 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Cognizant
1063 views
0 comments
0 upvotes
company logo
Program Analyst
2 rounds | 6 problems
Interviewed by Cognizant
604 views
0 comments
0 upvotes
company logo
Programmer Analyst Trainee
3 rounds | 8 problems
Interviewed by Cognizant
773 views
0 comments
0 upvotes