Booking.com
Fiserv Interview Questions and Answers
Q1. design a configuration store management system
A configuration store management system to store and manage application configurations.
Use a centralized database to store configuration data
Implement version control to track changes and rollback if needed
Provide access control to limit who can modify configurations
Support different formats for configuration data (e.g. JSON, YAML)
Include an API for applications to retrieve configurations
Q2. Design payment system
Designing a payment system involves creating a secure and efficient platform for processing transactions.
Implement secure payment gateways to handle transactions
Include multiple payment options such as credit/debit cards, digital wallets, and bank transfers
Ensure compliance with PCI DSS standards for data security
Implement fraud detection mechanisms to prevent unauthorized transactions
Provide users with transaction history and receipts for transparency
Q3. What values related to Bookings do you closely align with?
I closely align with values related to Bookings such as accuracy, timeliness, and transparency.
Accuracy in recording and reporting bookings
Timeliness in updating booking information
Transparency in communicating booking details to stakeholders
Q4. array rotation by d places in the given array
Rotate array by d places
Create a temporary array to store elements to be rotated
Shift elements in the original array to the left by d places
Copy elements from the temporary array to the original array at the end
Q5. Tell me about the cross charges
Cross charges refer to the allocation of costs or expenses from one department or entity to another.
Cross charges are used to distribute costs fairly among different departments or entities.
They help in accurately reflecting the true cost of goods or services provided.
Examples include allocating IT costs to different business units based on their usage, or charging marketing expenses to specific product lines.
Cross charges are often based on predetermined allocation methods o...read more
Q6. bfs traversal with dfs traversal
BFS and DFS are traversal algorithms used in graph theory to visit all nodes in a graph.
BFS (Breadth-First Search) visits nodes level by level, while DFS (Depth-First Search) goes as deep as possible before backtracking.
BFS uses a queue data structure, while DFS uses a stack or recursion.
Example: BFS traversal of a graph starting from node A: A -> B -> C -> D -> E
Example: DFS traversal of a graph starting from node A: A -> B -> D -> E -> C
More about working at Booking.com
Top HR Questions asked in Fiserv
Interview Process at Fiserv
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month