Smart Energy Water Software Developer Interview Questions and Answers

Round duration - 65 minutes
Round difficulty - Medium

it was a technical round consists of aptitude questions and coding round.

Q1. 
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...read more
Ans. Brute Force Approach
The basic idea is to traverse the array and count the frequency of each element. 
 
We will run two nested loops till ‘N’ and store the count of each array element in ‘maxCount’. If for any element, ‘maxCount' becomes greater than ‘N’ / 2, we will return that element as the majority element. 
 
If no majority element is found, we will return -1.
Space Complexity: O(1)Explanation:
O(1)
...read more
Answered Anonymously
Add your answer
Q2. 
Rotate Matrix to the Right
You are provided with a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns. Your task is to rotate the matrix to the right 'K' times,...read more
Ans. Row-wise rotation
This approach is based on the fact that when we rotate an array to the right by ‘K’ times, it shifts ‘K’ elements from the end to the beginning of the array while the remaining elements shift towards the end. The effective rotations in ‘MAT’ can be from 0 to 'M' - 1, as we get the same matrix ‘MAT’ after every 'M' rotations. So, we will set ‘K’ to ‘K’ % ‘M’.
 
Now, we traverse ‘MAT’ row-wise. We wil...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

I was asked to solve problems based on NLP,DBMS,ML. Some of them were situational based questions.

Q1. 
Postfix Expression Evaluation Problem Statement
Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...read more
Ans. Evaluation of postfix expression.
 The idea is to use a stack to store the operands. Whenever an operator is encountered, we pop the top two numbers from the stack, perform the operation and push the result back to the stack. Finally, when the traversal is completed, the number left in the stack is the final answer.
 
1. Create a stack to store the operands.
2. Scan the given expression from left to right. For every sc...read more
Answered Anonymously
Add your answer