SRBD

Founding year
Company Website	https://research.samsung.com/srbd
Career Website
Technologies Used	Windows, IOS, Android, Tizen, C/C++, Java, Objective-C, Swift, C#, Kotlin, Spring, WPF, UWP, MFC, Machine Learning

Introduction

Samsung R&D Institute Bangladesh (SRBD) started its journey in February 2011. Located in the heart of Dhaka, it is the first ever R&D hub set up by a multinational company in Bangladesh.

TIP

SRBD organizes a coding contest every year. The prize money is very handsome. Apart from that, if you do advance to round 2 or 3 means you might get a call for interview skipping the initial screening

Interview Stages

SRBD takes interview in two round.

1. Coding round: Round 1 is coding round. The problems are typically from leetcode. You can only proceed to round 2 if you can solve round 1 correctly.

2. Technical round: Round 2 is a technical round. You might get asked about basic theories or solve some simple problems

Coding Round Questions

You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons.

If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds of the array, then treat it as if there is a balloon with a 1 painted on it.

Return the maximum coins you can collect by bursting the balloons wisely.

Variants: coins achieved is nums[i-1]*nums[i+1]

💻 Submit Code

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. Construct a deep copy of the list.

The deep copy should consist of exactly n brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the next and random pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.

Mr. Kim has to deliver refrigerators to N customers. From the office, he is going to visit all the customers and then return to his home. Each location of the office, his home, and the customers is given in the form of integer coordinates (x,y) (0≤x≤100, 0≤y≤100) . The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office, his home, and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his among all the possibilities.

You are given the locations of the office, Mr. Kim’s home, and the customers; the number of the customers is in the range of 5 to 10.

Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his home. Your program only have to report the distance of a (the) shortest path.

You are given a directed graph represented by an adjacency list. Your task is to detect if there exists a cycle in the graph. If a cycle is found, print the nodes of the cycle in sorted order. Additionally, provide the results for each test case in the format "#testCaseNo node1 node2 ... nodeK". If no cycle is present, print 0.

You have string with repeated character. Example : abcaade. Count the number of characters that occur more than once. You can’t use array or map.

Technical Round Questions

In pen and paper write the inner workings of a BST. How does a BST work? How to insert and retrieve a value from a BST?

Thread A and Thread B are running parallely. What will be the output of following code?

Given 5 element. We want to search million time that will return if the searched element is present or no. What is the best time complexity.

Follow up question. We are guaranteed that each time new search element would be front the next position of previous search. Write code on pen & paper.

Follow up question. Suppose we have 5000 number each 500 digit. Now how will you search?

Benefits, Perks and Things to Consider

• Bonuses: SRBD offers 4 festival bonuses each year.
• Meals and Snacks: Free snacks and drinks are available in the office.