Filter interviews by
Clear (1)
I was interviewed in Oct 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.
Round duration - 60 minutes
Round difficulty - Medium
The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.
Determine the sum of all N-digit palindromes for a given integer 'N'. A palindrome is defined as a number that remains the same when its digits are reversed.
...
Sum of all N-digit palindromes for a given integer N.
Generate all N-digit palindromes by iterating through digits 1 to 9 and appending the reverse of the number
Calculate the sum of all generated palindromes
Return the sum as the final result
Round duration - 45 minutes
Round difficulty - Medium
This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.
Tip 1 : Practice at least 5-7 Codes daily from the beginning of preparation.
Tip 2 : Be thoroughly prepared with concepts of Data Structure, Database and Operating System
Tip 3 : Always go through the Company's Job description and About the Company and prepare your answers according to that
Tip 4 : Only mention Projects that you've complete idea about.
Tip 1 : Have a few Projects on your resume and make sure you know it all about your Projects.
Tip 2 : Only mention the Skills you feel you are confident about. Never lie on your resume.
Top trending discussions
posted on 11 Mar 2022
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
This was a test round where 10 aptitude based questions were to be solved in 60 minutes
Round duration - 60 minutes
Round difficulty - Medium
They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers along with alphabets while reversing the string.
Ensure to consider the constraints provided in th...
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Implement a function to find K largest elements in an unsorted array in non-decreasing order.
Create a min heap of size K and insert the first K elements of the array
For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify
Finally, the heap will contain the K largest elements in non-decreasing order
Given a string str
and a character 'X', develop a function to eliminate all instances of 'X' from str
and return the resulting string.
The first lin...
Develop a function to remove all instances of a given character from a string.
Iterate through the string and build a new string excluding the specified character.
Use a StringBuilder or similar data structure for efficient string manipulation.
Handle edge cases like empty string or character not found in the input string.
Ensure the function completes within the given time constraint.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and column to determine the numbers to print
Use a combination of spaces and numbers to align the pattern correctly
Increment the numbers in each row based on the row number
Round duration - 60 minutes
Round difficulty - Easy
Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
An integer ‘T’ denoting the number o...
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the tree in postorder fashion and swap the left and right children of each node.
Use recursion to solve the problem efficiently.
Modify the binary tree in place without creating a new tree.
Given an array ARR
consisting of N
integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.
The first line of the input cont...
Implement the Heap sort algorithm to arrange an array in non-decreasing order.
Implement the Heap sort algorithm to sort the given array in non-decreasing order
Use a max heap to sort the array in non-decreasing order
Time complexity of Heap sort is O(n log n)
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.
Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.
Examples of indexes in...
Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.
Use Hash Table for fast lookups and insertions with O(1) average time complexity.
Use B Tree for range queries and ordered traversal with O(log n) time complexity.
Consider the size of the dataset and the specific operations needed to determine the best data structure.
Round duration - 30 minutes
Round difficulty - Easy
This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.
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.
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 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 am a software engineer with experience in developing web applications and a passion for learning new technologies.
Experienced in developing web applications using technologies such as React, Node.js, and MongoDB
Passionate about learning new technologies and keeping up with industry trends
Strong problem-solving skills and ability to work well in a team environment
I was involved in various extracurricular activities such as volunteering, sports, and coding clubs.
Volunteered at local animal shelter
Played on intramural basketball team
Participated in coding competitions
Organized and led coding club at school
I am open to working in any location, but I prefer cities with a vibrant tech community.
Open to any location
Prefer cities with a vibrant tech community
based on 2 reviews
Rating in categories
Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
System Engineer
533
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
402
salaries
| ₹0 L/yr - ₹0 L/yr |
Automation Test Engineer
362
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
300
salaries
| ₹0 L/yr - ₹0 L/yr |
Siemens
Veradigm
McKesson
Siemens Healthineers