Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Pagarbook Software Developer Interview Questions and Answers

Updated 21 Sep 2024

Pagarbook Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Let var const difference
  • Ans. 

    var, let, and const are all used to declare variables in JavaScript, but they have different scopes and mutability.

    • var is function-scoped and can be redeclared and reassigned

    • let is block-scoped and can be reassigned but not redeclared

    • const is block-scoped and cannot be reassigned or redeclared

  • Answered by AI
  • Q2. Polyfills of bind method
  • Ans. 

    Polyfills of bind method provide a way to use the bind method in older browsers that do not support it natively.

    • Polyfill code typically checks if the bind method is available and if not, it creates a new function that mimics the behavior of bind.

    • One common polyfill for the bind method is the following: Function.prototype.bind = Function.prototype.bind || function() { // polyfill code here };

    • Polyfills are often used to ...

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. Make a search bar in React
  • Ans. 

    Create a search bar component in React for filtering data

    • Create a functional component for the search bar

    • Use state to store the search query

    • Implement a onChange event handler to update the search query

    • Filter the data based on the search query

  • Answered by AI
  • Q2. React js core concepts
Round 3 - HR 

(2 Questions)

  • Q1. How you structure your work
  • Ans. 

    I structure my work by breaking down tasks, setting priorities, creating timelines, and regularly reviewing progress.

    • Break down tasks into smaller, manageable chunks

    • Set priorities based on deadlines and importance

    • Create timelines to track progress and ensure timely completion

    • Regularly review progress and adjust plans as needed

  • Answered by AI
  • Q2. How you make a project from scratch
  • Ans. 

    To make a project from scratch, start by defining requirements, creating a plan, designing the architecture, implementing the code, testing, and deploying.

    • Define project requirements and goals

    • Create a project plan with timelines and milestones

    • Design the architecture of the project, including database schema and system components

    • Implement the code following best practices and coding standards

    • Test the project thoroughly ...

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

21 Questions

  • Q1. Discussion of previous written test questions
  • Q2. Find the odd repeating element from a set of repeating elements
  • Ans. 

    Find the odd repeating element from an array of strings

    • Use a hash table to count the frequency of each element

    • Iterate through the hash table to find the element with an odd count

  • Answered by AI
  • Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
  • Ans. 

    Finding an element in a sorted 2D matrix

    • Start from the top right corner or bottom left corner

    • Compare the target element with the current element

    • Move left or down if the target is smaller, else move right or up

    • Repeat until the target is found or all elements are checked

  • Answered by AI
  • Q4. SQL Query to find Nth highest salary from table
  • Ans. 

    SQL query to find Nth highest salary from table

    • Use ORDER BY and LIMIT clauses

    • Use subquery to get the Nth highest salary

    • Handle cases where there are less than N distinct salaries

  • Answered by AI
  • Q5. Another basic SQL query
  • Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
  • Ans. 

    Function to swap '3' and '4' without using if-else

    • Use XOR operator to swap the values

    • Convert the input to ASCII code and perform the swap

    • Use a lookup table to map the values

  • Answered by AI
  • Q7. Question on Suffix trees
  • Q8. Question on Tries
  • Q9. Question on Ternary search trees
  • Q10. Question on hash maps
  • Q11. Question on complexity of an algorithm
  • Q12. 3-4 SQL queries
  • Q13. Question on SQL joins
  • Q14. JAVA questions on static block,static function and static variables
  • Q15. JAVA questions on memory initialization and references
  • Q16. Puzzle on measuring exactly half a glass of water
  • Q17. Introduce yourself
  • Ans. 

    I am a software developer with experience in Java and Python.

    • Proficient in Java and Python programming languages

    • Experience in developing web applications using Spring framework

    • Familiarity with database management systems like MySQL and MongoDB

  • Answered by AI
  • Q18. Why PAYTM?
  • Ans. 

    PAYTM is a leading digital payment platform in India with a wide range of services.

    • PAYTM has a user-friendly interface and offers a seamless payment experience.

    • It provides a variety of services like mobile recharges, bill payments, and online shopping.

    • PAYTM has a strong focus on security and fraud prevention measures.

    • It has a large user base and is widely accepted by merchants across India.

    • PAYTM is constantly innovatin...

  • Answered by AI
  • Q19. Will you go for further studies?
  • Ans. 

    Yes, I am open to pursuing further studies in the future.

    • I believe in continuous learning and staying updated with the latest technologies.

    • Further studies can help me specialize in a particular field and enhance my skills.

    • I may consider pursuing a master's degree in computer science or a related field.

    • However, my immediate focus is on gaining practical experience and contributing to the organization.

  • Answered by AI
  • Q20. Why do you think has PAYTM grown so fast?
  • Ans. 

    PAYTM grew fast due to its innovative approach and early adoption of digital payments.

    • Early adoption of digital payments in India

    • Innovative approach with features like mobile recharges, bill payments, and cashback offers

    • Expansion into e-commerce and financial services

    • Strategic partnerships with major companies like Uber and Alibaba

  • Answered by AI
  • Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?

Interview Preparation Tips

Round: Test
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.

Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)

Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know

Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)

Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)

