i
MiQ Digital
Filter interviews by
I appeared for an interview in Sep 2024.
Recursive problem involving finding the factorial of a number.
Implement a recursive function to calculate the factorial of a number.
Base case: if n is 0 or 1, return 1.
Recursive case: return n * factorial(n-1).
Parking lot design involves layout, capacity, accessibility, and efficiency.
Consider the layout of the parking lot to maximize space and ease of navigation.
Include designated spots for different types of vehicles (e.g. compact, electric, handicap).
Implement efficient traffic flow patterns to reduce congestion and improve safety.
Incorporate technology such as sensors or apps for real-time parking availability updates.
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
Leetcode easy-medium
Cyber security is the practice of protecting systems, networks, and data from digital attacks.
Cyber security involves implementing measures to prevent unauthorized access, data breaches, and other cyber threats.
It includes technologies, processes, and practices designed to protect networks, devices, programs, and data from attack, damage, or unauthorized access.
Examples of cyber security measures include firewalls, ant...
Types of encryption include symmetric encryption, asymmetric encryption, and hashing.
Symmetric encryption: Uses the same key for both encryption and decryption, examples include AES and DES.
Asymmetric encryption: Uses a pair of public and private keys for encryption and decryption, examples include RSA and ECC.
Hashing: Converts data into a fixed-size string of bytes, examples include MD5 and SHA.
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
Indexing in MySQL is a technique to improve the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexes are created on one or more columns of a table.
They help in speeding up the search, sorting, and joining of data.
Indexes can be created using different algorithms like B-tree, hash, or bitmap.
Using indexes appropriately can significantly enhance query performance.
Exam...
Object-oriented programming concepts in PHP
Encapsulation: bundling data and methods together in a class
Inheritance: creating new classes based on existing ones
Polymorphism: using a single interface to represent different types
Abstraction: hiding unnecessary details and exposing only essential features
Class: blueprint for creating objects
Object: instance of a class
Method: function defined inside a class
Property: variabl
I appeared for an interview before Oct 2023.
It was based on frontend technologies
I applied via LinkedIn and was interviewed before Apr 2023. There was 1 interview round.
posted on 24 May 2024
Using async/await with try catch block in Javascript
Use async keyword before the function declaration to make it asynchronous
Use await keyword before the function call to wait for the promise to resolve
Wrap the async/await code in a try catch block to handle errors
based on 1 interview
Interview experience
Software Engineer
29
salaries
| ₹11 L/yr - ₹16 L/yr |
Data Analyst
24
salaries
| ₹6.5 L/yr - ₹17.2 L/yr |
Business Analyst
21
salaries
| ₹9 L/yr - ₹14.5 L/yr |
Analyst
20
salaries
| ₹7 L/yr - ₹13.5 L/yr |
Data Scientist
20
salaries
| ₹12 L/yr - ₹21 L/yr |
Epsilon
Denave
Smollan Group
ChannelPlay