Filter interviews by
I applied via Approached by Company and was interviewed in Jun 2022. There were 3 interview rounds.
Sort the array in descending order and return the second element.
Sort the array in descending order using any sorting algorithm.
Return the second element of the sorted array.
Primitive data update is faster and simpler than object data update.
Primitive data update involves updating simple data types like integers and booleans.
Object data update involves updating complex data types like arrays and objects.
Primitive data update is faster and simpler because it involves less overhead.
Object data update is slower and more complex because it involves more overhead.
Example of primitive data updat...
An immediately invoked function to print a sequence
Create a function with the sequence to be printed
Wrap the function in parentheses to make it immediately invoked
Use console.log() to print the sequence
Example: (function() { for(let i=1; i<=5; i++) console.log(i); })();
1. Question on Graph LC-Hard 2. Question on BFS LC-Medium
Find missing number in array without extra space
Iterate through the array and XOR all the elements with their indices and the actual numbers
The missing number will be the XOR result
Example: ['1', '2', '4', '5'] -> XOR(0, 1) ^ XOR(1, 2) ^ XOR(2, 4) ^ XOR(3, 5) = 3
Implementing Heap data structure in C++
Use an array to represent the binary tree structure of the heap
Implement functions for inserting elements, deleting elements, and heapifying the array
Ensure that the heap property is maintained (parent node is always greater than or equal to its children)
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
Use a combination of a doubly linked list and a hashmap to efficiently implement LRU Cache.
Keep track of the least recently used item at the tail of the linked list.
When an item is accessed, move it to the head of the linked list to mark it as the most recently used item.
When adding a new it...
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
Ppt and discussion - on all things in the company
Leetcode - 2 medium, 1 hard
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
They asked some technical interview questions
Was good and you get questions from various topics.
Apti
Basics of cs
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
Questions were easy and on basic algorithm
I am a software engineer with experience in web development and problem-solving.
I have a Bachelor's degree in Computer Science.
I have worked on various web development projects using languages like JavaScript, HTML, and CSS.
I am proficient in using frameworks like React and Angular.
I have experience in database management using SQL and NoSQL.
I have strong problem-solving and analytical skills.
I am a quick learner and a...
A linked list is a linear data structure where elements are stored in nodes with each node pointing to the next node in the sequence.
Consists of nodes connected by pointers
Does not have a fixed size like arrays
Can easily insert or delete elements without shifting other elements
Examples: Singly linked list, Doubly linked list, Circular linked list
Sets in JavaScript are used to store unique values of any type.
Create a new set using the Set constructor
Add values to the set using the add() method
Check if a value exists in the set using the has() method
Remove a value from the set using the delete() method
Iterate over the set using the forEach() method
I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
Shallow copy creates a new object with references to the original object's data, while deep copy creates a new object with copies of the original object's data.
Shallow copy only duplicates the references to the original object's data, not the data itself.
Deep copy creates a new object with copies of the original object's data, ensuring that changes to the copied object do not affect the original object.
In Java, shallow...
Basics of aptitude logical reasoning and etcs
Wap for palindrome even odd and some string questions
TCS
Accenture
Wipro
Cognizant