Filter interviews by
I applied via Referral and was interviewed in Nov 2021. There were 3 interview rounds.
Programming questions on printing numbers and manipulating strings.
For printing 1,5,10,...,100, use a loop and increment the number by 4 in each iteration.
For printing Fibonacci series, use a loop and add the previous two numbers to get the next number.
For printing last 3 words of every string in an array, split each string into words and print the last three words.
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
posted on 4 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
Online technical aptitude test
I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, basics. easy, some important topics in python and sql
I applied via AmbitionBox and was interviewed in Dec 2021. There were 2 interview rounds.
I appeared for an interview in Jan 2021.
Round duration - 40 minutes
Round difficulty - Easy
Given a singly linked list of integers, your task is to implement a function that returns the index/position of an integer value 'N' if it exists in the linked list. Return -1 i...
Implement a function to find the index of a given integer in a singly linked list.
Traverse the linked list while keeping track of the index of each element.
Compare each element with the target integer 'N'.
Return the index if 'N' is found, otherwise return -1.
Handle cases where the list is empty or 'N' is not found.
Consider the constraints on the number of test cases and the length of the linked list.
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in constant time complexity (O(1)).
Handle edge cases like empty stack appropriately.
Example: For input '5', '3 10', '5', '1', '2', '4', the output should be '10', '1'...
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 ...
Detect if a singly linked list has a cycle using O(N) time complexity and O(1) space complexity.
Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list
Maintain two pointers, slow and fast, moving at different speeds
If there is a cycle, the two pointers will eventually meet
If one of the pointers reaches the end of the list (null), there is no cycle
Round duration - 20 minutes
Round difficulty - Easy
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...Return the top view of a binary tree given in level-order format.
Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the first node encountered at each distance.
Return the values of the nodes stored in the map in sorted order of their horizontal distance.
Example: For the given binary tree, th...
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Tip 1 : Practice Questions as much as you can
Tip 2 : Do at least 2 projects
Tip 3 : Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview.
Tip 4 : Also, try to implement it yourself without seeing the solution.
Tip 5 : Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Tip 1 : Keep your resume short and up to mark and check spellings before submitting it for the interview process.
Tip 2 : Have projects and internships on your resume
Tip 3 : Never lie in your resume
I applied via Naukri.com and was interviewed in Feb 2022. There were 4 interview rounds.
Create a CRUD application
I applied via Campus Placement
Aptitude test was easy level and moderate level.
Coding test was held in the google form which was very easy.
Abstract classes are used to provide a common interface and partial implementation for related classes.
Abstract classes are used when you want to create a base class that cannot be instantiated on its own but can be inherited by other classes.
They are useful when you want to define common methods and properties that multiple related classes should have.
Abstract classes can have both abstract and non-abstract methods.
Ab...
I applied via Campus Placement
Basic Questions, Puzzle, Logical
Mainly on some common dsa and loop questions
The volume of a cabin refers to the amount of space inside the cabin.
Volume can be calculated by multiplying the length, width, and height of the cabin.
For example, if a cabin is 10 feet long, 8 feet wide, and 6 feet high, the volume would be 480 cubic feet.
Volume is often measured in cubic units such as cubic feet or cubic meters.
based on 11 reviews
Rating in categories
Solution Engineer
121
salaries
| ₹5.5 L/yr - ₹13.7 L/yr |
Senior Solution Engineer
62
salaries
| ₹6 L/yr - ₹17 L/yr |
Technical Support Engineer
57
salaries
| ₹2.8 L/yr - ₹5.6 L/yr |
Technical Engineer
46
salaries
| ₹2.8 L/yr - ₹5.3 L/yr |
Software Development Engineer II
41
salaries
| ₹17 L/yr - ₹34.8 L/yr |
Chegg
Tekwissen
Softenger
Knight Frank