Filter interviews by
SQL functions and medium level query questions.
Top trending discussions
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 Referral and was interviewed before May 2020. There were 4 interview rounds.
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 Company Website and was interviewed in Mar 2024. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before Dec 2021. There were 4 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 Walk-in and was interviewed in Nov 2023. There were 3 interview rounds.
I have over 10 years of experience in various technical roles, including software development, system architecture, and project management.
10+ years of experience in technical roles
Strong background in software development
Experience in system architecture and project management
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Area Sales Manager
225
salaries
| ₹7.5 L/yr - ₹27 L/yr |
Senior Area Sales Manager
82
salaries
| ₹14 L/yr - ₹31.5 L/yr |
Technical Associate
48
salaries
| ₹2.9 L/yr - ₹9 L/yr |
Regional Sales Manager
40
salaries
| ₹18.5 L/yr - ₹39.4 L/yr |
Marketing Manager
40
salaries
| ₹10.7 L/yr - ₹37.3 L/yr |
Flex
Foxconn
Dixon Technologies
ECIL