Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Paytm Team. If you also belong to the team, you can get access from here

Paytm Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Paytm Software Development Engineer Interview Questions and Answers

Updated 23 Nov 2024

Paytm Software Development Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Backend Questions related to project I mentioned on resume
  • Q2. LinkedList questions from easy to medium. One was like to insert the gcd of consecutive two nodes in between them .
Round 2 - HR 

(2 Questions)

  • Q1. Basic Hr questions.why you wanna join.
  • Q2. Star questions in behaviour round

Interview Preparation Tips

Interview preparation tips for other job seekers - Interact with interview as much as poss

Interview questions from similar companies

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

  • Q1. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently

    • Create a 2D array to store if a subset with a particular sum exists

    • Iterate through the array and update the 2D array accordingly

    • Check if the value at the end of the iteration is true for the given K

  • Answered by AI
  • Q2. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to print the traversal sequence in the correct order.

    • Handle disconnected components by checking for unvisited nodes.

    • Follow the BFS approach of exploring neighbors before moving to the next level.

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

  • Q1. 

    Replace Spaces in a String

    Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".

    Input:

    The first line contains an integ...
  • Ans. 

    Replace spaces in a string with '@40'.

    • Iterate through each character in the string

    • Replace spaces with '@40'

    • Return the modified string

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview Round with questions based on Data structures, OOPS and SQL.

  • Q1. 

    Delete a Node from a Linked List

    You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle edge cases such as deleting the head or tail of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
  • Q2. Write an SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries

    • Combine the above steps in a single query to find the nth highest salary

  • Answered by AI
  • Q3. Can you explain the concepts of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

    • OOP focuses on creating objects that interact with each other to solve problems.

    • Key concepts include encapsulation, inheritance, and polymorphism.

    • Encapsulation involves bundling data and methods that operate on the data into a single unit.

    • Inheritance allows classes to inherit at...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site­ like the one satyam has.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order and return the Kth element.

    • Handle multiple test cases efficiently.

    • Ensure all elements in the array are distinct.

  • Answered by AI
  • Q2. What are virtual functions?
  • Ans. 

    Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.

    • Virtual functions are declared in a base class with the 'virtual' keyword.

    • They are overridden in derived classes using the 'override' keyword.

    • They allow a function to be called based on the runtime type of an object.

    • Virtual functions enable dynamic binding and late binding in C++.

    • Example: virtual void ...

  • Answered by AI
  • Q3. Design a Cinema Ticket Reservation System.
  • Ans. 

    Design a Cinema Ticket Reservation System

    • Use a database to store movie information, showtimes, and seat availability

    • Allow users to search for movies, select showtimes, and choose seats

    • Implement a payment system for ticket purchases

    • Send confirmation emails with QR codes for ticket validation

  • Answered by AI
  • Q4. In how many attempts can you find a defective ball among 10 given balls using a two-pan balance scale?
  • Ans. 

    You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.

    • Divide the 10 balls into two groups of 5 each.

    • Weigh the two groups on the balance scale.

    • If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.

    • Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.

    • Weigh the two groups on the bala...

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.

  • Q1. Can you tell me about your projects and your extracurricular activities?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.

  • Q1. 

    Minimum Cost Path Problem Statement

    Given an N x M matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y) and ends at the top left corner of t...

  • Ans. 

    The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.

    • Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.

    • Consider the three possible moves: down, right, and down-right diagonal.

    • Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.

    • Finally, the mini...

  • Answered by AI
  • Q2. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use backtracking to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Character Counting Challenge

    Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...

  • Ans. 

    Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.

    • Read characters from input stream until '$' is encountered

    • Count lowercase alphabets, digits, and white spaces separately

    • Print the counts of each character type as three integers separated by spaces

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order.

    • Return the last K elements of the sorted array.

  • Answered by AI
  • Q3. How can you check whether you have an internet connection on your system?
  • Ans. 

    To check internet connection on a system, you can use various methods like pinging a website or checking network status.

    • Use ping command to check connectivity to a website (e.g. ping www.google.com)

    • Check network status using network settings or command line tools

    • Try accessing a website or online service to verify internet connection

  • Answered by AI
  • Q4. What happens when you type a URL in a web browser?
  • Ans. 

    When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.

    • Browser checks cache for DNS resolution

    • If not found, browser sends a DNS query to resolve the domain name to an IP address

    • Browser establishes a TCP connection with the server

    • Browser sends an HTTP request to the server for the webpage

    • Server processes the...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.

    • Place each element in its correct position based on the prefix sum.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.

    • Example: ...

  • Answered by AI
  • Q2. What are the applications of the Fibonacci series in real life?
  • Ans. 

    The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.

    • Used in algorithms for optimization problems and dynamic programming.

    • Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.

    • Applied in financial markets for predicting stock prices and analyzing market trends.

    • Utilized in art and design for creating

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Questions about projects
  • Q2. Why Paypal?
  • Ans. 

    Paypal is a leading online payment platform with a strong reputation and global presence.

    • Paypal is a well-established and trusted online payment platform used by millions of users worldwide.

    • It offers secure and convenient payment options for both individuals and businesses.

    • Paypal has a strong focus on innovation and technology, making it an exciting place to work for software engineers.

    • Working at Paypal provides opport...

  • Answered by AI
  • Q3. What does Paypal do?
  • Ans. 

    Paypal is a digital payment platform that allows individuals and businesses to make online transactions.

    • Paypal provides a secure way to send and receive money online.

    • It allows users to link their bank accounts, credit cards, or debit cards to their Paypal account.

    • Users can make payments to merchants or individuals using their Paypal balance or linked payment methods.

    • Paypal offers buyer and seller protection, dispute re...

  • Answered by AI
  • Q4. How do you see yourself in 5 years?
  • Ans. 

    In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.

    • Continuing to enhance my technical skills and knowledge through ongoing learning and certifications

    • Taking on more leadership responsibilities and mentoring junior team members

    • Contributing to the development of cutting-edge software solutions

    • Building strong relationships with colleagues and stakeholders to drive pr

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: One Programming and 15 multiple choice Questions.
Duration: 1 hour 30 minutes
Total Questions: 16

