Filter interviews by
I was interviewed in Nov 2021.
Round duration - 25 Minutes
Round difficulty - Medium
The round was very good i performed really very well. The interviewer was quite polite. He asked me many questions and i almost gave all the answers.
Round duration - 50 Minutes
Round difficulty - Easy
Tech + HR round
You are provided with an integer array ARR
of size N
along with two integers A
and B
. Your task is to determine if there exist two distinct indices in...
Approach: The basic approach to this question will be to simply use two loops and check for each possible pair of indices if it follows the given rule or not.
Algorithm:
Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions
Tip 2 : Revise data structures and algorithms.
Tip 3 : Revise HTML,CSS,JS.
Tip 4 : Be confident.
Tip 1 : Don't make it too lengthy.
Tip 2 : Mention all your skills.
Tip 3 : Mention all your projects.
Tip 4 : Don't put false things in your resume.
I was interviewed in Oct 2021.
Round duration - 40 minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Round duration - 45 Minutes
Round difficulty - Easy
Tech +HR round
Given an array called levelOrder
consisting of 'N' elements, this array represents the level order traversal of a Binary Search Tree (BST). Your task is to cons...
Tip 1 : Revise data structures and algorithm.
Tip 2 : Revise HTML, CSS, JS and show your projects.
Tip 3 : Be confident.
Tip 1 : Mention your projects
Tip 2 : Put things in chronological order.
I was interviewed before Nov 2020.
Round duration - 30 Minutes
Round difficulty - Medium
The interview and the interviewer were pretty good. The time was about 4pm. The environment was very good and the interviewer was very calm and humble. He asked me a question in which I was stucked but he gave me a small hint and then i gave the answer of that question.
The task is to determine the index of the last occurrence of a specified element x
within an array that may contain duplicate elements. If the element is not present, return -1.
Tip 1 : Prepare HTML, CSS, and JS thoroughly.
Tip 2 : Revise Data Structures.
Tip 3 : Revise your project if any.
Tip 1 : Mention all your great achievements.
Tip 2 : Mention your projects.
Tip 3 : Mention if you have previously did any internship.
Top trending discussions
I know multiple programming languages including Java, Python, and C++.
Proficient in Java with experience in developing web applications using Spring framework
Familiar with Python for data analysis and machine learning
Experience in C++ for developing high-performance applications
Also familiar with HTML, CSS, and JavaScript for front-end development
Class is a blueprint for creating objects, encapsulation is the process of hiding data and methods within a class.
Class is a template or blueprint that defines the properties and behaviors of an object.
Encapsulation is the process of bundling data and methods together within a class, hiding the internal details from the outside world.
Other features of OOP include inheritance, polymorphism, and abstraction.
Inheritance a...
Program to find the sum of squares of each term of Fibonacci series
Generate Fibonacci series using loop or recursion
Calculate square of each term
Add all squares to get the sum
I would like to join Cognizant because of its reputation as a leading global technology and consulting company.
Cognizant has a strong presence in the industry and is known for its innovative solutions.
I am impressed by Cognizant's commitment to digital transformation and its ability to deliver value to clients.
The company offers excellent career growth opportunities and a supportive work environment.
Cognizant's diverse...