Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Jan 2021. There were 4 interview rounds.
Top trending discussions
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
posted on 11 Mar 2022
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
10 Aptitude questions with difficulty level hard were asked in this test.
The minimum number of planes required to go around the world is one.
One plane can fly around the world without needing to stop.
The plane can refuel mid-air or carry enough fuel for the entire journey.
Examples: Non-stop flights like the Boeing 787 Dreamliner or Airbus A350 can circumnavigate the globe with one plane.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N * N matrix, find the position of a target integer 'X'.
Start from the top-right corner of the matrix and compare the target with the element at that position.
Based on the comparison, move left or down in the matrix to narrow down the search.
Repeat the process until the target is found or the search goes out of bounds.
Return the position of the target if found, else return {-1, -1}.
Ninja has a number 'N'. Your task is to generate a pattern where the outer rectangle is filled with the number 'N', and as you move inward, the numbers decrease conse...
Generate a pattern with outer rectangle filled with number 'N' and decreasing consecutively inward.
Start by filling the outermost rectangle with the number 'N'.
Decrease the numbers consecutively as you move inward towards the center.
Continue this pattern until you reach the center of the rectangle.
Round duration - 60 minutes
Round difficulty - Medium
DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
The fir...
Yes, the binary array sorting problem can be solved in linear time and constant space using a single traversal.
Use two pointers approach to swap 0s to the left and 1s to the right.
Maintain two pointers, one for 0s and one for 1s, and swap elements accordingly.
Example: Input: [1, 0, 1, 0, 1], Output: [0, 0, 1, 1, 1]
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
Iterate through the array from right to left and use a stack to keep track of elements.
Pop elements from the stack until a greater element is found or the stack is empty.
Store the next greater element for each element in the output array.
BST is a binary tree structure where each node has at most two children, while Tries are tree structures used for storing strings.
BST is used for searching, inserting, and deleting elements in a sorted manner.
Tries are used for storing and searching strings efficiently.
BST has a hierarchical structure with left and right child nodes.
Tries have nodes representing characters, forming a tree-like structure for strings.
Exa...
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
You are provided with an integer array/list ARR
of length N. Your task is to determine if it is possible to construct at least one non-degenerate triangle using the value...
Check if it is possible to form a non-degenerate triangle using the sides provided in the array.
Check if the sum of any two sides is greater than the third side for all combinations.
If any such combination exists, return true; otherwise, return false.
Handle multiple test cases as per the constraints provided.
Round duration - 30 minutes
Round difficulty - Easy
Behavioral questions and team skills were discussed in this round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
I was interviewed in Sep 2016.
Developed a web application for tracking student attendance and performance
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Integrated authentication and authorization features for secure access
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MongoDB and MySQL
Familiar with version control systems like Git and deployment tools like Docker
Strong problem-solving skills and ability
My hobbies include hiking, playing guitar, and reading science fiction novels.
Hiking in local trails and national parks
Playing acoustic and electric guitar in a band
Reading books by authors like Isaac Asimov and Philip K. Dick
Cognizant offers diverse projects, global exposure, and a strong focus on employee growth and development.
Cognizant provides opportunities to work on diverse projects, allowing for a broad range of experience.
The company has a global presence, offering exposure to different cultures and markets.
Cognizant emphasizes employee growth and development through training programs and career advancement opportunities.
Engineering allows me to solve complex problems, innovate, and create solutions that have a real impact on society.
Engineering provides a platform to apply scientific knowledge to practical problems.
It involves critical thinking, problem-solving, and creativity.
Engineers have the opportunity to work on cutting-edge technologies and make a tangible difference in the world.
For example, designing software systems to impro...
Pin diagram of 8085 microprocessor
8085 has 40 pins in total
Pins are grouped into 5 categories: power supply, address bus, data bus, control and status signals
Pin 1 is the reset pin, Pin 40 is the Vcc pin
Examples of control signals: RD, WR, ALE, INT, HOLD
Examples of status signals: S0, S1, IO/M, HLDA
8086 is an advanced version of 8085 with more features and capabilities.
8086 has a 16-bit data bus while 8085 has an 8-bit data bus.
8086 has more registers than 8085.
8086 has a higher clock speed than 8085.
8086 supports virtual memory while 8085 does not.
8086 has a more advanced instruction set than 8085.
Example: 8086 can perform multiplication and division operations while 8085 cannot.
Opamp stands for operational amplifier. It is an electronic device used to amplify and process signals.
Opamps have high gain and can amplify signals to a very high degree.
They are commonly used in audio amplifiers, filters, and signal processing circuits.
Opamps have two input terminals and one output terminal.
They can be configured in different ways to perform various functions such as amplification, filtering, and osc...
Waterfall model has five phases: requirements, design, implementation, testing, and maintenance.
Requirements phase: gathering and documenting requirements
Design phase: creating a detailed design based on requirements
Implementation phase: coding and integrating components
Testing phase: verifying that the system meets requirements
Maintenance phase: making changes and updates to the system
Example: building a website using...
Types of testing include unit, integration, system, acceptance, regression, performance, and security testing.
Unit testing: testing individual units or components of the software
Integration testing: testing how different units or components work together
System testing: testing the entire system as a whole
Acceptance testing: testing to ensure the software meets the requirements and is ready for release
Regression testing...
I enjoy participating in coding competitions, volunteering at tech events, and attending hackathons.
Participating in coding competitions such as Codeforces or Topcoder
Volunteering at tech events like hackathons or coding workshops
Attending hackathons to collaborate with other developers and work on innovative projects
My goal in life is to continuously learn and grow, while making a positive impact on the world around me.
Continuous learning and personal growth
Making a positive impact on the world
Achieving work-life balance
Building meaningful relationships
Contributing to the community
I am open to relocation for the right opportunity.
I am willing to relocate for the job.
I have no issues moving to a new location for work.
I am excited about the possibility of experiencing a new city or country.
I have relocated for previous jobs and have found it to be a positive experience.
I want to relocate for career growth and new experiences, but I am hesitant due to leaving behind family and friends.
Career growth opportunities in new location
Desire for new experiences and challenges
Concerns about leaving behind family and friends
I enjoy watching a variety of shows on TV, including dramas, comedies, and documentaries.
I watch dramas like Grey's Anatomy and This Is Us
I enjoy comedies such as The Office and Brooklyn Nine-Nine
I also like watching documentaries on topics like nature and history
I last saw the movie Inception.
Directed by Christopher Nolan
Released in 2010
Genre: Sci-Fi/Thriller
Starring Leonardo DiCaprio
I was interviewed in Sep 2016.
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies like HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge in algorithms and data structures
Passionate about learning new technologies and solving complex problems
My favorite subject is computer science because I enjoy problem-solving and creating innovative solutions.
Computer science allows me to work on challenging problems and develop new technologies.
I enjoy coding and building software applications.
I find the intersection of technology and creativity fascinating.
Computer science offers endless opportunities for learning and growth.
The query finds the employee name who earns the maximum salary.
Use the SELECT statement to retrieve the employee name and salary from the database table.
Use the ORDER BY clause to sort the results in descending order based on salary.
Use the LIMIT clause to limit the result to only one row.
Return the employee name from the query result.
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in front-end development using HTML, CSS, and JavaScript
Proficient in back-end development with Node.js and Express
Familiar with database management systems like MySQL and MongoDB
Favorite Game: The Legend of Zelda: Breath of the Wild, Favorite Player: Lionel Messi
Favorite Game: The Legend of Zelda: Breath of the Wild
Favorite Player: Lionel Messi
I am comfortable working night shifts and have no problem with it.
I have experience working night shifts in previous roles.
I am able to adjust my sleep schedule accordingly to accommodate night shifts.
I am aware of the potential challenges of working night shifts and have strategies to overcome them.
Yes, I am comfortable working outside Kolkata.
I am open to new opportunities and experiences in different locations.
I am adaptable and can easily adjust to new environments.
I have previous experience working in different cities, such as Delhi and Bangalore.
based on 1 review
Rating in categories
Analyst
80
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Claims Adjudicator
69
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Oracle Cerner
McKesson
Veradigm
Athenahealth Technology