Secure Meters Senior Software Developer Interview Questions and Answers

The authentication related questions and architecture wise too.

Q1. Mostly about .Net, AWS, Angular
Add your answer

Q1. Mostly about AWS, .Net
Add your answer

Q1. Behavioral Round + Salary Discussion
Add your answer

Q1. Salary expectation .
Ans. 
I expect a competitive salary based on my skills, experience, and industry standards.
• Research industry standards: For example, Glassdoor or Payscale can provide insights into average salaries for similar roles.

• Consider my experience: With 5 years in software development, I would expect a salary in the range of $80,000 to $100,000.

• Location matters: Salaries can vary significantly by region; for instance, tech hubs like ...read more
Answered by AI
Add your answer
Q2. Why should I hire you?
Add your answer

Q1. Mendix Advanced questions.
Add your answer
Q2. Everything which you mentioned in your resume.
Add your answer

Round duration - 30. minutes
Round difficulty - Easy

It was in the evening, question were moderate

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. 
Count the total number of subsequences in which all elements are equal in an integer array.
• Iterate through the array and count the frequency of each element.

• Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).

• Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the night around 9:00 PM.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Given an array and a target sum, find all pairs of elements that add up to the target sum.
• Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the pairs based on the first element and then the second element.

• Return the list of pairs as the final result.
Answered by AI
Add your answer

Assigned data analysis project

Q1. Tell me about your self
Add your answer
Q2. Tell abt the projects
Add your answer

2 coding questions one was greedy and 2nd one was of dp.