Filter interviews by
Ensure thread safety by using synchronization mechanisms to prevent concurrent access issues.
Use synchronized blocks or methods to control access to shared resources.
Example: synchronized void increment() { count++; }
Utilize locks (e.g., ReentrantLock) for more granular control over synchronization.
Example: ReentrantLock lock = new ReentrantLock(); lock.lock(); try { count++; } finally { lock.unlock(); }
Consider u...
Enhancing search variants involves improving search algorithms for better accuracy and relevance in results.
Implement advanced algorithms like TF-IDF or BM25 for better ranking of search results.
Utilize machine learning models to understand user intent and improve result relevance.
Incorporate synonyms and related terms to broaden search queries, e.g., searching 'car' also shows results for 'automobile'.
Use natural...
Time complexity measures the amount of time an algorithm takes to complete as a function of the input size.
Big O notation is commonly used to express time complexity (e.g., O(n), O(log n)).
Linear search has a time complexity of O(n) because it checks each element in the array.
Binary search has a time complexity of O(log n) as it divides the search space in half each time.
Nested loops typically result in O(n^2) com...
Space complexity measures the amount of memory an algorithm uses relative to the input size.
Space complexity is expressed as a function of the input size, e.g., O(n) or O(1).
It includes both the auxiliary space and the space used by the input.
Example: A function that creates an array of size n has O(n) space complexity.
In-place algorithms, like bubble sort, have O(1) space complexity since they require no addition...
Implement a search algorithm to find variant patterns in a list of documents efficiently.
Use regular expressions to identify patterns, e.g., searching for 'cat' in 'caterpillar' or 'catalog'.
Consider using a trie data structure for efficient prefix searching.
Implement fuzzy matching to account for typos or variations, e.g., 'color' vs. 'colour'.
Leverage natural language processing (NLP) techniques for semantic sea...
Understanding variadic functions and their matching mechanisms in programming.
Variadic functions accept a variable number of arguments, e.g., 'printf' in C.
In C, use '...' to define a variadic function: 'void func(int count, ...)'
Access arguments using 'va_list', 'va_start', and 'va_end' macros.
Example: 'printf("%d %s", 10, "hello");' matches 10 as int and 'hello' as string.
Design a scalable Feed API to manage user-generated content and interactions efficiently.
Define the core functionalities: create, read, update, delete (CRUD) for feed items.
Consider user authentication and authorization for secure access.
Implement pagination to handle large volumes of feed data efficiently.
Use caching mechanisms (e.g., Redis) to improve read performance.
Design a data model that supports relationsh...
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.
I appeared for an interview in Feb 2025, where I was asked the following questions.
Implement a search algorithm to find variant patterns in a list of documents efficiently.
Use regular expressions to identify patterns, e.g., searching for 'cat' in 'caterpillar' or 'catalog'.
Consider using a trie data structure for efficient prefix searching.
Implement fuzzy matching to account for typos or variations, e.g., 'color' vs. 'colour'.
Leverage natural language processing (NLP) techniques for semantic search.
O...
Enhancing search variants involves improving search algorithms for better accuracy and relevance in results.
Implement advanced algorithms like TF-IDF or BM25 for better ranking of search results.
Utilize machine learning models to understand user intent and improve result relevance.
Incorporate synonyms and related terms to broaden search queries, e.g., searching 'car' also shows results for 'automobile'.
Use natural lang...
Space complexity measures the amount of memory an algorithm uses relative to the input size.
Space complexity is expressed as a function of the input size, e.g., O(n) or O(1).
It includes both the auxiliary space and the space used by the input.
Example: A function that creates an array of size n has O(n) space complexity.
In-place algorithms, like bubble sort, have O(1) space complexity since they require no additional st...
Ensure thread safety by using synchronization mechanisms to prevent concurrent access issues.
Use synchronized blocks or methods to control access to shared resources.
Example: synchronized void increment() { count++; }
Utilize locks (e.g., ReentrantLock) for more granular control over synchronization.
Example: ReentrantLock lock = new ReentrantLock(); lock.lock(); try { count++; } finally { lock.unlock(); }
Consider using ...
I appeared for an interview in Jan 2025, where I was asked the following questions.
Led multiple projects enhancing service delivery efficiency and client satisfaction across various sectors.
Implemented a new ticketing system that reduced response time by 30%.
Managed a cross-functional team for a major software rollout, achieving a 95% user adoption rate.
Developed a client feedback loop that improved service ratings by 20% within six months.
Spearheaded a project to automate reporting processes, saving...
I applied via Approached by Company and was interviewed in Jul 2024. There was 1 interview round.
It was a 1 hour Technical screening round, coding question in java (you cna choose your own language). They asked a difficult version of regex matching question (Leetcode medium-hard).
Asked to write a email for a case study given to persuade customers to use the product and services
Role play Demo interview given to persuade the customers by conducting qualification session
Understanding variadic functions and their matching mechanisms in programming.
Variadic functions accept a variable number of arguments, e.g., 'printf' in C.
In C, use '...' to define a variadic function: 'void func(int count, ...)'
Access arguments using 'va_list', 'va_start', and 'va_end' macros.
Example: 'printf("%d %s", 10, "hello");' matches 10 as int and 'hello' as string.
I appeared for an interview before Jul 2024, where I was asked the following questions.
Design a scalable system for generating and managing short URLs.
Use a hash function to generate a unique identifier for each URL.
Store the mapping of short URLs to original URLs in a database.
Implement a redirect service that retrieves the original URL based on the short URL.
Consider using a CDN for faster access to frequently used short URLs.
Implement analytics to track usage of short URLs.
I applied via Referral and was interviewed in Feb 2024. There was 1 interview round.
1 hour machine coding round
Tail . How to use circular buffer to avoid storm huge file?
Design a scalable Feed API to manage user-generated content and interactions efficiently.
Define the core functionalities: create, read, update, delete (CRUD) for feed items.
Consider user authentication and authorization for secure access.
Implement pagination to handle large volumes of feed data efficiently.
Use caching mechanisms (e.g., Redis) to improve read performance.
Design a data model that supports relationships b...
Top trending discussions
based on 13 interview experiences
Difficulty level
Duration
based on 23 reviews
Rating in categories
Solution Engineer
26
salaries
| ₹20.7 L/yr - ₹32 L/yr |
Software Engineer
25
salaries
| ₹24 L/yr - ₹35 L/yr |
Senior Software Engineer
23
salaries
| ₹61 L/yr - ₹99.2 L/yr |
Customer Success Manager
10
salaries
| ₹24 L/yr - ₹27.2 L/yr |
Senior Data Engineer
9
salaries
| ₹16 L/yr - ₹27.9 L/yr |
Udaan
Swiggy
CARS24
XpressBees