Darwinbox Software Developer Interview Questions and Answers

It was an online test for interview

Q1. Tell me about dijistkras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

• It maintains a list of tentative distances to each node and updates them as it explores the graph.

• The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

• Example:...read more
Answered by AI
Add your answer
Q2. Tell me about your projects
Add your answer

Q1. What is nodejs multi threading
Ans. 
Node.js is single-threaded, but it can support multi-threading through child processes and worker threads.
• Node.js is single-threaded, meaning it runs on a single thread in the event loop.

• To achieve multi-threading, Node.js can create child processes using the 'child_process' module.

• Another way to achieve multi-threading in Node.js is through worker threads using the 'worker_threads' module.

• Using child processes or work...read more
Answered by AI
Add your answer

General aptitude and reasoning

Dsa three codes for 2 hours

Q1. Explain josephus problem in O(1) time complexity
Ans. 
Josephus problem is a famous theoretical problem involving a circle of people where every kth person is eliminated until only one person remains.
• Josephus problem involves a circle of n people where every kth person is eliminated until only one person remains.

• The problem can be solved in O(1) time complexity by using the formula: f(n, k) = (f(n-1, k) + k) % n.

• For example, if n=5 and k=2, the last person remaining would
Answered by AI
Add your answer