General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.

Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.

College Name: BITS Pilani

Interview Preparation Tips

Skills: Algorithm, Java, Data structure
College Name: na
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected
Round 1 - Coding Test 

It was a coding test with 3 medium-hard questions

Round 2 - One-on-one 

(5 Questions)

  • Q1. Coding interview
  • Q2. Some question of graph
  • Q3. Some question of string
  • Q4. Some graph qquestion
  • Q5. Somerandom question

Interview Preparation Tips

Interview preparation tips for other job seekers - be prepared

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

  • Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
  • Ans. 

    Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.

    • Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.

    • Implement methods for getting and setting key-value pairs in the cache.

    • When a new item is added to the cache, check if it exceeds the maximum capacity. I...

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
  • Q3. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • If there are even elements, return the one that is farther from the head node

    • Handle edge cases like linked list of size 1 or empty list

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaGood ProjectsRazorpay interview preparation:Topics to prepare for the interview - Projects, Development, NoSQL, Data Structure, OOPS, DBMS, Algorithm.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions 
Tip 3 : Know the complexities of the code that you’ve written.

Application resume tips for other job seekers

Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Medium

Timing was 3PM to 5 PM
There were 4 coding questions based on Dynamic Programming , Graphs, Mathematical analysis , Trie data structure.

  • Q1. 

    Weighted Job Scheduling Problem Statement

    You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...

  • Ans. 

    The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with start time, end time, and profit given.

    • Sort the jobs based on their end times in ascending order.

    • Initialize an array 'dp' to store the maximum profit that can be earned by scheduling jobs up to that index.

    • For each job, find the maximum profit by either including or excluding the current job based on non-overlapping co...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

