Filter interviews by
Be the first one to contribute and help others!
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I applied via Company Website and was interviewed before Feb 2021. There were 4 interview rounds.
Generic
Generic
In 5 years, I see myself as a successful Sales Executive leading a high-performing team and driving significant revenue growth for the company.
Leading a team of sales professionals
Achieving and exceeding sales targets consistently
Developing and implementing effective sales strategies
Building strong relationships with key clients
Contributing to the overall growth and success of the company
My strengths include strong communication skills, ability to build relationships, and a competitive nature. My weaknesses include impatience and a tendency to take on too much at once.
Strength: Strong communication skills - I am able to effectively convey information and build rapport with clients.
Strength: Relationship building - I excel at establishing and maintaining long-term relationships with customers.
Strength: ...
Experienced sales executive with a proven track record in exceeding targets and building strong client relationships.
10+ years of experience in sales, with expertise in B2B and B2C markets
Consistently achieved or surpassed sales targets by 20% or more
Developed and maintained a portfolio of key accounts, resulting in a 30% increase in revenue
Strong negotiation and communication skills, with the ability to build rapport ...
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.
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 7 Sep 2015
I applied via Referral
posted on 2 Nov 2021
I applied via Campus Placement and was interviewed in May 2021. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2020. There were 5 interview rounds.
Implemented data-driven strategies to increase revenue by 15% in previous company.
Developed predictive models to optimize pricing strategies
Identified key customer segments for targeted marketing campaigns
Automated data collection and analysis processes for efficiency
Collaborated with cross-functional teams to implement data-driven decisions
Business Analyst
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Customer Success Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
CleverTap
MoEngage
Netcore Cloud Private Limited
Freshworks