Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There was 1 interview round.
To find errors in a program, analyze code for syntax, logic, and runtime issues.
Check for syntax errors such as missing semicolons or parentheses
Look for logical errors that may cause unexpected behavior
Identify runtime errors like null pointer exceptions or out of bounds array access
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 Campus Placement and was interviewed in Jan 2021. There were 4 interview rounds.
Duration: 75 min
Platform: HakerRank
There were some 20 questions related to logical, analytical thinking and some maths questions
I applied via Company Website and was interviewed in Apr 2022. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Jul 2022. There were 5 interview rounds.
It was a online test including apti or some OOPs concept
In this they asked me about stacks and linked list and some javaprogram
DSA and other questions
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
based on 1 interview
Interview experience
R&D Engineer
87
salaries
| ₹7 L/yr - ₹26.9 L/yr |
Finance Coordinator
58
salaries
| ₹3.2 L/yr - ₹6.5 L/yr |
Finance Program Specialist
52
salaries
| ₹5.1 L/yr - ₹8 L/yr |
Financial Associate
47
salaries
| ₹6.5 L/yr - ₹12 L/yr |
Software Engineer
43
salaries
| ₹4.5 L/yr - ₹15 L/yr |
Flex
Foxconn
Dixon Technologies
ECIL