i
MiQ Digital
Filter interviews by
I applied via campus placement at Lovely Professional University (LPU) and was interviewed before Dec 2021. There were 4 interview rounds.
Easy level ds/algo questions from array and strings.
Top trending discussions
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 Approached by Company and was interviewed in Jun 2024. There were 2 interview rounds.
Built an app using dot net and angular
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Implement a function to find the longest common prefix amongst an array of strings.
Iterate through the characters of the first string and compare with the corresponding characters of other strings.
Stop when a mismatch is found or when reaching the end of any string.
Return the prefix found so far.
The question is about solving a hard level problem related to data structures and algorithms.
Understand the problem statement thoroughly before starting to solve it.
Break down the problem into smaller subproblems if possible.
Consider different approaches and analyze their time and space complexity.
Test your solution with different test cases to ensure its correctness.
Optimize your solution if possible to improve its ef
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
posted on 20 Jul 2021
posted on 20 Dec 2021
I applied via campus placement at Indian School of Mines (ISM), Dhanbad and was interviewed in Nov 2021. There were 3 interview rounds.
I applied via Recruitment Consulltant
Data can be shared between components using props, state management libraries, or a global store.
Props can be used to pass data from a parent component to a child component.
State management libraries like Redux or MobX can be used to manage and share data between components.
A global store like React Context can be used to share data between components without passing props.
Events can be used to communicate between comp...
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 Job Portal and was interviewed before Feb 2023. There were 2 interview rounds.
Software Engineer
29
salaries
| ₹11 L/yr - ₹16 L/yr |
Data Analyst
24
salaries
| ₹6.5 L/yr - ₹17.2 L/yr |
Senior Software Engineer
22
salaries
| ₹22 L/yr - ₹31 L/yr |
Business Analyst
21
salaries
| ₹9 L/yr - ₹14.5 L/yr |
Senior Analyst
21
salaries
| ₹12 L/yr - ₹19 L/yr |
Affle
InMobi
Komli Media
Deloitte Digital