Optym Interview Questions and Answers

2 coding questions one being relatively easy

Q1. Data structure related questions to that were fairly straightforward
Add your answer

MCQ, 3 coding question 1 SQL query

Q1. Second smallest leetcode question and projects
Add your answer

2 easy, 1 medium and 1 hard DSA question

Q1. Implement Priority Queue
Ans. 
Priority Queue is a data structure that stores elements based on their priority.
• Use a binary heap to implement a Priority Queue.

• Elements are inserted based on priority and removed in order of priority.

• Example: Inserting elements with priorities 5, 3, 7, 1 would result in removal order of 1, 3, 5, 7.
Answered by AI
Add your answer
Q2. Leetcode easy question on heaps.
Add your answer

Q1. What happens in the background when user search url?
Ans. 
When a user searches a URL, the browser sends a request to the server, which then processes the request and returns the requested webpage.
• User enters URL in browser address bar

• Browser sends a request to the server hosting the website

• Server processes the request and retrieves the requested webpage

• Server sends the webpage back to the browser

• Browser renders and displays the webpage to the user
Answered by AI
Add your answer
Q2. What is event loop?
Ans. 
Event loop is a mechanism in JavaScript that allows for asynchronous operations to be executed in a non-blocking way.
• Event loop is responsible for handling asynchronous operations in JavaScript.

• It allows for tasks to be queued and executed in a non-blocking manner.

• Event loop continuously checks the call stack and the task queue, moving tasks from the queue to the call stack when the stack is empty.

• Example: setTimeout()...read more
Answered by AI
Add your answer
Q3. About position relative and absolute
Add your answer