i
Secure Meters
Filter interviews by
I applied via Walk-in and was interviewed before Aug 2022. There were 2 interview rounds.
Top trending discussions
I applied via Recruitment Consultant and was interviewed before Oct 2020. There were 5 interview rounds.
Developed a web-based project management tool for a software development company.
Used Agile methodology for project management
Implemented user authentication and authorization
Integrated with third-party tools like JIRA and GitHub
Provided real-time project progress tracking
Generated reports for project analysis
I applied via Referral and was interviewed before May 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Apr 2021. There were 3 interview rounds.
I applied via Other and was interviewed before Oct 2019. There were 3 interview rounds.
I applied via Company Website and was interviewed in Feb 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed in May 2022. There were 3 interview rounds.
I appeared for an interview in Jan 2021.
Round duration - 30. minutes
Round difficulty - Easy
It was in the evening, question were moderate
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
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.
Round duration - 30 minutes
Round difficulty - Easy
It was in the night around 9:00 PM.
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'.
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.
Tip 1 : Learn new things daily
Tip 2 : Practice questions
Tip 3 : Keep one question in mind to solve.
Tip 1 : Description about your skills
Tip 2 : Project details
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Executive
127
salaries
| ₹3 L/yr - ₹10 L/yr |
Manager
105
salaries
| ₹7 L/yr - ₹23.3 L/yr |
Engineer
105
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Engineer 1
89
salaries
| ₹2.7 L/yr - ₹5 L/yr |
Software Developer
69
salaries
| ₹4 L/yr - ₹7.8 L/yr |
Bharat Electronics
Flex
Foxconn
Dixon Technologies