i
Efftronics Systems
Filter interviews by
I applied via Walk-in and was interviewed in Dec 2022. There were 3 interview rounds.
They put the general aptitude test and also conducted the basic electronics there are nearly 40 questions are given by them
I applied via Walk-in and was interviewed before Aug 2022. There were 5 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 appeared for an interview in Dec 2016.
I will communicate effectively, follow instructions, seek feedback, and collaborate with my supervisor.
Communicate regularly with supervisor to provide updates on progress and ask for clarification when needed
Follow instructions carefully and ask for help if unsure about a task
Seek feedback on my work to improve and grow professionally
Collaborate with supervisor and team members to achieve project goals
Provide suggesti
I applied via Campus Placement and was interviewed in Feb 2022. There were 2 interview rounds.
It was aptitude and technical MCQ questions round
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 LinkedIn and was interviewed before Aug 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2020. There was 1 interview round.
based on 2 interviews
Interview experience
based on 8 reviews
Rating in categories
Service Engineer
52
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Solution Support Engineer
45
salaries
| ₹1.5 L/yr - ₹5.5 L/yr |
Technical Support Engineer
35
salaries
| ₹1.7 L/yr - ₹5 L/yr |
Firmware Engineer
30
salaries
| ₹3.5 L/yr - ₹8.7 L/yr |
Software Engineer
30
salaries
| ₹2.9 L/yr - ₹10 L/yr |
TE Connectivity
Vertiv
Navitasys India
Mitsubishi Electric India