i
CleverTap
Filter interviews by
I applied via Referral and was interviewed in Jun 2024. There was 1 interview round.
Array and Java related questions
Top trending discussions
posted on 19 Apr 2024
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
Design a Least Recently Used cache system.
Implement a doubly linked list to keep track of the order of usage of cache items.
Use a hashmap to store key-value pairs for quick access to cache items.
When a new item is accessed, move it to the front of the linked list. If the cache is full, remove the least recently used item from the end of the list.
Null is absence of value while object is a collection of properties and methods.
Null is a primitive value while object is a complex data type.
Null is used to indicate absence of value while object is used to represent real-world entities.
Null cannot have properties or methods while object can have both.
Example of null: let x = null; Example of object: let person = { name: 'John', age: 30 };
I applied via LinkedIn
Generator functions and symbols in JavaScript. Implementation of const keyword in ES5.
Generator functions are functions that can be paused and resumed, allowing for lazy evaluation of data.
Symbols are a new primitive type in ES6 that can be used as unique identifiers.
To implement const in ES5, we can use Object.defineProperty to create a read-only property on an object.
Custom events are user-defined events that can be triggered in a software application.
Custom events can be defined using event listeners and dispatchers.
They can be used to track user behavior, monitor application performance, and trigger specific actions.
Examples of custom events include button clicks, form submissions, and page scrolls.
I applied via Approached by Company and was interviewed before May 2023. There was 1 interview round.
Remove overlapping intervals to minimize removals.
Sort intervals by end time
Iterate through intervals, remove overlapping intervals
Return count of removed intervals
posted on 17 Sep 2024
I was asked to implement lru cache which i did but still didn’t made to next round as apparently i didn’t complete the working code though in my opinion i did
posted on 29 Feb 2024
I applied via Company Website and was interviewed before Feb 2023. There were 3 interview rounds.
Discussion about OOPS concepts and String related program
Program on Recursion and Array
I applied via Referral
I was interviewed before Apr 2021.
Round duration - 75 Minutes
Round difficulty - Medium
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
The task is to identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Keep track of the sum of each triplet and compare it with the target sum.
Print the triplet if the sum matches the target sum, else print -1.
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
Find the K-th largest element in a BST.
Perform reverse in-order traversal of the BST to find the K-th largest element.
Keep track of the count of visited nodes to determine the K-th largest element.
Return -1 if there is no K-th largest element in the BST.
Round duration - 60 Minutes
Round difficulty - Medium
Designing a database schema for a support ticketing system like Freshdesk.
Create a 'Tickets' table with fields like ticket ID, subject, description, status, priority, etc.
Include a 'Users' table for customer and agent information.
Establish a 'Categories' table for ticket categorization.
Implement a 'Comments' table to track communication history.
Utilize foreign keys to establish relationships between tables.
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.
Handle modulo 10^9+7 to avoid overflow issues.
Consider base cases for 0th and 1st stair.
Optimize the solution by using constant space instead of
Round duration - 60 Minutes
Round difficulty - Medium
Designing the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow.
For HLD, identify main components like user interface, booking system, payment gateway, and database.
For LLD, break down each component into detailed modules and their interactions.
Consider scalability, security, and performance in both designs.
Example: HLD - User selects movie -> Booking system checks availability -> Pa...
Round duration - 60 Minutes
Round difficulty - Easy
This was hiring manager round
Round duration - 20 Minutes
Round difficulty - Easy
This was culture fit round
Tip 1 : prepare github profile with few good projects
Tip 2 : solve questions from topics like dp, stack, queue, tree
Tip 3 : prepare HLD, LLD
Tip 1 : add your github profile, competitive coding profiles
Tip 2 : add few achievements like open source contribution, hackathons
Tip 3 : add few personal projects with github link or working site link
I applied via LinkedIn and was interviewed in Aug 2023. There was 1 interview round.
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Customer Success Manager
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Account Manager
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
MoEngage
Netcore Cloud Private Limited
WebEngage
Freshworks