Filter interviews by
I applied via Company Website and was interviewed in Jul 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.
Top trending discussions
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
posted on 25 Sep 2020
I applied via Company Website and was interviewed before Sep 2019. There were 5 interview rounds.
posted on 11 Nov 2019
I applied via Naukri.com and was interviewed in May 2019. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.
2 moderate data structure problems
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
Declare variables for first two numbers of the series
Use a loop to generate the series by adding the previous two numbers
Store the series in an array or print each number as it is generated
Join two tables on a key column using SQL
Use the JOIN keyword followed by the name of the second table
Specify the key column in both tables using the ON keyword
Choose the type of join (INNER, LEFT, RIGHT, FULL) based on your requirement
To find the frequency of each word in a sentence.
Split the sentence into words
Create a dictionary to store word frequency
Iterate through the words and update the dictionary
Return the dictionary
Some of the top questions asked at the Fidelity National Financial Software Engineer interview -
based on 15 reviews
Rating in categories
Senior Analyst
944
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
784
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Analyst
338
salaries
| ₹0 L/yr - ₹0 L/yr |
Process Analyst
212
salaries
| ₹0 L/yr - ₹0 L/yr |
Specialist
190
salaries
| ₹0 L/yr - ₹0 L/yr |
Wells Fargo
Citicorp
American Express
UBS