Filter interviews by
Hashmap problem involving storing and retrieving data efficiently.
Hashmap is a data structure that stores key-value pairs.
It allows for fast retrieval of values based on keys.
Examples include storing student grades by student ID, or mapping employee names to their salaries.
Top trending discussions
I applied via campus placement at Indian Institute of Information Technology (IIIT), Guwahati and was interviewed in Jul 2022. There were 2 interview rounds.
Cs subjects regarding OS, C, DBMS
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
Start with the second element and compare it with the first element, swap if necessary
Move to the third element and compare it with the second and first element, swap if necessary
Continue this process until the entire array is sorted
Time complexity: O(n^2)
Example: ['banana', 'apple', 'orange', 'grape'] -> ['apple', 'banan
Implementing a tree data structure using code
Define a Node class with left and right child pointers
Implement insert, search, and delete functions
Traversal methods: inorder, preorder, postorder
Examples: binary search tree, AVL tree, red-black tree
I was interviewed in Aug 2021.
Round duration - 180 minutes
Round difficulty - Medium
It was a long round of around 3 hours divided into 2 parts
1. Aptitude(MCQ)
2. Coding(Subjective)
You are tasked with scheduling meetings in a single meeting room. Given N
meetings, each with a start time Start[i]
and end time End[i]
, determine the maximum number of meetings...
1. Sort all pairs(Meetings) in increasing order of the second number(Finish time) of each pair.
2. Select the first meeting of the sorted pair as the first Meeting in the room and push it into the result vector and set a variable time_limit(say) with the second value(Finishing time) of the first selected meeting.
3. Iterate from the second pair to the last pair of the array and if the value of the first element(Starting ...
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...
1. If K is 1, then we already have our answer, the complete array is only a subset with the same sum.
2. If N < K, then it is not possible to divide the array into subsets with an equal sum because we can’t divide the array into more than N parts.
3. If the sum of the array is not divisible by K, then it is not possible to divide the array. We will proceed only if k divides the sum. Our goal reduces to div...
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...
A Simple Solution is to initialize the result as the first list. Now traverse all lists starting from the second list. Insert every node of the currently traversed list into the result in a sorted way.
Given a doubly-linked list with N
nodes, where each node’s position deviates at most K
positions from its position in the sorted list, your task is to sort this given ...
Sort the given doubly linked list using the insertion sort technique. While inserting each element in the sorted part of the list, there will be at most k swaps to place the element to its correct position since it is at most k steps away from its correct position.
Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...
The idea is to use hashing. We store in order traversals of subtrees in a hash. Since simple inorder traversal cannot uniquely identify a tree, we use symbols like ‘(‘ and ‘)’ to represent NULL nodes.
Round duration - 25 minutes
Round difficulty - Medium
The technical Interview round was not at all difficult. The main focus of the interviewer was my projects and development fields.
He also asked some DS/Algo questions that were at a medium level, and some easy questions for database management.
Round duration - 15 minutes
Round difficulty - Easy
It took place on the same day as the technical round. It was quite the easiest round of all. The interviewer just asked me to introduce myself, projects I have worked on, my Internships experience, and were they internships paid.
Tip 1 : Be active while introducing yourself.
Tip 2 : in online mode always try to be in the video mode as your expression says a lot
Tip 1 : Keep a handful of knowledge of your projects anything can be asked from that
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impact a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Round duration - 40 minutes
Round difficulty - Hard
Questions related to Web development and machine learning
Round duration - 20 minutes
Round difficulty - Medium
Tip 1 : Have clear understanding of fundamental concepts.
Tip 2 : Have a skill of explaining your thoughts as clearly as possible.
Tip 3 : Practice RDBMS and OS concepts.
Tip 1 : Mention about the projects you've done with detail
Tip 2 : Have deep knowledge about everything mentioned on your resume.
Endianess refers to the order in which bytes are stored in memory. Little endian stores the least significant byte first.
Check the byte order of a multi-byte integer value
Use a test value with known byte order to determine the system's endianess
Check the system's documentation or specifications
Use a code snippet to determine the endianess
Function pointers can be shared across processes using inter-process communication mechanisms like shared memory, pipes, sockets, etc.
Function pointers can be stored in shared memory regions that are accessible by multiple processes.
Processes can communicate with each other using pipes or sockets and pass function pointers as arguments.
Remote Procedure Call (RPC) mechanisms can also be used to share function pointers a...
Binder is a mechanism for inter-process communication in Android.
Binder allows different processes to communicate with each other.
It is used for implementing Android's IPC (Inter-Process Communication) system.
Binder uses a client-server model where the client sends requests to the server and the server responds with the requested data.
It is used for sharing data between different components of an Android application.
Bi...
sysctrl is a system control utility used to manage system settings and configurations.
sysctrl is used to manage system settings and configurations such as network settings, power management, and hardware configurations.
It can be used to start, stop, and restart system services.
sysctrl is commonly used in Linux and Unix-based operating systems.
Examples of sysctrl commands include 'sysctrl -p' to reload all settings from...
Device tree is a data structure used to describe hardware components in a system and their interconnections.
Device tree is used in embedded systems to provide a standardized way of describing hardware components.
It is written in a language called Device Tree Source (DTS) and compiled into a binary format called Device Tree Blob (DTB).
The device tree is loaded by the bootloader and used by the kernel to configure the ha...
4 IPCs used in user level process in Linux
Message Queues - allows processes to exchange data through messages
Shared Memory - allows processes to share a portion of memory
Semaphores - used for synchronization between processes
Pipes - allows communication between two related processes
Inter-process communication mechanisms like pipes, sockets, message queues, shared memory can be used to call a function from one user process to another.
Use pipes to establish a unidirectional communication channel between two processes.
Use sockets to establish a bidirectional communication channel between two processes.
Use message queues to send messages between processes.
Use shared memory to share data between proce...
Program with 2 threads printing even and odd numbers in sequence. How to make it SMP safe?
Use mutex locks to ensure only one thread accesses the shared resource (the number to be printed) at a time
Use condition variables to signal when it's safe for the other thread to access the shared resource
Use atomic variables to ensure that the shared resource is accessed atomically
Use thread-safe data structures to store the sha...
I applied via Referral and was interviewed in Mar 2023. There were 4 interview rounds.
Read and select answer
Discussion about last work and future challange
The designee is expected to meet billing targets, ensure accurate invoicing, resolve billing discrepancies, and maintain good relationships with clients.
Meet billing targets set by the company
Ensure accurate and timely invoicing
Resolve any billing discrepancies or issues
Maintain good relationships with clients to ensure prompt payment
Stay updated on billing regulations and procedures
based on 1 interview
Interview experience
Software Engineer
4
salaries
| ₹3.2 L/yr - ₹140 L/yr |
Program Manager 2
4
salaries
| ₹20.5 L/yr - ₹30 L/yr |
Microsoft Corporation
Apple
Samsung