i
CleverTap
Filter interviews by
2 pointer and Hashing
LRU cache is a data structure that stores a fixed number of items and removes the least recently used item when full.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When an item is accessed, move it to the front of the linked list to mark it as the most recently used.
When adding a new item, check if the cache is full and remove the lea...
I was interviewed before Oct 2023.
It was a simple time/space complexity trade-off OA
Top trending discussions
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
posted on 16 Dec 2024
It was a Basic Aptitude Test
We were asked to do Sorting, SQL queries (join)
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software development
Proficient in developing web applications
Skilled in using various technologies such as Java, JavaScript, and SQL
I applied via Company Website and was interviewed before Apr 2023. There were 3 interview rounds.
Aptitude and basic programming questions were asked.
6 Easy to Medium level questions were asked from topics like strings, arrays, hashmaps, sorting
I applied via Company Website and was interviewed in Mar 2024. There were 3 interview rounds.
10 aptitude and 10 programming
5 basic coding , you can tell logic and then code
1 app development question
I applied via Job Fair and was interviewed in Oct 2023. There were 2 interview rounds.
Question from genral aptitude and c aptitude
Easy to medium level question
It's very easy to write the code every simple codes are they asked
The gd topic is cyber security it's very easy to make a conversation to them
based on 2 interviews
Interview experience
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