Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Know the basics of project management
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 was interviewed before Feb 2016.
I was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
Yes, I can remove all the pcs from the lab and keep them in another lab right now.
Ensure all the necessary equipment and tools are available for the move
Coordinate with the lab staff to ensure a smooth transition
Label and document each PC for easy identification and setup in the new lab
Ensure proper packaging and handling to prevent any damage during the move
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
The first two numbers of the series are always 0 and 1
The next number is the sum of the previous two numbers
The series goes on infinitely: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
Pseudo code: 1. Initialize variables a=0, b=1, c=0 2. Print a and b 3. Repeat steps 4-6 until desired number of terms 4. c=a+b 5. Pr
Algorithm for matrix multiplication
Create a result matrix with dimensions of the two input matrices
Iterate through each row and column of the result matrix
For each element in the result matrix, multiply corresponding row in first matrix with corresponding column in second matrix
Add the products obtained in the previous step to get the final value for the element
I worked on a project that involved sentiment analysis of customer reviews using Naive Bayes algorithm.
The project involved collecting customer reviews from various sources.
Preprocessing the data by removing stop words, stemming, and tokenizing.
Used Naive Bayes algorithm for sentiment analysis.
The algorithm was chosen because of its simplicity and effectiveness in text classification tasks.
The accuracy of the model was
based on 1 interview
Interview experience
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Programmer Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Druva
Zoho
Freshworks
InMobi