Filter interviews by
It was good enough round
Simpler enough round
A little tougher round
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
HackerRank - MCQ and Coding
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve problems
Key principles include encapsulation, inheritance, and polymorphism
Encapsulation involves bundling data and methods that operate on the data into a single unit
Inheritance allows for the creation of new classes based ...
Implement a REST API for user login functionality
Create a POST endpoint for user authentication
Use HTTPS for secure communication
Implement token-based authentication for session management
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There was 1 interview round.
I am currently working as a Direct Sales Representative for a technology company, reaching out to potential clients and promoting our products.
Conducting cold calls and emails to generate leads
Meeting with clients to demonstrate products and explain benefits
Negotiating contracts and closing sales
Following up with clients for feedback and future opportunities
I applied via Approached by Company and was interviewed in Oct 2022. There were 4 interview rounds.
M maximum numbers from array.
Merge sort
Top products for user queries can be determined by analyzing search logs and user behavior.
Analyze search logs to identify frequently searched products
Use machine learning algorithms to predict user preferences
Consider user behavior and purchase history to recommend products
Examples: Amazon's 'Frequently Bought Together' and 'Customers Who Bought This Item Also Bought' sections
Unbxd interview questions for popular designations
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
Basics of core subjects
I applied via Campus Placement and was interviewed before May 2022. There were 4 interview rounds.
Aptitude test included Mcqs and coding questions
They made group of 10 people and gave a topic mostly e-commerce based or AI based
Top trending discussions
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
based on 3 interviews
Interview experience
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Program Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Technical Support Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
InMobi
Freshworks
Zoho
Druva