i
ProProfs
Filter interviews by
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
I applied via Approached by Company and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Mar 2020. There was 1 interview round.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the first element is greater than the next element, swap them
Repeat this process for all elements in the list
Continue this process until no more swaps are needed
A Turing Machine is a theoretical device that can simulate any algorithmic computation.
It was proposed by Alan Turing in 1936 as a model for computation.
It consists of a tape, a head that can read and write symbols on the tape, and a set of rules for transitioning between states.
It can simulate any algorithmic computation, making it a powerful tool for theoretical computer science.
It is often used as a theoretical basi...
A hash function is a mathematical function that converts input data of arbitrary size into a fixed-size output.
Hash functions are used to index data in hash tables.
They are also used in cryptography to securely store passwords.
Examples of hash functions include MD5, SHA-1, and SHA-256.
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via Job Fair and was interviewed before Feb 2021. There were 5 interview rounds.
What is aptitude test?
Online study and off-line which one is better?
Someone not interested in assignments.
I applied via Indeed and was interviewed in Jan 2021. There was 1 interview round.
based on 1 review
Rating in categories
PHP Developer
38
salaries
| ₹0 L/yr - ₹0 L/yr |
SEO Executive
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Writer
22
salaries
| ₹0 L/yr - ₹0 L/yr |
UI/UX Designer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
MindTickle
InMobi