i
MiQ Digital
Filter interviews by
Clear (1)
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I applied via Campus Placement and was interviewed in Sep 2020. There were 4 interview rounds.
A binary tree with 4 internal nodes has 5 leaf nodes.
A binary tree with n internal nodes has n+1 leaf nodes.
A leaf node is a node with no children.
Count the number of leaf nodes to find the answer.
The number of swaps required to sort an array using bubblesort
Bubble sort compares adjacent elements and swaps them if they are in the wrong order
Count the number of swaps required to sort the given array
The given array requires 19 swaps to be sorted using bubblesort
Given preorder and postorder traversal, find inorder traversal of a binary tree.
The last element of postorder traversal is the root of the tree
Find the root in preorder traversal and divide the tree into left and right subtrees
Recursively find the inorder traversal of left and right subtrees
Combine the inorder traversal of left subtree, root, and inorder traversal of right subtree
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.
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.
I applied via Campus Placement
Basic aptitude question
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Aptitude test from one of the popular platform
Was given a topic and had to speak for a min about it
Some of the top questions asked at the MiQ Digital SDE interview -
based on 1 interview
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Software Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Affle
InMobi
Komli Media
Deloitte Digital