Easiloan Techno Solutions SDE (Software Development Engineer) Interview Questions and Answers

3 dsa questions medium level

Q1. 2 medium level dp questions based on string and stocks
Add your answer
Q2. One hard question based on graph
Add your answer

Q1. Hr questions and java , springboot questions etc
Add your answer

Q1. Projects, previous work , dsa and database
Add your answer

Q1. System design , dsa
Add your answer

Q1. Behavioural, system design
Add your answer

Q1. General discussion , salary
Add your answer

Coding and aptitude round

Q1. Tree dsa questions
Add your answer

Q1. Horse race question
Add your answer

Q1. Location specific question
Add your answer

Hacker earth , Rest api consuming and filtering response . 2 question

Q1. L1 Technical of 1 hour - Java , Spring Boot, OOPs
Add your answer
Q2. JAVA 8 Features , OOPs Concept
Add your answer

Q1. L2 technical , design , puzzle
Add your answer

Q1. With CTO , recent projects , puzzle
Add your answer

Q1. Directly discussion on expected
Add your answer

Sql, power Bi basic and Reporting knowledge

Sql knowledge , use of power bi

Salary discussion round

Q1. 2Sum DSA leetcode problem
Ans. 
2Sum problem involves finding two numbers in an array that add up to a specific target.
• Use a hashmap to store the difference between the target and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer
Q2. Spiral traversal of a Binary tree
Ans. 
Spiral traversal of a Binary tree involves visiting nodes level by level alternating between left to right and right to left.
• Start by pushing the root node into a queue.

• While the queue is not empty, pop a node, print its value, and push its children into the queue.

• Alternate between popping nodes from the queue and printing their values in a spiral manner.
Answered by AI
Add your answer

Q1. A problem similar to coin change problem of leetcode
Ans. 
The coin change problem involves finding the number of ways to make a certain amount using given coin denominations.
• Dynamic Programming Approach: Use an array to store the number of ways to make each amount up to the target.

• Example: For coins [1, 2, 5] and target 5, ways are: 5 (1x5), 2+2+1, 2+1+1+1, 1+1+1+1+1.

• Base Case: Initialize dp[0] = 1, as there's one way to make 0 amount (using no coins).

• Iterate through each coi...read more
Answered by AI
Add your answer
Q2. Aggressive cows problem
Ans. 
The aggressive cows problem involves finding the maximum distance between cows in a field while ensuring they are not too close to each other.
• Use binary search to find the maximum distance between cows.

• Sort the cows' positions and check if a certain distance is feasible.

• Consider the constraints of the problem such as the number of cows and the size of the field.
Answered by AI
Add your answer

Q1. Basic behavioural questions like why I am looking for a change and would I be able to handle the increased work pressure as I was shifting from MNC to a startup
Add your answer

Technical round 2 questions

Javascript,html, CSS and MySQL

Q1. Basic NodeJs and MySQL questions,scenario-based technical questions and basic interview questions
Add your answer
Q2. What is an event loop, The second highest from the table
Ans. 
An event loop is a programming construct that waits for and dispatches events or messages in a program.
• Event loop is commonly used in asynchronous programming to handle tasks like I/O operations without blocking the main thread.

• It continuously checks for events in a queue and processes them one by one.

• Examples of event loops include Node.js event loop for handling asynchronous operations in JavaScript.

• Event loop helps ...read more
Answered by AI
Add your answer

Q1. Basic nodejs and SQL queries question
Add your answer

Q1. Basic interview question and technology based
Add your answer