i
MiQ Digital
Filter interviews by
I was interviewed 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.
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
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
posted on 26 Feb 2024
I applied via Naukri.com and was interviewed in Oct 2022. There were 2 interview rounds.
Technical skills are abilities and knowledge required to perform specific tasks related to technology and software development.
Technical skills include programming languages, software development methodologies, database management, and system administration.
Examples of technical skills are proficiency in Java, knowledge of Agile methodology, experience with SQL databases, and expertise in Linux administration.
Technical...
Technical skills can be used to solve complex problems and create innovative solutions.
Identify the problem or challenge
Determine the appropriate technology or programming language to use
Develop a plan or strategy for implementation
Collaborate with team members and stakeholders
Test and refine the solution
Continuously learn and improve technical skills
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
posted on 20 Jul 2021
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.
Software Engineer
29
salaries
| ₹11 L/yr - ₹16 L/yr |
Data Analyst
25
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