i
Apisero
Filter interviews by
Aptitude,reasoning,verbal,C language,Java,C++
I appeared for an interview before Feb 2023.
Good and easy learn dsa and algo
Learn dsa and algo binary tree and lists
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
3 Questions of mid difficulty
2 questions of mid to hard difficulty
Design and implement a dictionary application for easy word lookup
Define data structure to store words and their meanings
Implement search functionality to look up words quickly
Include features like word suggestions, synonyms, and antonyms
Allow users to add new words and meanings to the dictionary
Consider implementing a user-friendly interface for easy navigation
I appeared for an interview in Jan 2022.
Round duration - 90 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 ...
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
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 is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 25 minutes
Round difficulty - Easy
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
I applied via Google and was interviewed in Mar 2021. There was 1 interview round.
posted on 2 Feb 2022
There was online aptitude test
There was pattern design coding
posted on 22 Jun 2022
I applied via Campus Placement and was interviewed in May 2022. There were 2 interview rounds.
I am a software developer with experience in web development and a passion for problem-solving.
Experienced in web development using HTML, CSS, and JavaScript
Proficient in programming languages such as Java and Python
Familiar with frameworks like React and Angular
Strong problem-solving and analytical skills
Ability to work well in a team and communicate effectively
posted on 26 Apr 2024
I applied via Approached by Company and was interviewed in Oct 2023. There was 1 interview round.
posted on 10 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 3 interview rounds.
Good questions and dsa arrays and string questions
I applied via Naukri.com and was interviewed in Mar 2023. There were 3 interview rounds.
String related functions,virtual functions and STL concepts
based on 3 interviews
Interview experience
based on 6 reviews
Rating in categories
Senior Software Engineer
778
salaries
| ₹5.5 L/yr - ₹21.6 L/yr |
Software Engineer
380
salaries
| ₹3 L/yr - ₹10.9 L/yr |
Lead Engineer
208
salaries
| ₹7.8 L/yr - ₹24.2 L/yr |
Senior Leader Engineer
111
salaries
| ₹10.5 L/yr - ₹30.6 L/yr |
Associate Solution Architect
71
salaries
| ₹16.8 L/yr - ₹38.5 L/yr |
Accenture
Actalent Services
Cyber Infrastructure
TestingXperts