Cognizant interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Cognizant
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Regarding DSA preparation, I have a theory. 20 percent of the questions will be asked in 80 percent of the interview and 80 percent of the questions will be asked in 20 percent of the interviews. In short, some questions have a very high chance of coming up during the interviews and some have very low chance. We should focus more on the questions that have more chance of coming up in the interview. You can find these questions on Striver SDE Sheet, InterviewBit, Leetcode 100 most liked, Leetcode 100 most important.
Tip 2 : Try to find patterns in the questions. Group them according to a pattern for better understanding. Make notes in Excel, word or hand written and revise them.
Tip 3 : Try to solve the questions that have more chance of coming up in the interview with many different approaches.
Application process
Where: Campus
Eligibility: Above 5 CGPA
Tip 1 : Make Sure that your resume is simple and also try to fit all the information in only one page.
Tip 2 : Have at least 2 projects with the latest technologies,Github link of projects should be provided
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date23 Apr 2022
Coding problem2
1. Intersection of Two Linked Lists
Easy
25m average time
73% success
0/40
Asked in companies
You are given two Singly Linked Lists of integers, which may have an intersection point.
Your task is to return the first intersection node. If there is no intersection, return NULL.
Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.
Problem approach
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If there is no merging, return -1.
2. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
02
Round
Easy
Video Call
Duration45 minutes
Interview date23 Apr 2022
Coding problem2
1. Networking Question
Explain what is DNS.
Problem approach
DNS is the Domain Name System. It is considered as the devices/services directory of the Internet. It is a decentralized and hierarchical naming system for devices/services connected to the Internet. It translates the domain names to their corresponding IPs.
2. Networking question
Explain why MAC addresses are required despite having IP addresses
Problem approach
MAC addresses and IP addresses operate on different layers of the internet protocol suite. MAC addresses are used to identify machines within the same broadcast network on layer 2, while IP addresses are used on layer 3 to identify machines throughout different networks.
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
SDE - 1
2 rounds | 5 problems
Interviewed by Cognizant
Selected 
1746 views
1 comments
0 upvotes
SDE - 1
2 rounds | 6 problems
Interviewed by Cognizant
Selected 1760 views
0 comments
0 upvotes
SDE - 1
2 rounds | 6 problems
Interviewed by Cognizant
Selected 1798 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Cognizant
Selected 909 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 6877 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6241 views
3 comments
0 upvotes