AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Fingent
Compare
Filter interviews by
Fingent Backend Developer Interview Questions and Answers
Fingent Backend Developer Interview Experiences
1 interview found
Anonymous
I applied via Company Website and was interviewed in Mar 2020. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. About previous projects and challenges in those
- Q2. About how to create backends which can take high traffic
- Q3. Security related. SQL injection, XSS etc.
Interview Preparation Tips
Interview questions from similar companies
Normal java coding question
(2 Questions)
- Q1. What are spring ioc
- Ans.
Spring IoC (Inversion of Control) is a design pattern where the control of object creation and lifecycle is shifted to a container or framework.
In Spring IoC, objects are created and managed by the Spring container.
It helps in achieving loose coupling between classes.
Dependency Injection is a key feature of Spring IoC, where dependencies of a class are injected by the container.
Example: @Autowired annotation in Spring
- Q2. Different implementation of map interface
- Ans.
The Map interface in Java provides a way to store key-value pairs and retrieve values based on keys.
Different implementations of the Map interface include HashMap, TreeMap, LinkedHashMap, and ConcurrentHashMap.
HashMap provides constant-time performance for basic operations but does not guarantee the order of elements.
TreeMap maintains elements in sorted order based on keys.
LinkedHashMap maintains the insertion order of...
Skills evaluated in this interview
It's about implementing rest apis
(2 Questions)
- Q1. Java 8 interview
- Q2. Rest api development
Interview Questionnaire
9 Questions
- Q1. Questions related to the work done at my previous company
- Q2. Find if a given directed graph is cyclic or not
- Ans.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
- Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
- Ans.
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
- Q4. Find if a given Binary Tree is BST or not
- Ans.
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
- Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
- Ans.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
- Q6. Given an array of integers, print all possible permutations. Also explain your approach
- Ans.
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
- Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
- Ans.
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
- Q8. Given a linked list with loop, how would you find the starting point of the loop ?
- Ans.
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
- Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
- Ans.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
- Q1.
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an... - Ans.
The task is to determine if a given string of parentheses is balanced or not.
Iterate through the characters of the string and use a stack to keep track of opening parentheses.
When encountering an opening parenthesis, push it onto the stack. When encountering a closing parenthesis, check if it matches the top of the stack.
If the stack is empty at the end or there are unmatched parentheses, the string is not balanced.
Exa...
- Q2.
Palindrome Linked List Problem Statement
Determine if a given singly linked list of integers is a palindrome. Return
trueif it is a palindrome, otherwise returnfalse.Example:
Input:
1 -> 2 -> ...
- Ans.
Check if a given singly linked list of integers is a palindrome.
Use two pointers to find the middle of the linked list.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it is a palindrome.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical and managerial round. The interviewer gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
- Q1. What is a virtual function?
- Ans.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in object-oriented programming.
They are used to achieve runtime polymorphism by enabling late binding.
Virtual functions are declared in a base class and can be overridden in derived classes.
Example: v...
- Q2. Can you explain how to perform a level order traversal of a binary tree in spiral form?
- Ans.
Level order traversal of a binary tree in spiral form involves alternating between left and right while traversing each level.
Start by pushing the root node into a queue.
While the queue is not empty, pop a node, print its value, and push its children into the queue.
For each level, alternate between popping nodes from the queue and printing their values from left to right or right to left.
Continue this process until all
- Q3. What are abstract classes in C++?
- Ans.
Abstract classes in C++ are classes that cannot be instantiated and are designed to be base classes for other classes.
Abstract classes may contain pure virtual functions, making them incomplete and unable to be instantiated.
Derived classes must implement all pure virtual functions from the abstract class in order to be concrete classes.
Abstract classes can have non-virtual functions and member variables like regular cl...
(6 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was also a technical round. He asked to optimize the code I wrote in coding round. Then he asked me a few puzzles and questions on OOPS, OS and DBMS.
- Q1. Can you explain the ACID properties in the context of database management systems?
- Ans.
ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that either all operations in a transaction are completed successfully or none of them are.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that the e...
- Q2. What is the difference between paging and segmentation in operating systems?
- Ans.
Paging and segmentation are memory management techniques in operating systems.
Paging divides physical memory into fixed-size blocks called pages, while segmentation divides logical memory into variable-size segments.
Paging allows for efficient memory allocation and management, while segmentation provides protection and sharing of memory.
Paging is simpler to implement but can lead to internal fragmentation, while segmen...
- Q3. What is concurrency control?
- Ans.
Concurrency control is a technique used in databases to manage simultaneous access and modification of data by multiple users or processes.
Concurrency control ensures that transactions are executed in a way that maintains data consistency and integrity.
Techniques like locking, timestamp ordering, and optimistic concurrency control are used to implement concurrency control.
For example, in a banking system, concurrency c...
- Q4. What is the difference between String Buffer and String Builder in Java?
- Ans.
String Buffer is synchronized and thread-safe, while String Builder is not synchronized and faster.
String Buffer is synchronized, making it thread-safe for use in multi-threaded environments.
String Builder is not synchronized, resulting in faster performance but not thread-safe.
String Builder is preferred for single-threaded operations, while String Buffer is preferred for multi-threaded operations.
- Q5. What are smart pointers in C++?
- Ans.
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
- Q6. What is the difference between a mutex and a semaphore?
- Ans.
Mutex is used for exclusive access to a resource, while semaphore is used for controlling access to a resource by multiple threads.
Mutex is binary and allows only one thread to access the resource at a time.
Semaphore can have a count greater than one, allowing multiple threads to access the resource simultaneously.
Mutex is typically used for protecting critical sections of code, while semaphore is used for synchronizat...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The second round is also written but you need to write programming based on their concept.
- Q1.
Prime Numbers Identification
Given a positive integer
N, your task is to identify all prime numbers less than or equal toN.Explanation:
A prime number is a natural number greater than 1 that has no po...
- Ans.
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for better efficiency
Optimize by only checking up to the square root of N for divisors
- Q2.
Palindrome String Validation
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
Note:
The string 'S' should be evaluated in a case... - Ans.
Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.
Remove special characters and spaces from the string
Convert the string to lowercase
Check if the modified string is a palindrome by comparing characters from start and end
(6 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions mainly on Java and OOPS concepts.
- Q1. What is the difference between static methods and instance methods in Java?
- Ans.
Static methods belong to the class itself, while instance methods belong to individual objects of the class.
Static methods are called using the class name, while instance methods are called using object references.
Static methods cannot access instance variables directly, while instance methods can access both static and instance variables.
Static methods are shared among all instances of the class, while instance method...
- Q2. What is the difference between an abstract class and an interface in Java?
- Ans.
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructors, member variables, and methods with implementation.
Interface can only have abstract methods and constants.
A class can implement multiple interfaces but can only extend one abstract class.
Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m
- Q3. What is the difference between ClassNotFoundException and NoClassDefFoundError in Java?
- Ans.
ClassNotFoundException occurs when a class is not found during runtime, while NoClassDefFoundError occurs when a class was found during compilation but not during runtime.
ClassNotFoundException is a checked exception, while NoClassDefFoundError is an Error.
ClassNotFoundException occurs when a class is not found at runtime, usually due to a missing classpath or incorrect class name.
NoClassDefFoundError occurs when a cla...
- Q4. What is the difference between an Error and an Exception in Java?
- Ans.
Error is a serious issue that cannot be handled at runtime, while Exception is a recoverable issue that can be caught and handled.
Error is a subclass of Throwable and is usually caused by the environment or system, such as running out of memory or stack overflow.
Exception is also a subclass of Throwable but is caused by the application code, such as invalid input or file not found.
Errors are unchecked and are not meant...
- Q5. What is SerialVersionUID in Java?
- Ans.
SerialVersionUID is a unique identifier used by Java to ensure the compatibility of serialized objects.
SerialVersionUID is a static final long variable in a class that implements Serializable interface.
It is used to ensure that the serialized object can be deserialized correctly even if the class definition has changed.
If the SerialVersionUID of the serialized object does not match the one in the class, an InvalidClass...
- Q6. What are the requirements for creating an immutable class in Java?
- Ans.
Requirements for creating an immutable class in Java
Make the class final so it cannot be extended
Make all fields private and final
Do not provide setter methods, only getter methods
Ensure that mutable objects are not returned in getter methods
Override equals() and hashCode() methods for proper comparison
Consider making defensive copies of mutable fields in constructor or getter methods
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Shubham Jain
Interview Questionnaire
3 Questions
- Q1. Write a program for snake traversal of binary tree
- Ans.
Program for snake traversal of binary tree
Use a stack to keep track of nodes to be visited
Start with the root node and push it onto the stack
While the stack is not empty, pop a node and print its value
If the level is even, push the left child first and then the right child onto the stack
If the level is odd, push the right child first and then the left child onto the stack
- Q2. To write code to check linked list is palindrome or not, in a single traversal and without using any other data structure
- Ans.
Code to check if linked list is palindrome without using any other data structure and in a single traversal.
Traverse the linked list using two pointers, one slow and one fast
Reverse the first half of the linked list while traversing
Compare the reversed first half with the second half of the linked list
- Q3. Asked about OOPS concepts like abstraction, encapsulation, inheritance and polymorphism in detail and how they are implemented while programming
Interview Preparation Tips
Experience: It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
Coding part had questions like balanced parenthesis check, etc.
Round: Technical Interview
Experience: Technical and managerial. Gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
Then he asked 25 horses puzzle (-----.php/puzzles/25-horses-3-fastest-5-races-puzzle/). I solved it.
He then asked me to code it. I wrote an algorithm first and then the code. He was very impressed.
He asked about virtual functions, abstract classes, pure virtual functions.
Round: Technical Interview
Experience: He asked to optimize the code I wrote in coding round.
Then he asked me candle puzzle on how to measure 30 min and 45 min.
Then he asked me the chocolate puzzle (-----.html).
What is paging and segmentation?
What are ACID properties in DBMS?
What is transaction and how is concurrency control done?
What is the difference between string builder and string buffer?
What is string pool in java?
What is JVM, JRE, JDK?
Differentiate between mutex and semaphore?
Can you override private and static members?
Contiguous and non-contiguous memory allocation?
What are Smart pointers?
Skills:
College Name: NIT Jalandhar
Skills evaluated in this interview
I applied via Company Website and was interviewed in Nov 2020. There were 5 interview rounds.
Interview Questionnaire
1 Question
- Q1. Can you walk me through your resume?
Interview Preparation Tips
I applied via Referral and was interviewed in Oct 2020. There were 5 interview rounds.
Interview Questionnaire
2 Questions
- Q1. How to handle an impatient customer?
- Ans.
Handling an impatient customer requires active listening, empathy, and clear communication.
Listen actively to the customer's concerns and acknowledge their frustration.
Show empathy by putting yourself in their shoes and understanding their perspective.
Communicate clearly and honestly about the situation and what steps can be taken to resolve it.
Offer solutions or alternatives to help alleviate their frustration.
Follow ...
- Q2. What to do if the engineers have not given any ETA for the fix , how can you give an update to the customer?
- Ans.
Communicate with the customer and provide regular updates on the progress of the issue.
Request an update from the engineers and communicate the same to the customer.
Provide an estimated timeline based on the severity of the issue and the resources available.
Ensure that the customer is aware of any potential delays or roadblocks.
Offer alternative solutions or workarounds if possible.
Interview Preparation Tips
Selected
I appeared for an interview before Feb 2022.
(1 Question)
- Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
(1 Question)
- Q1. Total 3 round of Technical interviews.
Interview Preparation Tips
Fingent Interview FAQs
Tell us how to improve this page.
Fingent Interviews By Designations
- Fingent Software Engineer Interview Questions
- Fingent DOT NET Developer Interview Questions
- Fingent Project Manager Interview Questions
- Fingent Software Developer Interview Questions
- Fingent Junior Software Developer Interview Questions
- Fingent Senior Software Developer Interview Questions
- Fingent Backend Developer Interview Questions
- Fingent Senior Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Backend Developer Intern Interview Questions
- Node Js Backend Developer Interview Questions
- Backend Java Developer Interview Questions
- Senior Backend Developer Interview Questions
- Backend Developer Lead Interview Questions
- Backend Engineer Lead Interview Questions
- Backend Software Engineer Interview Questions
- Backend Associate Interview Questions
- Show more
Interview Questions from Similar Companies
Fingent Backend Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Software Engineer
188
salaries
|  ₹2.5 L/yr - ₹12.1 L/yr |
|
Senior Software Engineer
49
salaries
| ₹5.6 L/yr - ₹14.6 L/yr |
|
Specialist Testing
41
salaries
| ₹3.5 L/yr - ₹7.5 L/yr |
|
Software Developer
23
salaries
| ₹3.1 L/yr - ₹11.1 L/yr |
|
Team Lead
20
salaries
| ₹8.5 L/yr - ₹17.5 L/yr |
Yodlee
Bravura Solutions
TEOCO Software
ValGenesis
- Home >
- Interviews >
- Fingent Interview Questions >
- Fingent Backend Developer Interview Questions
