PayU Payments Software Developer Interview Questions and Answers

Q1. Basic DSA Question
Add your answer

Q1. Mobile Development Related Questions
Add your answer

Q1. Basic HR Questions
Add your answer

Moderate coding which will be easy if you are a computer science student

Q1. Tell me about yourself
Add your answer
Q2. What is your favourite subject
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

Q1. 
Zigzag Traversal of Binary Tree
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
Note:
In zigzag order, level 1 is printed from left to right...read more
Ans. Brute force
We can use level order traversal (recursive) to explore all levels of the tree. Also, at each level nodes should be printed in alternating order. 
 
For example - First level of tree should be printed in left to right manner, Second level of tree should be printed in right to left manner, Third again in left to right order and so on.
 
So, we will use a Direction variable whose value will toggle a...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. Brute force approach
We use Brute Force to solve this problem.
 
1. We iterate from 2 to N.
2. For each number num, we check if it is prime or not. We use the following approach to check if a given number is prime.
   1. We loop through all numbers from 2 to num - 1.
   2. For every number in the loop, we check if it divides num.
   3. If we find any number that divides num, we can say num is not prime.
   4. If num is prime, we store it in the result...read more
Answered Anonymously
Add your answer
Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
Add your answer