Bentley Systems Interview Questions, Process, and Tips for Experienced

1 hour, around 40 questions on well known aptitude topics.

Simple questions - overlapping area, bit manipulation

Q1. Simple program on printing even numbers, optimizing the code. Interviewer wanted to test your logical ability.
Add your answer

Q1. Three facts about you, you haven't mentioned in resume, why should we hire you etc..
Add your answer

Interviewed as part of college placements, first round consisted of aptitude and CS related MCQs;

20 MCQs, 1 RestAPI Problem, 1 Dp problem

Q1. Graphs, RestAPI, Linked list, Puzzle
Add your answer

Q1. Common Elements in two Sorted Linked List
Ans. 
Finding common elements in two sorted linked lists.
• Traverse both lists simultaneously using two pointers.

• Compare the values of the nodes pointed by the two pointers.

• If they are equal, add the value to the result list and move both pointers.

• If not, move the pointer pointing to the smaller value.

• Repeat until one of the lists is fully traversed.
Answered by AI
Add your answer
Q2. Kth element after merging two sorted arrays
Ans. 
Finding the Kth element after merging two sorted arrays.
• Merge the two sorted arrays into a single array.

• Sort the merged array.

• Return the Kth element from the merged and sorted array.
Answered by AI
Add your answer
Q3. A good amount of OOPS?DBMS questions, small keywords used in project, data flow in projects were asked
Add your answer

Q1. Detailed concepts about OOPS and DBMS
Ans. 
OOPS is a programming paradigm based on objects while DBMS is a software system for managing databases.
• OOPS focuses on encapsulation, inheritance, and polymorphism

• DBMS manages data through CRUD operations and supports ACID properties

• Examples of OOPS languages include Java, C++, and Python

• Examples of DBMS include MySQL, Oracle, and SQL Server
Answered by AI
Add your answer
Q2. Detailed study and questions about project.
Add your answer

Q1. Knowledge about latest technologies
Add your answer
Q2. Why they should hire me?
Add your answer
Q3. Why oracle? followed by questions from computer networks, OOPS, DBMS and a bit from major CS fundamentals.
Add your answer

String manipulation problems from geeks for geeks with some medium and hard problems in DSA from leetcode

Q1. String manipulation and tree twisted problems
Add your answer
Q2. Some 2d matrix popular problems like sudoku
Add your answer
Q3. Graph basic level implementation
Ans. 
Graph implementation involves creating nodes and edges to represent data and relationships.
• Nodes represent data points and edges represent relationships between them

• Graphs can be directed or undirected

• Common graph algorithms include BFS, DFS, and Dijkstra's algorithm
Answered by AI
Add your answer

Q1. Puzzles to test decision making abilities
Add your answer
Q2. Some theory technical questions in Java and springboot.
Add your answer
Q3. What is string pool ?
Ans. 
String pool is a cache of string literals stored in memory for efficient reuse.
• String pool is a part of Java's memory management system.

• It stores a collection of unique string literals to save memory.

• When a new string is created, it is first checked in the pool and reused if already present.

• String pool can be accessed using the intern() method.

• Example: String s1 = "Hello"; String s2 = "Hello"; s1 and s2 will point to t
Answered by AI
Add your answer
Q4. Why strungs are not mutavle in java ?
Ans. 
Strings are immutable in Java to ensure thread safety and prevent unintended changes.
• Immutable objects are safer to use in multi-threaded environments

• String pool optimization is possible because of immutability

• StringBuffer and StringBuilder classes are available for mutable string operations
Answered by AI
View 1 more answer

Q1. Basic discussion like salary and other benefit
Add your answer
Q2. Why you choose oracle ?
Add your answer
Q3. How you overcome challenges?
Add your answer

Conducted on their platform for 120 minutes

Q1. I was asked to find subarray Max Sum
Add your answer
Q2. I was asked to find diameter of a binary Tree
Ans. 
To find the diameter of a binary tree, we need to find the longest path between any two nodes in the tree.
• Traverse the tree recursively and calculate the height of the left and right subtrees.

• Calculate the diameter of the left and right subtrees recursively.

• The diameter of the tree is the maximum of the following three values: 1. Diameter of the left subtree 2. Diameter of the right subtree 3. Height of the left sub...read more
Answered by AI
Add your answer

Q1. DBMS, Computer Networks and Operating System Questions
Add your answer

Q1. Mainly on cloud, microservices and distributed processing
Add your answer

Questions were easy to moderate level from leetcode

Q1. I didn't get selected, but if you clear the 1st round coding and aptitude aswell then you will be allowed to this round, some 25 to 30 were selected and 6 were given offer letter.focus on coding aswell as ...read more
Add your answer