## Check if a number is a Mystery Number

Given a number check whether it is a mystery number or not. A mystery number is that number which can be expressed as sum of… Read More »

- Merge Sort
- Coin Change | DP-7
- Search an element in a sorted and rotated array
- Stack | Set 2 (Infix to Postfix)
- Stock Buy Sell to Maximize Profit
- Ugly Numbers
- Maximum sum such that no two elements are adjacent
- Find the number of islands | Set 1 (Using DFS)
- Sort an array of 0s, 1s and 2s
- Print a given matrix in spiral form
- Minimum Number of Platforms Required for a Railway/Bus Station
- Rat in a Maze | Backtracking-2
- Largest Rectangular Area in a Histogram | Set 2
- Design a stack that supports getMin() in O(1) time and O(1) extra space
- Count all possible paths from top left to bottom right of a mXn matrix
- Reverse words in a given string
- Longest Increasing Subsequence Size (N log N)
- Merge Sort for Linked Lists
- Reverse a Linked List in groups of given size | Set 1
- Find minimum number of coins that make a given value
- Bottom View of a Binary Tree
- Print Left View of a Binary Tree
- Arrange given numbers to form the biggest number | Set 1
- Find duplicates in O(n) time and O(1) extra space | Set 1
- How to determine if a binary tree is height-balanced?
- Print Nodes in Top View of Binary Tree
- Largest subarray with equal number of 0s and 1s
- Design and Implement Special Stack Data Structure | Added Space Optimized Version
- Convert a Binary Tree into its Mirror Tree
- Flattening a Linked List

Given a number check whether it is a mystery number or not. A mystery number is that number which can be expressed as sum of… Read More »

Given an array of elements and change the array in such a way that all the elements on the array are distinct. if you are… Read More »

Given an integer array, if any integer is repeating then replace it with a number greater than that number which has not been inserted yet… Read More »

Given an array of integers, consider the elements as the height of the building, find the number of buildings that can be seen from the… Read More »

Round 1:The first round was a coding round with 3 questions held on cocubes platform.There were 3-4 set of questions my set had the following… Read More »

Paytm visited our campus for the post of Software Engineer. The interview process consisted of following rounds. Online Round: The online round consisted of 3 programming… Read More »

Round 1: Coding Round 2 coding questions both from strings : To find no of distinct years from the given paragraph.(paragraph consists of 2 or… Read More »

Online Coding round- Platform-Cocubes.com Time-70 minutes:3 Questions 1st (2 marks): Merge two sorted linked lists such that merged list is in reverse order. https://www.geeksforgeeks.org/merge-two-sorted-linked-lists-such-that-merged-list-is-in-reverse-order/ 2nd(3… Read More »

Round 1: First Round was coding round. Two questions were there. (1 hr) In given integer array, if any integer is repeating then replace it with… Read More »

Hello guys, I am having a 1.3 year of experience and I applied in Paytm money for software engineer profile. Round 1: online test. Round 2:… Read More »

Online Coding Round : Platform used was cocubes.com Time : 75 min Question : 3 Coding Question 1st Question : Simple linked list implementation. Given… Read More »

Paytm Noida visited our campus on 8 September 2018 for hiring software engineers. There were total 5 rounds in total but some of participant has… Read More »

Round 1:Online Coding Round First round was an online programming round with 3 questions. Merge two sorted(increasing order) Linked List such that the final Linked List… Read More »

I was interviewed for Java Backend Developer profile at PayTM, Noida. Round 1: Online Test There are n number of stones. Each stone has a… Read More »