Round: Technical Interview
Experience: All details about projects you have written on resume. Some different implementation of some parts of your project.

Skills: Knowledge about Database Managements Systems, Problem Solving Skills
College Name: IIT Madras

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

11 Questions

  • Q1. Detecting loop in linked list
  • Ans. 

    Detecting loop in a linked list

    • Use two pointers, one moving one node at a time and the other moving two nodes at a time

    • If there is a loop, the two pointers will eventually meet

    • If any of the pointers reach the end of the list, there is no loop

  • Answered by AI
  • Q2. Write code for dfs
  • Ans. 

    DFS (Depth-First Search) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • DFS uses a stack to keep track of visited nodes and explore adjacent nodes.

    • It can be implemented recursively or iteratively.

    • DFS is useful for solving problems like finding connected components, detecting cycles, and solving mazes.

  • Answered by AI
  • Q3. How to find cycle in graph
  • Ans. 

    To find a cycle in a graph, use depth-first search (DFS) and keep track of visited nodes.

    • Implement DFS algorithm to traverse the graph

    • Maintain a visited array to keep track of visited nodes

    • If a visited node is encountered again during DFS, a cycle exists

  • Answered by AI
  • Q4. What is hashing and how will you implement?
  • Ans. 

    Hashing is a process of converting data into a fixed-size numerical value called a hash code.

    • Hashing is used to quickly retrieve data from large datasets.

    • It is commonly used in data structures like hash tables and hash maps.

    • Hash functions should be fast, deterministic, and produce unique hash codes for different inputs.

    • Examples of hash functions include MD5, SHA-1, and SHA-256.

  • Answered by AI
  • Q5. Questions related to to resume
  • Q6. No of pairs between 1 and N satisfy relation pow(a,3)+pow(b,3)=pow(c,3)+pow(d,3).a,b,c,d<=N
  • Ans. 

    The question asks for the number of pairs between 1 and N that satisfy a specific mathematical relation.

    • The relation is pow(a,3) + pow(b,3) = pow(c,3) + pow(d,3)

    • The values of a, b, c, and d should be less than or equal to N

    • Count the number of pairs that satisfy the relation

  • Answered by AI
  • Q7. -----.php?pid=514
  • Q8. Questions related to resume
  • Q9. Explain Merge sort
  • Ans. 

    Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.

    • Divide the array into two halves

    • Recursively sort each half

    • Merge the sorted halves back together

    • Repeat until the entire array is sorted

  • Answered by AI
  • Q10. Why do you want to join in paypal?
  • Ans. 

    I want to join PayPal because of its innovative technology, global impact, and strong company culture.

    • Innovative technology - PayPal is known for its cutting-edge technology and digital payment solutions.

    • Global impact - Working at PayPal would allow me to contribute to a company that has a worldwide reach and influence.

    • Strong company culture - I value a company that prioritizes diversity, inclusion, and employee well-b...

  • Answered by AI
  • Q11. Explain anything whatever you learned recently?
  • Ans. 

    I recently learned about the benefits of using Docker for containerization.

    • Docker allows for easy packaging and deployment of applications

    • It helps in creating consistent environments across different platforms

    • Docker containers are lightweight and efficient

    • Example: I used Docker to containerize a microservices architecture for a recent project

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: coding question related to palindrome portioning.MCQs related to cs fundamentals
Duration: 1 hour 30 minutes

