Pagarbook Software Developer Interview Questions and Answers

It was a coding test with 3 medium-hard questions

Q1. Coding interview
Add your answer
Q2. Some question of graph
Add your answer
Q3. Some question of string
Add your answer
Q4. Some graph qquestion
Add your answer
Q5. Somerandom question
Add your answer

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...read more
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
Add your answer

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...read more
Answered by AI
Add your answer
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...read more
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
Add your answer
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 ...read more
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
Add your answer

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.

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...read more
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...read more
Answered by AI
Add your answer

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 ...read more
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...read more
Answered by AI
Add your answer

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...read more
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...read more
Answered by AI
Add your answer

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

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...read more
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
Add your answer
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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer

Blood relation, coding and decoding, number system , percentage

Q1. LLD HLD HM rounds
Add your answer