Oracle Associate Solutions Engineer Interview Questions and Answers

Arrays and strings - 90 mins

Create Modules, railway reservation system - 60 mins

Q1. Difference between hashmap and hasptable
Add your answer
Q2. Why typescript over javascript
Add your answer
Q3. Find the percentage of increace in the quantity of item after making it price 20% extra
Add your answer
Q4. What is normalization
Add your answer
Q5. Date and time api available
Add your answer

It was an amazing interview.

S abJDQdlqd qk; qdkq;q bdkq;d

Q1. Dbjas xjhqvUGQJQ mnq
Add your answer
Q2. Add qbnjq j qj slx qx
Add your answer
Q3. DaD JDQ d KNX ax sqkd
Add your answer
Q4. Bj q dsa k xkqs xkna ;x
Add your answer
Q5. DJ m qd s Jhdvaljcbaf
Add your answer

Basic DSA from the hacker rank website

Q1. Basic to medium questions on javascript, nodejs, MySQL joints, html5 tags
Add your answer

Q1. Real life problems, Use cases
Add your answer

LeetCode , hard questions on dynamic programming, graphs, and more.

DSA, Cn, os, DBMS, ML

Q1. Is relocation a possibility for this position?
Add your answer
Q2. Senior role is there
Add your answer

Q1. What are the key concepts of Object-Oriented Programming (OOP)?
Ans. 
Key concepts of OOP include encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (object).

• Inheritance: Allowing a class to inherit properties and behavior from another class.

• Polymorphism: Objects of different classes can be treated as objects of a common superclass.

• Abstraction: Hiding complex implementation details and showing onl
Answered by AI
Add your answer
Q2. What is the internal working mechanism of a HashMap?
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.

• If multiple keys hash to the same index (collision), a linked list is used to store these pairs.

• To retrieve a value, t...read more
Answered by AI
Add your answer

Q1. Bubble sort and array was given
Add your answer
Q2. Create binary tree
Ans. 
A binary tree is a data structure where each node has at most two children.
• Start by creating a Node class with left and right child pointers.

• Implement methods to insert, search, and delete nodes in the tree.

• Consider different traversal methods like inorder, preorder, and postorder.
Answered by AI
Add your answer
Q3. HightBuilding Pattern
Add your answer

2medium level questions

Q1. Project discussion for 30 mins
Add your answer
Q2. Dsa problem medium level
Add your answer

Q1. String reverse
Add your answer
Q2. Dsa linked lists
Add your answer
Q3. Linked lists reverse
Add your answer
Q4. Map unique elements
Ans. 
Map unique elements in an array of strings
• Create a map to store unique elements

• Iterate through the array and add each element to the map as a key

• Retrieve the keys of the map to get the unique elements
Answered by AI
Add your answer
Q5. Sets find elements in set
Ans. 
Sets are data structures that store unique elements and can be used to efficiently find elements in the set.
• Sets do not allow duplicate elements, so each element in a set is unique.

• To find elements in a set, you can use the 'has' method to check if a specific element is present in the set.

• Sets are commonly used in programming for tasks like removing duplicates from a list or checking for the presence of specific elemen
Answered by AI
Add your answer