Fincart Software Engineer Interview Questions and Answers

2 questions. 1 was basic level. 2 was of medium level.

Q1. An ambiguous problem statement was given. Asking relevant questions revealed the problem to be largest island in a binary matrix. Was asked to code on an ide. And reduce space complexity to O(1).
Add your answer
Q2. Maximum sum path from root to leaf in an N-ary tree. Was asked to design an appropriate data structure. Then code the solution in O(n) time and O(1) space.
Add your answer

Q1. Through discuss of projects. Methods used.
Add your answer
Q2. First missing positive number in an array of integer in O(n) time O(1) space.
Ans. 
Find first missing positive number in an array in O(n) time and O(1) space.
• Traverse the array and mark the presence of each positive integer by changing the sign of the corresponding index.

• Traverse the array again and return the index of the first positive integer.

• If all integers are present, return the length of the array + 1.

• Example: [3, 4, -1, 1] => mark 3rd and 4th index as negative => return 2.

• Example: [1, 2, 0] =...read more
Answered by AI
Add your answer
Q3. Given an integer, print the relevant column name in an excel sheet. Ex: 1- A , 2-B.......... 26-Z , 27-AA, 28-AB........ Was asked code on an ide and test cases were given.
Ans. 
Given an integer, print the relevant column name in an excel sheet.
• Create a string array of alphabets from A to Z

• Use modulo operator to get remainder and divide by 26 to get quotient

• Append the corresponding alphabet to the result string

• Reverse the result string
Answered by AI
Add your answer

Q1. What are your salary expectations?
Add your answer

Maths,quant for 1 hour duration

Arrays, strings, linked list, palindrome

Q1. Same as posted in advice
Add your answer

1 hour 10 mins, MERN Stack, Face to Face. Mongodb, medium DSA Question, callback, eventloop, NodeJS asynchronous working

Arrays, LinkedList basic dsa questions

Q1. Binary Tree 2nd largest node
Ans. 
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
• Perform an in-order traversal of the binary tree

• Keep track of the two largest nodes encountered

• Return the second largest node when traversal is complete
Answered by AI
Add your answer
Q2. Basic web questions
Add your answer

Easy coding question generally A, B level question of codeforces

Q1. OOPs, DBMS , Computer network and some basics over java
Add your answer

JavaScript questions

Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree

Q1. DSA ZigZag tree traversal OS Architecture of RAM Types of RAM Difference between compiler and interpreter What is a scheduler What is multithreading Disadvantages of FCFS and how can we use RoundRobin to ...read more
Ans. 
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
• In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.

• We can use a stack or a queue to implement ZigZag tree traversal.

• The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.

• We start with the root node and alternate be...read more
Answered by AI
Add your answer