i
Ivalua
Filter interviews by
Sql mcq questions with medium difficulty
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Advantages of OOPs include reusability, modularity, and flexibility in code design.
Indexing in SQL is a way to optimize database queries by creating indexes on columns to improve search performance.
I was a Software Developer at XYZ Company. I followed Agile and Scrum methodologies.
Worked as a Software Developer at XYZ Company
Followed Agile and Scrum methodologies for project management
Participated in daily stand-up meetings, sprint planning, and retrospectives
Seeking new challenges and opportunities for growth.
Looking for new challenges and opportunities for professional growth
Interested in working on different technologies or projects
Seeking a more collaborative or innovative work environment
String is palindrome or not
Listeners in automation testing are components used to generate logs or reports during test execution.
Listeners are used to capture and display the execution status of test cases.
They can be used to generate detailed logs, screenshots, and reports for analysis.
Common listeners in automation testing include TestNG listeners, JUnit listeners, and ExtentReports.
Sourcing is the process of finding, evaluating, and selecting suppliers to provide goods or services.
Identifying potential suppliers
Evaluating supplier capabilities and performance
Negotiating contracts and terms
Managing supplier relationships
Ensuring timely delivery and quality of goods/services
Data analysis methods involve various techniques to analyze and interpret data to derive insights and make informed decisions.
Data visualization using charts, graphs, and dashboards
Statistical analysis to identify patterns and trends
Machine learning algorithms for predictive analytics
Data mining to discover hidden patterns and relationships
Text analysis for sentiment analysis and topic modeling
I applied via Naukri.com and was interviewed in Mar 2022. There were 4 interview rounds.
Candidates will receive a link to quiz/code test
Ivalua interview questions for popular designations
Top trending discussions
I applied via Campus Placement and was interviewed before May 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Current affairs - relevant things going on in the world especially financial/Fintech domain
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
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
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.
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
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
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
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.
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
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
based on 3 interviews
Interview experience
Implementation Lead
22
salaries
| ₹14.4 L/yr - ₹21 L/yr |
Customer Application Engineer
17
salaries
| ₹8.5 L/yr - ₹18 L/yr |
Implementation Specialist
15
salaries
| ₹8.7 L/yr - ₹16 L/yr |
Software Engineer
12
salaries
| ₹10.5 L/yr - ₹17 L/yr |
Project Engineer
8
salaries
| ₹7 L/yr - ₹16 L/yr |
Yodlee
Fingent
Bravura Solutions
TEOCO Software