Filter interviews by
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
Parent node can be tracked by storing a reference to the parent node in each node of the binary tree.
Store a reference to the parent node in each node of the binary tree
Update the parent reference when inserting or deleting nodes
Use this parent reference to navigate back to the parent node
I was interviewed in Nov 2024.
My favorite product is the iPhone because of its sleek design, user-friendly interface, and seamless integration with other Apple products.
Sleek design
User-friendly interface
Seamless integration with other Apple products
I want to join Demandfarm because of its innovative products and strong company culture.
I am impressed by Demandfarm's track record of developing cutting-edge products in the market.
I am excited about the opportunity to work in a collaborative and supportive company culture.
I believe my skills and experience align well with the goals and values of Demandfarm.
I would focus on improving user experience, adding more features for customization, and enhancing accuracy of location data.
Implement AI technology for real-time traffic updates and alternative route suggestions
Enhance user interface for easier navigation and search functionality
Integrate more personalized recommendations based on user preferences and habits
The number of Google Docs users can be estimated based on the total number of active Google accounts and the percentage of users who use Google Docs.
Estimate the total number of active Google accounts worldwide.
Determine the percentage of Google account users who use Google Docs regularly.
Multiply the total number of active Google accounts by the percentage of Google Docs users to calculate the approximate number of Go
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I would design the page by breaking it down into reusable components that can be easily managed and updated.
Identify the different sections of the page and create components for each section
Use props to pass data between components
Implement a state management system like Redux or Context API for managing global state
Utilize CSS-in-JS libraries like styled-components for styling components
Ensure components are modular a...
I applied via Referral and was interviewed in Aug 2023. There were 4 interview rounds.
Med-hard coding questions
DemandFarm interview questions for popular designations
I applied via Campus Placement and was interviewed before Mar 2023. There were 4 interview rounds.
Common logic based questions
3 coding and 2 query related
Top trending discussions
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
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.
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
based on 5 interviews
Interview experience
based on 7 reviews
Rating in categories
Product Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Solution Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
MindTickle
Capillary Technologies