The interviewer was very soft spoken and helpful. There were in total 3 questions of easy-medium difficulty based on DP, Graphs and Sorting . It was around 11 AM timing.

  • Q1. 

    Knight Probability in Chessboard

    Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...

  • Ans. 

    Calculate the probability that a knight remains on an N x N chessboard after making K moves.

    • Use dynamic programming to calculate the probability of the knight staying on the board after each move.

    • Consider all possible moves the knight can make from its current position.

    • Keep track of the probabilities at each position on the board after each move.

    • Normalize the probabilities at the end to get the final result.

    • Example: Fo...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The round had 1 DS and Algo problem and 1 system Design question based on building any management portal.

  • Q1. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

    • Create a mapping of each cell to its corresponding destination cell if it contains a snake or ladder.

    • Keep track of visited cells to avoid revisiting them during the traversal.

    • Consider the constraints and handle cases where t...

  • Answered by AI
Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It was more of Hiring Manager round where he asked about my skills , my projects and how could i be valuable to firm. It was quit easy going round

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Indian Institute of Information Technology Allahabad. I applied for the job as SDE - 1 in PuneEligibility criteriaAbove 7 CGPAPhone Pe interview preparation:Topics to prepare for the interview - Data Structures, System Design, Algorithms, Operating Systems, Database Management Systems, OOPs, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Always focus on the basics of the Data Structures
Tip 2 : Practice System Design very well
Tip 3 : Take Practice Contests on weekly basis for time constraints

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects with thorough knowledge 
Tip 2 : Keep the Resume one page only with no false information

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jun 2022.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Best Time To Buy and Sell Stock Problem Statement

    You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...

  • Ans. 

    Determine the maximum profit achievable with at most K transactions by buying and selling stocks.

    • Iterate through the array and keep track of the minimum price to buy and maximum profit to sell.

    • Use dynamic programming to calculate the maximum profit with at most K transactions.

    • Consider edge cases like when K is 0 or when the array is empty.

    • Example: For input N = 6, PRICES = [3, 2, 6, 5, 0, 3], K = 2, the output should b

  • Answered by AI
  • Q2. 

    Maximum Sum Rectangle Problem Statement

    Given a matrix ARR with dimensions N x M, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.

    Input:

    The first line...
  • Ans. 

    Find the rectangle with the maximum sum of elements in a given matrix.

    • Iterate through all possible rectangles in the matrix and calculate the sum of each rectangle.

    • Keep track of the maximum sum encountered so far.

    • Optimize the solution by using Kadane's algorithm for 1D array to find maximum sum subarray in each row.

  • Answered by AI
  • Q3. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

    • Keep track of visited cells and the number of dice throws required to reach each cell.

    • Consider the presence of snakes and ladders while calculating the next possible moves.

    • Return the minimum number of dice throws to reach th

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 70 Minutes
Round difficulty - Medium

  • Q1. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q2. 

    Longest Increasing Path in a 2D Matrix Problem Statement

    Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...

  • Ans. 

    Find the length of the longest increasing path in a 2D matrix by moving in four directions from each cell.

    • Use dynamic programming to keep track of the length of the longest increasing path starting from each cell.

    • Explore all four directions from each cell and recursively find the longest increasing path.

    • Optimize the solution by storing the length of the longest increasing path starting from each cell to avoid redundant

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

  • Q1. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
  • Ans. 

    Given a rotated sorted array, find the index of a given integer 'K'.

    • Use binary search to find the pivot point where the array is rotated.

    • Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.

    • Handle cases where 'K' is not present in the array by returning -1.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaPhone Pe interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, Web Development, Operating Systems, Database Management System, Automata theory.Time required to prepare for the interview - 7 monthsInterview preparation tips for other job seekers

Tip 1 : Practice as many questions as possible from any of the good coding platform.
Tip 2 : Core CS fundamentals should be strong and can't be neglected before interview.
Tip 3 : Some hands-on dev projects are really good to have as companies nowadays(mostly startups) look some good hands-on experience even in freshers.

Application resume tips for other job seekers

Tip 1 : Should be single page, to the point and precise resume.
Tip 2 : Only put truth on the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Blood relation, coding and decoding, number system , percentage

Interview Preparation Tips

Interview preparation tips for other job seekers - coding and decoding percentage ages averages
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. LLD HLD HM rounds
Contribute & help others!
anonymous
You can choose to be anonymous

Pagarbook Interview FAQs

How many rounds are there in Pagarbook Software Developer interview?
Pagarbook interview process usually has 3 rounds. The most common rounds in the Pagarbook interview process are Technical and HR.
How to prepare for Pagarbook Software Developer 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 Pagarbook. The most common topics and skills that interviewers at Pagarbook expect are Analytical Ability, Communication Skills, Learning and Problem Analysis.
What are the top questions asked in Pagarbook Software Developer interview?

Some of the top questions asked at the Pagarbook Software Developer interview -

  1. Make a search bar in Re...read more
  2. let var const differe...read more
  3. Polyfills of bind met...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Knoldus Inc

No Interviews

INTERVIEWS

Gi Group

No Interviews

SALARIES

ZenTrades

SALARIES

Sun Pharmaceutical Industries

SALARIES

Wollmilchsau Technologies

DESIGNATION

SALARIES

Greenway Health

SALARIES

Sun Pharmaceutical Industries

Tell us how to improve this page.

Pagarbook Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Pagarbook Software Developer Salary
based on 5 salaries
₹8 L/yr - ₹30 L/yr
128% more than the average Software Developer Salary in India
View more details

Pagarbook Software Developer Reviews and Ratings

based on 2 reviews

1.0/5

Rating in categories

1.0

Skill development

1.0

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 2 Reviews and Ratings
Team Lead
62 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Business Development Manager
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

City Head
22 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Manager
21 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Pagarbook with

KhataBook

3.4
Compare

OkCredit

4.4
Compare

Vyapar

3.5
Compare

Simpl

2.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview