i
CleverTap
Filter interviews by
A program to calculate the area of a rectangle
Take input of length and width from user
Multiply length and width to get area
Display the calculated area to the user
Top trending discussions
There were 2 questions from hackerrank both were easy
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
Basic to advanced aptitude
They provide some code snippet to solve
Data structure high level coding round
posted on 24 Mar 2015
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
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.
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
posted on 7 Sep 2015
I applied via Referral
based on 1 interview
Interview experience
based on 1 review
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