Filter interviews by
I was interviewed in Aug 2024.
Video creativity development
Video great video development
Python Java data sense
Video greater under technology
Top trending discussions
I applied via Company Website and was interviewed before Aug 2022. There were 3 interview rounds.
Reverse a given string using for loop
I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.
To find the middle of a linked list in one iteration, use two pointers with different speeds.
Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.
Move the slow pointer one step at a time and the fast pointer two steps at a time.
When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.
A binary tree is a data structure consisting of nodes, where each node has at most two children.
Binary tree is used to represent hierarchical relationships between nodes
Traversal of binary tree can be done in three ways: inorder, preorder, postorder
Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent
Balanced binary tree has height difference of at most 1 between...
I applied via Campus Placement and was interviewed in Aug 2022. There was 1 interview round.
Data structures are used to organize and store data efficiently. Time complexity is the measure of efficiency.
Arrays - O(1) for access, O(n) for search and insertion
Linked Lists - O(n) for access, O(1) for insertion and deletion
Stacks - O(1) for access, insertion and deletion
Queues - O(1) for access, insertion and deletion
Trees - O(log n) for access, insertion and deletion
Hash Tables - O(1) for access, insertion and de
Binary trees are classified based on the number of children each node can have.
Full binary tree: every node has either 0 or 2 children
Complete binary tree: all levels except possibly the last are completely filled, and all nodes are as far left as possible
Perfect binary tree: all internal nodes have two children and all leaf nodes are at the same level
Balanced binary tree: the difference in height between the left and ...
posted on 25 Oct 2024
Find repeated numbers in arrays of strings
Iterate through each string in the array
Convert each string to an array of numbers
Use a hash map to track the frequency of each number
Identify and return the repeated numbers
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2022. There were 3 interview rounds.
Written test on Basics of c and c++ is asked.
Also be thorough with mathematical topics like vectors,calculus.
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
Topics were on dbms, dsa and oops mostly
based on 1 interview
Interview experience
Software Engineer
238
salaries
| ₹0 L/yr - ₹0 L/yr |
Advanced Software Engineer
99
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
79
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Dassault Systemes
Autodesk
PTC
Bentley Systems