i
Easiloan Techno Solutions
Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2024. There were 4 interview rounds.
1 hrs of aptitude on company website.
posted on 15 Nov 2024
I applied via Approached by Company and was interviewed in May 2024. There were 4 interview rounds.
Manager and one level above manager had discussion with my on why you want this job , why you are leaving current organization and want to join this organization. This type of questions were asked and discussion was of almost 30-40 minutes.
Coding and aptitude round
I applied via Job Portal and was interviewed before Mar 2023. There was 1 interview round.
Technical round 2 questions
React is a modern JavaScript library for building user interfaces, while jQuery is a fast and concise JavaScript library for DOM manipulation.
React is component-based, promoting reusability and modularity.
React uses a virtual DOM for efficient updates, while jQuery directly manipulates the DOM.
React is declarative, making it easier to reason about the UI, while jQuery is imperative.
React is typically used for single-pa...
I applied via Naukri.com and was interviewed in Aug 2022. There were 5 interview rounds.
Hacker earth , Rest api consuming and filtering response . 2 question
I applied via Walk-in and was interviewed in Dec 2022. There were 4 interview rounds.
Sql, power Bi basic and Reporting knowledge
Sql knowledge , use of power bi
Salary discussion round
posted on 13 Nov 2024
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
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.
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.
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.
I applied via Referral and was interviewed before Apr 2023. There was 1 interview round.
based on 1 interview
Interview experience
Relationship Manager
4
salaries
| ₹3.6 L/yr - ₹5 L/yr |
Cluster Manager
4
salaries
| ₹7 L/yr - ₹10 L/yr |
React Developer
4
salaries
| ₹4 L/yr - ₹5 L/yr |
Software Development Engineer
3
salaries
| ₹4.5 L/yr - ₹4.9 L/yr |
Business Development Manager
3
salaries
| ₹6.7 L/yr - ₹12.1 L/yr |
Bajaj Finance
HDFC Bank
ICICI Bank
Axis Bank