Skills: General Coding And Problem Solving
College Name: IIT Madras

Skills evaluated in this interview

Software Developer Interview Questions & Answers

PayPal user image RAJIVTEJA NAGIPOGU

posted on 3 Dec 2016

I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.

Interview Questionnaire 

6 Questions

  • Q1. Given an array of numbers find the subset of numbers that give zero sum.
  • Ans. 

    Find subset of numbers in array that sum up to zero.

    • Use a nested loop to iterate through all possible subsets.

    • Calculate the sum of each subset and check if it equals zero.

    • Store the subset if the sum is zero.

    • Optimize the solution by using a hash set to store the cumulative sum of elements.

  • Answered by AI
  • Q2. Explain how bfs works?
  • Ans. 

    BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.

    • BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.

    • It uses a queue data structure to keep track of the vertices to be visited.

    • BFS guarantees that it visits all the vertices of a connected graph.

    • It can be used to find the shortest path between two

  • Answered by AI
  • Q3. Discussion on the projects I have done.
  • Q4. Question on Linked List.
  • Q5. Project Discussion
  • Q6. Strengths and weaknesses. Where do you see yourself in 5 years?
  • Ans. 

    In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.

    • Continuously improving my technical skills through learning and hands-on experience

    • Taking on leadership roles and mentoring junior developers

    • Contributing to the development of cutting-edge software solutions

    • Building strong relationships with clients and stakeholders

    • Staying updated with the latest indu...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

Round: Technical + HR Interview
Experience: I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: Aptitude questions were logical, not tough. For coding, one question, not basic but very logical.
Tips: for coding part try practicing on hackerrank.
Duration: 45+30 minutes
Total Questions: 20+1

Round: Technical Interview
Experience: Interviewer asked all about Linked list and Data structures and algorithm.
Tips: Atleast try learning some basic concepts of linked list, stacks, queues and binary tree.

General Tips: Interview was fair, without any partiality for girls/boys or B.Tech/Dual.
Skill Tips: Be confident and reply frankly. Never let them know that you are nervous.
Skills: Confidence
Duration: 2.5
College Name: IIT Madras
Funny Moments: "Lets go for a walk". HR interviewer will take you for a round to ask you HR questions.

Please prepare for two questions "Tell me something about you" and "Why PayPal, why not any other company".

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: Initially test was conducted. But they also considered resume for shortlisting to interview. Even if you do test badly, resume will come to your rescue if it is good enough.
Tips: Test consists of both aptitude and coding. Basic coding skills in C will be sufficient to solve the coding questions.

General Tips: Interviewing people are very friendly during the interview. Concentrate on concepts like linked lists, basic problems on strongs.
Skill Tips: Any basic C programming book.
Skills: Basic Coding, Basic C/C++
Duration: 2.5
College Name: IIT Madras
Motivation: Diverse fields in which company is working.

I applied via Referral

Interview Questionnaire 

