Filter interviews by
Merge multiple sorted arrays into a single sorted array efficiently.
Use a min-heap to keep track of the smallest elements from each array.
Extract the smallest element from the heap and add it to the result array.
Insert the next element from the array of the extracted element into the heap.
Repeat until all elements from all arrays are merged.
Example: Merging [1, 4, 5], [1, 3, 4], [2, 6] results in [1, 1, 2, 3, 4, 4...
Implementing a memory-safe stack in C using dynamic memory allocation and proper error handling.
Use dynamic memory allocation (malloc) for stack storage.
Implement push and pop functions with error checking.
Ensure to free allocated memory to prevent leaks.
Use a struct to encapsulate stack properties (size, capacity).
Check for stack underflow and overflow conditions.
I have worked on various software projects, focusing on web development, mobile apps, and data analysis tools.
Developed a responsive e-commerce website using React and Node.js, improving user engagement by 30%.
Created a mobile app for tracking fitness goals, which gained 5,000 downloads in the first month.
Built a data visualization tool using Python and D3.js to help stakeholders understand complex datasets.
Microprocessors are general-purpose CPUs, while microcontrollers integrate CPU, memory, and peripherals for specific tasks.
Microprocessors are designed for complex computations and run operating systems (e.g., Intel Core i7).
Microcontrollers are optimized for specific control tasks and often used in embedded systems (e.g., Arduino, PIC).
Microprocessors typically require external components like RAM and storage, wh...
Insertion in a doubly linked list involves adding nodes with pointers to both previous and next nodes for bidirectional traversal.
A doubly linked list node contains three parts: data, a pointer to the next node, and a pointer to the previous node.
To insert at the beginning, adjust the head pointer and update the new node's next and previous pointers.
To insert at the end, traverse to the last node, update its next ...
The question involves solving a data structure and algorithm problem, typically focusing on arrays or linked lists.
Understand the problem statement clearly before coding.
Identify the data structures that can be used (e.g., arrays, linked lists).
Consider edge cases, such as empty arrays or single-element arrays.
Optimize your solution for time and space complexity.
Test your solution with various inputs to ensure cor...
Detect endianness using C program
Use a union to create a variable with a known value
Check the value of the first byte to determine endianness
Big endian systems store the most significant byte first
Little endian systems store the least significant byte first
Example: union { int i; char c; } u; u.i = 1; if (u.c == 1) { /* Little endian */ } else { /* Big endian */ }
Implementing malloc involves managing memory allocation and tracking free memory blocks.
Use a memory pool to manage allocated and free blocks.
Implement a header structure for each block to store size and status.
Use a linked list or bitmap to track free memory blocks.
Consider splitting larger blocks when allocating smaller sizes.
Implement a free function to release allocated memory.
Merge two sorted linked lists into one sorted linked list.
Use a dummy node to simplify the merging process.
Iterate through both lists, comparing nodes and appending the smaller one.
Continue until one list is exhausted, then append the remainder of the other list.
Example: Merging 1->3->5 and 2->4->6 results in 1->2->3->4->5->6.
Union is a data structure that allows storing different data types in the same memory location, while structure is a data structure that allows storing different data types in a single unit.
Union uses the same memory location for all its members, while structure allocates separate memory for each member.
In a union, only one member can be accessed at a time, while in a structure, all members can be accessed simulta...
I applied via Approached by Company and was interviewed in Oct 2024. There were 3 interview rounds.
Aptitude and technical questions were asked
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
First round-aptitute and technical questions from C,OS,DBMS
Types of caching mechanisms include browser caching, server-side caching, and content delivery network (CDN) caching.
Browser caching: storing web page resources locally on a user's device to reduce load times on subsequent visits.
Server-side caching: storing data in memory on the server to reduce the need to fetch data from the database repeatedly.
Content Delivery Network (CDN) caching: caching content on servers distr...
Physical memory refers to the actual RAM installed in a computer, while virtual memory is a memory management technique that uses disk space as an extension of RAM.
Physical memory is the actual hardware component where data is stored temporarily for quick access by the CPU.
Virtual memory is a memory management technique that allows the operating system to use disk space as an extension of physical memory.
Physical memor...
The question involves solving a data structure and algorithm problem, typically focusing on arrays or linked lists.
Understand the problem statement clearly before coding.
Identify the data structures that can be used (e.g., arrays, linked lists).
Consider edge cases, such as empty arrays or single-element arrays.
Optimize your solution for time and space complexity.
Test your solution with various inputs to ensure correctn...
I appeared for an interview in Sep 2024.
Detect endianness using C program
Use a union to create a variable with a known value
Check the value of the first byte to determine endianness
Big endian systems store the most significant byte first
Little endian systems store the least significant byte first
Example: union { int i; char c; } u; u.i = 1; if (u.c == 1) { /* Little endian */ } else { /* Big endian */ }
Count set bits in a number using C programming language.
Use bitwise AND operation with 1 to check if the rightmost bit is set.
Shift the number to the right by 1 bit each time to check all bits.
Repeat the process until the number becomes 0, counting the set bits each time.
I applied via LinkedIn and was interviewed before Jan 2024. There were 4 interview rounds.
Hacker rank medium c coding
I applied via Company Website and was interviewed in Dec 2023. There was 1 interview round.
1.5 Hour - 45 que
Top trending discussions
Some of the top questions asked at the Qualcomm Software Engineer interview -
The duration of Qualcomm Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 27 interview experiences
Difficulty level
Duration
based on 101 reviews
Rating in categories
Senior Engineer
1.5k
salaries
| ₹14 L/yr - ₹50 L/yr |
Software Engineer
1.1k
salaries
| ₹10.5 L/yr - ₹36 L/yr |
Engineer
911
salaries
| ₹10 L/yr - ₹34 L/yr |
Senior Software Engineer
722
salaries
| ₹15 L/yr - ₹55.1 L/yr |
Senior Leader Engineer
513
salaries
| ₹19 L/yr - ₹70 L/yr |
Nvidia
Intel
Mercedes-Benz Research and Development India
Tata Electronics