i
FIS
Filter interviews by
I applied via Naukri.com and was interviewed in May 2022. There were 4 interview rounds.
I was interviewed before Apr 2023.
Medium level DSA question
Top trending discussions
I applied via Company Website and was interviewed in Oct 2024. There was 1 interview round.
Asked to write a bank application - which includes adding,removing,transferring of money
Experienced technical lead with a strong background in software development and project management.
Over 8 years of experience in leading technical teams and delivering successful projects
Proficient in various programming languages such as Java, Python, and JavaScript
Skilled in Agile methodologies and implementing best practices for software development
Strong communication and leadership skills, able to collaborate effe
I was interviewed in Nov 2024.
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Aug 2023. There were 4 interview rounds.
Use a SELECT statement with a GROUP BY clause to remove duplicate records from a table.
Use the DISTINCT keyword in a SELECT statement to retrieve unique records.
Use the GROUP BY clause with appropriate columns to group duplicate records together.
Consider using the ROW_NUMBER() function to assign a unique number to each row and then filter out duplicates based on this number.
I applied via Naukri.com and was interviewed in May 2022. There were 2 interview rounds.
Separate out 0's, 1's, and 2's in an array
Create three variables to count the number of 0's, 1's, and 2's in the array
Loop through the array and increment the respective variable for each occurrence
Create a new array and add the counted number of 0's, 1's, and 2's in order
Remove duplicates from given array of strings
Create a new empty array
Loop through the original array and check if the element already exists in the new array
If not, add it to the new array
Return the new array
Loop in linked list can be detected using Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop, the faster pointer will eventually catch up to the slower pointer.
If there is no loop, the faster pointer will reach the end of the list.
Time complexity of this algorithm is O(n) and space complexity is O(1).
based on 1 review
Rating in categories
Senior Software Engineer
2.7k
salaries
| ₹8 L/yr - ₹30 L/yr |
Software Engineer
1.6k
salaries
| ₹4.1 L/yr - ₹16 L/yr |
Lead Engineer
676
salaries
| ₹8 L/yr - ₹26.4 L/yr |
Team Member
672
salaries
| ₹1.5 L/yr - ₹5.5 L/yr |
Senior Leader Engineer
634
salaries
| ₹9.9 L/yr - ₹30.5 L/yr |
TCS
Infosys
Wipro
HCLTech