Filter interviews by
Clear (1)
DSA Based - Graph, Trees
Trie is a tree data structure used for efficient retrieval of key-value pairs.
Trie is also known as prefix tree.
Each node in a trie represents a single character of a key.
Trie is commonly used in autocomplete and spell checking algorithms.
Example: Inserting 'apple' and 'app' into a trie would result in a structure where 'app' is a prefix of 'apple'.
LRU (Least Recently Used) is a cache eviction policy that removes the least recently used items first.
LRU cache stores key-value pairs with a maximum capacity.
When the cache is full, the least recently used item is removed to make space for new items.
Each time a key is accessed, it is moved to the front of the cache to indicate it was recently used.
It takes the professional test for coding skill test, It takes 4 hours to complete the test
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
2 hr test with 2 questions
Normal quantitative and data analytics questions
Implement a function to check if a given string is palindrome
Samsung Research interview questions for designations
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
3 questions in 1 hour . Platform - Cocubes . Whoever solved all three questions were shortlisted.
Get interview-ready with Top Samsung Research Interview Questions
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Data structure and algorithms
Solving coding questions using pseudo code
I was interviewed before Nov 2020.
Round duration - 150 Minutes
Round difficulty - Medium
Have to attempt 2 programming questions within 2:30 hours. Can take any time over the weekend. Relatively easy problems. Questions were long, but the solution code was small.
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to generate the skyline.
Merge consecutive horizontal segments of equal height to ensure no duplicates in the output.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base case of a single node or empty list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 240 Minutes
Round difficulty - Medium
Had to solve 1 programming question in 4 hours. It was in the morning on a weekend. The environment was not so good. It was a small institute and got very crowded. The platform was also buggy. but the question was not difficult. Was able to solve it in just 1 hour and leave.
Alex has acquired a machine that can photocopy photos in batches of a minimum size 'K'. Given 'N' photos with resolutions represented in an integer array photos
, the machine prod...
Minimize maximum error by splitting photos into batches of size at least 'K'.
Sort the array of resolutions in ascending order.
Iterate through the array and calculate the error for each possible batch.
Return the minimum possible maximum error found.
Round duration - 30 Minutes
Round difficulty - Easy
It was in the afternoon. The interviewer basically asked me what technologies I have worked on. Checked my knowledge of those technologies with simple questions. Told me what I'll be working on if I get selected.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.
Example: If current element is 0, swap it with element at left pointer and increment both pointers.
E...
Round duration - 90 Minutes
Round difficulty - Hard
It was also in the afternoon. The interviewer was the member of the team I'll be working on if I get selected. He asked me some basic questions about related technologies.
Gave me 2-3 DS & Algo problems and asked me to solve them.
Calculate the sum of all elements in an array of length N
.
Line 1: An integer N indicating the size of the array.
Line 2: N integers, the elements of the array, separated by ...
Calculate the sum of all elements in an array of length N.
Iterate through the array and add each element to a running sum.
Return the final sum as the output.
An alien dropped its dictionary while visiting Earth. The Ninja wants to determine the order of characters used in the alien language, based on the given list of wor...
Determine the order of characters in an alien language based on a list of words.
Create a graph where each character is a node and there is a directed edge from character 'a' to character 'b' if 'a' comes before 'b' in any word.
Perform a topological sort on the graph to get the order of characters.
Return the order as a string in lexicographical order.
Tip 1 : It's a Daily process. Not weekly, Not monthly. DAILY!
Tip 2 : Take part in Online Contests. HackerEarth is best for Contests posted by companies.
Tip 3 : Even after you have solved some problem, try to find a better solution for it online. Companies don't want a solution, they want optimized solution.
Tip 1 : Modify resume for each job you are applying for. It should show why you are suitable for that particular job.
Tip 2 : Remove any extra things like interests and hobbies. No one cares.
I was interviewed in Jun 2016.
Top trending discussions
I was interviewed in May 2017.
String is immutable because it ensures data integrity and allows for efficient memory management.
Immutable strings prevent accidental modification of data.
Immutable strings can be easily shared and reused, improving memory efficiency.
Immutable strings enable efficient string interning and caching.
Immutable strings support thread safety in concurrent environments.
Yes, @RequestParam has a default value if not specified.
If a @RequestParam is not provided in the request, it will use its default value.
The default value can be set using the 'defaultValue' attribute of @RequestParam annotation.
If no default value is specified, the parameter will be considered as required and an exception will be thrown if not provided.
Abstract classes are required to provide a common interface and share code among related classes.
Abstract classes allow for code reusability and promote modular design.
They provide a common interface for a group of related classes.
Abstract classes can define abstract methods that must be implemented by subclasses.
They can also provide default implementations for common methods.
Abstract classes cannot be instantiated, b
I was interviewed in Jul 2017.
based on 7 interviews
2 Interview rounds
based on 41 reviews
Rating in categories
Software Engineer
1.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Engineer
639
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
548
salaries
| ₹0 L/yr - ₹0 L/yr |
Chief Engineer
377
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
322
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Research
IBM Research
Intel
TCS