Paytm Coding Interview Questions

Remove All Adjacent Duplicates In String

You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them.

Longest Nice Subarray

You are given an array nums consisting of positive integers.

Find Indices With Index and Value Difference II

You are given a 0-indexed integer array nums having length n, an integer indexDifference, and an integer valueDifference.

Find Indices With Index and Value Difference I

You are given a 0-indexed integer array nums having length n, an integer indexDifference, and an integer valueDifference.

Minimize Maximum of Array

You are given a 0-indexed array nums comprising of n non-negative integers.

Number of Unequal Triplets in Array

You are given a 0-indexed array of positive integers nums. Find the number of triplets (i, j, k) that meet the following conditions:

Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

Linked List Cycle II

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

Container With Most Water

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Valid Parentheses

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

Longest Substring Without Repeating Characters

Given a string s, find the length of the longest substring without duplicate characters.

Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

Two Sum

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

Next Permutation

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

3Sum

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Reverse Words in a String

Given an input string s, reverse the order of the words.

Execute Asynchronous Functions in Parallel

Given an array of asynchronous functions functions, return a new promise promise. Each function in the array accepts no arguments and returns a promise. All the...

Largest Number

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

Product of Array Except Self

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

Reverse Linked List

Given the head of a singly linked list, reverse the list, and return the reversed list.

Second Highest Salary

Table: Employee

Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Search in Rotated Sorted Array

There is an integer array nums sorted in ascending order (with distinct values).

Word Search

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

String Compression

Given an array of characters chars, compress it using the following algorithm:

Best Time to Buy and Sell Stock II

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

Longest Consecutive Sequence

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

Sum of Subarray Minimums

Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may be large, return the answer...

Find Minimum in Rotated Sorted Array

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: