PayU Payments Software Developer Interview Questions and Answers

Q1. Sort the list, after many queries
Add your answer
Q2. LRU cache with multi level caching
Ans. 
LRU cache with multi level caching involves implementing a cache with multiple levels of storage, where the least recently used items are evicted first.
• Implement a two-level cache system with a primary cache (e.g. in-memory) and a secondary cache (e.g. disk-based).

• Use a data structure like a doubly linked list and a hash map to efficiently manage the cache and track the least recently used items.

• When an item is accesse...read more
Answered by AI
Add your answer

Q1. Basic oops, .net, c# coding, sql questions
Add your answer

Q1. More coding and details on project
Add your answer

Q1. More on projects and system design and troubleshooting approach
Add your answer

Q1. Salary discussion
Add your answer

Q1. More technical + managerial round even after HR round
Add your answer

One medium and one standard DP question

Q1. Medium level question based on binary search
Add your answer

Q1. Design google-pay
Ans. 
Design Google Pay - a digital wallet platform for online payments and transactions.
• Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.

• Enable users to make payments in stores, online, and within apps using their stored payment methods.

• Implement security features like biometric authentication, tokenization, and encryption to protect user data.

• Provide features fo...read more
Answered by AI
Add your answer
Q2. HLD of recursive
Ans. 
High Level Design (HLD) of recursive functions in software development.
• Recursive functions call themselves to solve smaller instances of the same problem.

• HLD of recursive functions involves defining the base case, recursive case, and termination condition.

• Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Answered by AI
Add your answer

Q1. Puzzles available on GFG
Add your answer
Q2. Behavioral question
Add your answer

Q1. LLD HLD HM rounds
Add your answer

Mcqs based on cs fundamentals and 2_3 coding questions

Q1. 2-3 DSA questions to be written on paper in the interview itself
Add your answer
Q2. Merge 2 sorted Linked list into 1
Ans. 
Merge two sorted linked lists into one.
• Create a new linked list to store the merged list.

• Compare the values of the nodes from both lists and add the smaller value to the new list.

• Move the pointer of the list with the smaller value to the next node.

• Repeat the comparison and addition until one of the lists is empty.

• Add the remaining nodes from the non-empty list to the new list.

• Return the new merged list.
Answered by AI
Add your answer

Q1. A full cv analysis interview round discussion on all the projects and team work experience
Add your answer