Samsung Research Engineer, Software Engineer Interview Questions and Answers

2 coding questions along with multiple choice questions

Q1. Fibonacci series coding question
Add your answer
Q2. Strong number coding problem
Ans. 
Strong number coding problem involves finding numbers whose sum of factorial of digits is equal to the number itself.
• Iterate through numbers and check if sum of factorial of digits equals the number

• Use a function to calculate factorial of digits

• Examples: 145, 40585
Answered by AI
Add your answer

Q1. Sql rank order explain
Ans. 
SQL rank order function explanation
• Rank order function in SQL assigns a rank to each row based on a specified column

• It can be used to determine the top or bottom N records in a dataset

• Example: SELECT column1, column2, RANK() OVER (ORDER BY column3 DESC) AS rank_order FROM table_name
Answered by AI
Add your answer
Q2. Merging two tables
Ans. 
Merging two tables involves combining data from both tables based on a common key.
• Identify a common key between the two tables

• Use SQL JOIN statements to merge the tables

• Choose the appropriate type of join (e.g. inner join, outer join)

• Consider the size of the tables and the performance implications of the merge
Answered by AI
Add your answer

Data structures, linq and .net core related questions

Q1. Angular and .net core related questions
Add your answer

Q1. About salary discussion
Add your answer

Q1. Probability of bit error in a binary symmetric channel
Ans. 
The probability of bit error in a binary symmetric channel can be calculated using the formula P = 1/2 * erfc(sqrt(Eb/N0)), where erfc is the complementary error function.
• Probability of bit error in a binary symmetric channel is influenced by the signal-to-noise ratio (Eb/N0).

• The error function erfc is used to calculate the probability of bit error.

• The formula for calculating the probability of bit error is P = 1/2 * e
Answered by AI
Add your answer

It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls

Q1. This was a 1:1 online technical interview.
Add your answer
Q2. Basic question on web development, regarding projects in resume. 1 problem solving question and DSA basics
Add your answer
Q3. I was asked to explain merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Asked to create a power bi dashboard
Add your answer

Q1. Had coding test on SQL and Python
Add your answer

Q1. Previous experience
Add your answer

Q1. Previous experience
Add your answer