Datami Reactjs Developer Interview Questions and Answers

There were three coding questions.

Q1. Could you provide a thorough explanation of the project?
Add your answer
Q2. OOps Concepts and question from the technical subjects
Add your answer
Q3. Why Spring Boot
Add your answer
Q4. JWT Authentication
Add your answer
Q5. Docker and Kubernetes
Add your answer

Q1. This was for internship. The first questions were 10 questions based on guessing output of c program
Add your answer
Q2. 2 coding questions with easy to medium difficulty based on strings and mathematical knowledge
Add your answer

Q1. This was a virtual interview round which had basic HR type questions.
Add your answer

Q1. This was code for good hackathon
Add your answer

Q1. Write an API to fetch the id and JSON from the client.
Ans. 
Create an API to fetch id and JSON from the client.
• Create a RESTful API endpoint that accepts requests from the client

• Use a GET request to fetch the id and JSON data from the client

• Implement error handling for invalid requests or missing data
Answered by AI
Add your answer
Q2. Find forth highest salary from List using java 8.
Ans. 
Use Java 8 stream to find the forth highest salary from a List.
• Use stream() method to convert the List to a stream.

• Use distinct() method to remove duplicates.

• Use sorted() method to sort the salaries in ascending order.

• Use skip() method to skip the first three highest salaries.

• Use findFirst() method to get the forth highest salary.
Answered by AI
Add your answer

Q1. Microservice Architecture questions
Add your answer
Q2. Spring Boot Annotations
Add your answer

Q1. Salary Expectation
Add your answer
Q2. Basic HR questions
Add your answer

Q1. They grind u in javascript,typescript
Add your answer
Q2. Html css, angular
Add your answer
Q3. Deep preparation needed
Add your answer

Question Related to the DP and the Graph

Q1. Kth Max Element in a Array
Ans. 
Find the Kth maximum element in an array of strings.
• Sort the array in descending order.

• Return the element at index K-1.
Answered by AI
Add your answer
Q2. Coin Change and optimization through DP
Ans. 
Coin change problem can be solved using dynamic programming to find the minimum number of coins needed to make a certain amount of change.
• Use dynamic programming to build up solutions for smaller subproblems

• Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount

• Iterate through each coin denomination and update the array with the minimum number of coins need
Answered by AI
Add your answer

Q1. Project include in your Resume
Add your answer
Q2. HR common question
Add your answer

Two sum problem DSA fromleetcode

Q1. Event Loop, how does event loop work.
Add your answer
Q2. Lib UV, explain the function of libuv
Ans. 
Libuv is a multi-platform support library with a focus on asynchronous I/O.
• Provides event loop, networking, and file system access APIs

• Supports asynchronous operations for handling I/O events efficiently

• Used in Node.js for handling non-blocking I/O operations
Answered by AI
Add your answer
Q3. Async programming in JS
Ans. 
Async programming in JS allows for non-blocking operations, improving performance and user experience.
• Use async/await to write asynchronous code in a synchronous manner

• Promises are a common way to handle asynchronous operations

• Callbacks can also be used for async programming, but can lead to callback hell

• Utilize setTimeout and setInterval for delayed and repeated tasks
Answered by AI
Add your answer

MCQ test consisting of 70 mcqs in 75 minutes from aptitude english and cs fundamentals. If cleared next paper 2 coding qs medium level

Q1. Two sum leetcode problem
Add your answer
Q2. What problems you faced in your project
Ans. 
I faced challenges with integrating third-party APIs and debugging complex logic.
• Difficulty in understanding and implementing third-party APIs

• Issues with data synchronization between different systems

• Troubleshooting complex logic errors

• Managing dependencies and version conflicts

• Time constraints affecting problem-solving
Answered by AI
Add your answer

DP graphs strings it was good

Q1. Reverse a linkded list
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: current, previous, and next

• Iterate through the list, updating pointers to reverse the direction

• Return the new head of the reversed list
Answered by AI
Add your answer
Q2. Print fibonacci series
Ans. 
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
• Start with two variables initialized to 0 and 1

• Loop through desired number of iterations, adding the previous two numbers to get the next number

• Print or store each number in the series
Answered by AI
Add your answer