i
LenDenClub
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jun 2022. There were 4 interview rounds.
Just few Apti questions, with basic knowledge
Top trending discussions
I applied via Referral and was interviewed in Mar 2021. There were 3 interview rounds.
posted on 21 Dec 2024
I applied via Referral and was interviewed in Nov 2024. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 3 interview rounds.
2 leetcode medium questions were asked
Designing a feature for a social media platform to allow users to create and share photo albums.
Allow users to create and name albums
Provide an interface for users to upload and organize photos within albums
Implement privacy settings to control who can view and contribute to albums
Include features like tagging, commenting, and liking photos within albums
Enable users to share albums with others via links or social media
Design a Zomato Ordering System for online food delivery.
Allow users to browse restaurants and menus
Implement user authentication and profile management
Enable users to place orders and make payments online
Include features like order tracking and ratings/reviews
Integrate with restaurant partners for order fulfillment
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
2 Codes on Hackerrank
It was hackerrank test
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.
2 hackerearth problem solving questions was asked.
2 Ds questions. About Linked list ans arrays and some aptitude questions.
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges the sorted halves.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
The Two Sum 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.
NoSQL databases are non-relational, flexible, and scalable, while SQL databases are relational, structured, and consistent.
NoSQL databases are schema-less, allowing for flexibility in data models.
SQL databases use structured query language for data manipulation and retrieval.
NoSQL databases are horizontally scalable, making them suitable for big data applications.
SQL databases are vertically scalable, which can be more...
I applied via Referral
30 minutes Aptitude test
1 Hour 30 minutes on SQL screening test
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Developer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Credit Executive
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Graduate Engineer Trainee (Get)
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Credit Analyst
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Faircent.com
IndiaLends
RupeeCircle
Kissht Finance