13 Questions

  • Q1. Which is my dream company?
  • Q2. What is my biggest achievement till date?
  • Ans. 

    My biggest achievement till date is successfully leading a team to develop and launch a new software product ahead of schedule.

    • Led a team of developers to create a new software product

    • Completed the project ahead of schedule

    • Received positive feedback from clients and stakeholders

  • Answered by AI
  • Q3. How would I handle conflicts with my team members?
  • Ans. 

    I would address conflicts directly and respectfully, seeking to understand the root cause and find a mutually beneficial solution.

    • Listen actively to understand the other person's perspective

    • Communicate clearly and respectfully

    • Identify the root cause of the conflict

    • Brainstorm potential solutions together

    • Be willing to compromise and find a mutually beneficial solution

  • Answered by AI
  • Q4. I have saved money from a year and bought my dream bike. It is the last round of Paypal interview today. I am on my way on the bike and it breaks down in a no parking zone. Suggest a win­win situation so...
  • Q5. What is success according to me?
  • Ans. 

    Success is achieving personal goals, feeling fulfilled, and making a positive impact.

    • Success is subjective and can vary from person to person.

    • It involves setting and achieving goals, both short-term and long-term.

    • Feeling fulfilled and content with one's accomplishments is a key aspect of success.

    • Making a positive impact on others or the world can also be a measure of success.

    • Success is not just about material wealth or...

  • Answered by AI
  • Q6. I was asked to write a code snippet from my project
  • Q7. Program to implement Dijkstra’s algorithm
  • Ans. 

    Dijkstra's algorithm finds the shortest path between nodes in a graph.

    • Create a graph with nodes and edges

    • Assign a tentative distance to each node

    • Set the initial node as current and mark it visited

    • For each neighbor of the current node, calculate the tentative distance

    • If the tentative distance is less than the current distance, update the distance

    • Mark the current node as visited and select the unvisited node with the sma...

  • Answered by AI
  • Q8. Program to reverse a singly linked list
  • Ans. 

    A program to reverse a singly linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q9. Which algorithm would I use to sort a linked list and why? Subsequently, I was asked to explain the logic of merge sort
  • Q10. Suggest as many methods as possible for finding the nth largest element in an unsorted linked list
  • Ans. 

    Methods to find nth largest element in an unsorted linked list

    • Traverse the linked list and store elements in an array, sort the array and return the nth largest element

    • Use quickselect algorithm to find the nth largest element in O(n) time complexity

    • Implement a max heap and extract the nth largest element

    • Divide the linked list into smaller sublists and recursively find the nth largest element

    • Use merge sort to sort the l

  • Answered by AI
  • Q11. How would I explain the concept of prime number to an illiterate?
  • Ans. 

    A prime number is a number that is divisible only by 1 and itself.

    • A prime number has exactly two factors: 1 and itself.

    • Prime numbers cannot be divided evenly by any other number.

    • Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, etc.

  • Answered by AI
  • Q12. Give a few test cases for a bank transaction
  • Ans. 

    Test cases for a bank transaction

    • Transaction amount within account balance limit

    • Transaction amount exceeds account balance limit

    • Transaction to a valid account number

    • Transaction to an invalid account number

    • Transaction with correct transaction code

    • Transaction with incorrect transaction code

    • Transaction during bank working hours

    • Transaction outside bank working hours

  • Answered by AI
  • Q13. Design classes for educational institutions in a city
  • Ans. 

    Design classes for educational institutions in a city

    • Identify the main entities: schools, students, teachers, courses

    • Create a School class with attributes like name, address, and a list of students and teachers

    • Create a Student class with attributes like name, age, and a list of courses

    • Create a Teacher class with attributes like name, specialization, and a list of courses

    • Create a Course class with attributes like name, ...

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Paytm Interview FAQs

How many rounds are there in Paytm Software Development Engineer interview?
Paytm interview process usually has 2 rounds. The most common rounds in the Paytm interview process are Technical and HR.
How to prepare for Paytm Software Development Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Paytm. The most common topics and skills that interviewers at Paytm expect are Agile, Android, Automation, Debugging and Linux.
What are the top questions asked in Paytm Software Development Engineer interview?

Some of the top questions asked at the Paytm Software Development Engineer interview -

  1. LinkedList questions from easy to medium. One was like to insert the gcd of con...read more
  2. Star questions in behaviour ro...read more

Recently Viewed

INTERVIEWS

United Airlines

No Interviews

INTERVIEWS

Bounteous x Accolite

No Interviews

INTERVIEWS

Shorthills AI

No Interviews

INTERVIEWS

Dr Lal PathLabs

No Interviews

INTERVIEWS

Xoriant

No Interviews

INTERVIEWS

Dr Lal PathLabs

No Interviews

INTERVIEWS

Incedo

No Interviews

SALARIES

Dr Lal PathLabs

INTERVIEWS

CBRE

No Interviews

INTERVIEWS

Schlumberger

No Interviews

Tell us how to improve this page.

Paytm Software Development Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

FIS Interview Questions
3.9
 • 481 Interviews
PhonePe Interview Questions
4.0
 • 297 Interviews
PayPal Interview Questions
3.9
 • 207 Interviews
Fiserv Interview Questions
3.0
 • 172 Interviews
Visa Interview Questions
3.5
 • 138 Interviews
Angel One Interview Questions
3.9
 • 135 Interviews
MasterCard Interview Questions
3.9
 • 134 Interviews
Revolut Interview Questions
2.6
 • 95 Interviews
View all
Paytm Software Development Engineer Salary
based on 62 salaries
₹7.3 L/yr - ₹23.5 L/yr
At par with the average Software Development Engineer Salary in India
View more details

Paytm Software Development Engineer Reviews and Ratings

based on 5 reviews

3.8/5

Rating in categories

4.0

Skill development

3.5

Work-life balance

3.7

Salary

2.5

Job security

3.7

Company culture

1.9

Promotions

2.9

Work satisfaction

Explore 5 Reviews and Ratings
Team Lead
2.3k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
974 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
915 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Paytm with

BharatPe

3.5
Compare

Zerodha

4.1
Compare

Razorpay

3.6
Compare

Mobikwik

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent