i
Bentley Systems
Filter interviews by
3 question . . . . . . . . . . .
2 questions . . . . . . . .
Top trending discussions
I applied via Cocubes and was interviewed before Mar 2023. There were 3 interview rounds.
MCQ Questions on programming languages like C#, Java
posted on 6 Mar 2024
posted on 20 Mar 2023
I applied via Campus Placement and was interviewed before Mar 2022. There were 4 interview rounds.
Basic Coding Problems, 3 questions
Developed a web-based project management system using PHP and MySQL
Designed and developed a database schema for the project
Implemented user authentication and authorization using PHP sessions
Used HTML, CSS, and JavaScript for the front-end
Used AJAX for dynamic content loading
Deployed the application on Apache web server
Used Git for version control
posted on 11 Jun 2022
I applied via LinkedIn and was interviewed in Dec 2021. There was 1 interview round.
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
Topics were on dbms, dsa and oops mostly
It was like 5 MCQ and two coding questions with difficult level of moderate
React components go through various stages in their life cycle, from initialization to destruction.
Initialization: Component is created and initialized with default props and state.
Mounting: Component is rendered on the DOM for the first time.
Updating: Component re-renders when props or state change.
Unmounting: Component is removed from the DOM.
Examples: componentDidMount() for mounting, componentDidUpdate() for updati
based on 1 interview
Interview experience
Software Engineer Level 1
88
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Autodesk
Dassault Systemes
Siemens PLM Software
Trimble