Filter interviews by
Clear (1)
Top trending discussions
I was interviewed before Feb 2023.
It's just to access candidates vocabulary , logical and reasoning skills
I applied via Campus Placement and was interviewed in Apr 2021. There were 3 interview rounds.
Test cases for Facebook
Verify login functionality with valid credentials
Verify login functionality with invalid credentials
Verify user can post a status update
Verify user can upload a photo
Verify user can send a friend request
Verify user can accept a friend request
Verify user can search for a friend
Verify user can join a group
Verify user can create a group
Verify user can like a post
Verify user can comment on a post
Veri
I applied via Referral and was interviewed before Jan 2023. There were 3 interview rounds.
Logical Reasoning, Questions on distances, Questions on directions
1- Difference between array list and linked list.
2- Reverse the linked list
1-Difference between Arraylist and Linked list.
2-Check if strings are anagram.
I applied via Walk-in and was interviewed before Oct 2021. There were 2 interview rounds.
Good technical round, you can manage, mainly Java questions used to come
Hackerrank algorithms and ds test
UML class diagram is a visual representation of classes, attributes, methods, and relationships in a system.
Classes are represented as boxes with three compartments for class name, attributes, and methods.
Attributes are listed in the second compartment with their data types.
Methods are listed in the third compartment with their parameters and return types.
Relationships between classes are shown using lines with arrows ...
Competency based questions
I applied via Job Portal and was interviewed in Mar 2024. There were 2 interview rounds.
Know your resume and your basics
Know class diagrams. Very Huge for workday.
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 ...
based on 3 reviews
Rating in categories
Order Management Specialist
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Generation Specialist
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Trimble
Geotab
Verizon Connect
Yodlee