Preparing Paytm coding questions helps candidates strengthen their programming, logical thinking, and problem-solving skills. These questions are commonly asked in Paytm online assessments and technical interview rounds.
- Covers the most frequently asked Paytm coding questions across Easy, Medium, and Hard difficulty levels.
- Helps candidates prepare for Paytm online coding assessments and technical interviews through structured practice.
Easy Level
- Two Sum
- Reverse Linked List
- Segregate 0s and 1s in an array
- Calculate the angle between hour hand and minute hand
- Count frequencies of all elements in array in O(1) extra space and O(n) time
- Find the minimum distance between two numbers
- Maximum sum such that no two elements are adjacent
- Program to Count numbers on fingers
- Rearrange positive and negative numbers in O(n) time and O(1) extra space
- Convert a Binary Tree into its Mirror Tree
- Convert array into Zig-Zag fashion
- Count all possible paths from top left to bottom right of a m x n matrix
- Count all sub-arrays having sum divisible by k
- Find duplicates in O(n) time and O(1) extra space | Set 1
- Find Excel column name from a given column number
- Find if there is a subarray with 0 sum
- Find minimum number of coins that make a given value
- Find the missing number in Arithmetic Progression
- Find the row with maximum number of 1s
- How to determine if a binary tree is height-balanced?
- Largest subarray with equal number of 0s and 1s
- Merge Sort for Linked Lists
- Move all zeroes to end of array
- Print a given matrix in spiral form
- Print Left View of a Binary Tree
- Recursively remove all adjacent duplicates
- Reverse words in a given string
- Search an element in a sorted and rotated array
- Search in a row wise and column wise sorted matrix
- Segregate Even and Odd numbers
- Serialize and Deserialize a Binary Tree
- Sort a linked list of 0s, 1s and 2s
- Sort an array of 0s, 1s and 2s
- Stack | Set 2 (Infix to Postfix)
- Stock Buy Sell to Maximize Profit
- Ugly Numbers
Medium Level
- Container With Most Water
- Min Stack
- Backtracking | Set 2 (Rat in a Maze)
- Bottom View of a Binary Tree
- Dynamic Programming | Set 7 (Coin Change)
- Find the number of islands | Set 1 (Using DFS)
- Flattening a Linked List
- How to print maximum number of A's using given four keys
- Largest Rectangular Area in a Histogram | Set 2
- Minimum Number of Platforms Required for a Railway/Bus Station
- Print Nodes in Top View of Binary Tree
- Reverse a Linked List in groups of given size
- Sort an array in wave form