ParallelDots Software Developer Interview Questions and Answers

Was given two hours to implement an Api

Q1. Asked to develop register, login and logout using grpc.
Add your answer
Q2. Number of islands in Dsa
Ans. 
Number of islands in DSA refers to the problem of finding the number of connected groups of 1s in a 2D grid.
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the grid and mark visited islands.

• Count the number of times DFS/BFS is called to find the total number of islands.

• Consider diagonal connections if specified in the problem.

• Example: Given grid [['1','1','0','0'],['0','1','0','1'],['1','0','0','
Answered by AI
Add your answer

Q1. Design Calculator
Add your answer
Q2. React without react dom
Ans. 
React without react dom involves using React's server-side rendering capabilities to render components without the need for a DOM.
• Use ReactDOMServer.renderToString() to render React components on the server side

• This can be useful for server-side rendering of React components for SEO purposes

• Example: ReactDOMServer.renderToString()
Answered by AI
Add your answer

Q1. Design Pagination
Add your answer
Q2. Questions regarding NEXTjs
Add your answer

Core HTML, CSS and JS

JS deep dive and react

Q1. Mimic Promise.all, Array.flat, OTP Component etc
Add your answer

2 DSA problems were asked

Q1. Questions about software development
Add your answer

Create a analytics webpage

Q1. DSA , golang, database questions
Add your answer

Q1. Hr basic questions
Add your answer

Q1. How python dictionary is implemented internally ?
Ans. 
Python dictionary is implemented using hash tables.
• Python dictionary is a collection of key-value pairs.

• The keys in a dictionary must be unique and immutable.

• The values in a dictionary can be of any data type.

• Python dictionary is implemented using hash tables.

• Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

• The hash function used in Python dictionary is based on the key's h...read more
Answered by AI
Add your answer
Q2. What is heap sort
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• It divides the input into a sorted and an unsorted region.

• It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

• It has a time complexity of O(n log n) and is not stable.

• Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Answered by AI
Add your answer
Q3. Coding question to sort array based on a custom filter
Add your answer