i
Eko India Financial Services
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Jan 2023. There were 4 interview rounds.
Assignment were related to project management.
Top trending discussions
posted on 26 Sep 2023
I applied via Walk-in and was interviewed before Sep 2022. There were 4 interview rounds.
Reasoning and logical
I applied via Referral
30 minutes Aptitude test
1 Hour 30 minutes on SQL screening test
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
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 Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.
2 hackerearth problem solving questions was asked.
It was hackerrank test
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Sales Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Payed