SMERA Ratings Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Palindrome String Validation
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
Note:
The string 'S' should be evaluated in a case...read more
Ans. 
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
• Convert the string to lowercase and remove all symbols and whitespaces.

• Reverse the modified string and compare it with the original string.

• If they are equal, then the string is a palindrome.

• If not, then the string is not a palindrome.
Answered by AI
Add your answer
Q2. 
Square Root (Integral) Problem Statement
Given a number N, calculate its square root and output the integer part only.
Example:
Input:
18
Output:
4
Explanation:
The square root of 18 is approximate...read more
Ans. 
The task is to find the integral part of the square root of a given number.
• Use the built-in square root function to find the square root of the number.

• Convert the result to an integer by rounding down or using the floor function.

• Print the integer part of the square root as the output.
Answered by AI
Add your answer
Q3. 
Min Steps to One Using Dynamic Programming
Given a positive integer N, your task is to determine the minimum number of steps required to reduce N to 1.
Allowed Operations:
1) Subtract 1 from it: n = n -...read more
Ans. 
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
• Use dynamic programming to solve the problem efficiently.

• Create an array to store the minimum steps required for each number from 1 to N.

• Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.

• Return the minimum steps for N.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

They started Fundamentals of OOP- Inheritance, Polymorphism

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
• Initialize two variables, maxSum and currentSum, both set to the first element of the array.

• Iterate through the array from the second element.

• For each element, update currentSum by adding the element to it.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• After iterating ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom