M
upendra200223
STREAK
01/1472
days
Longest streak/Global longest streak
Language Used
C++, Java, C
Coding Score
2073
Problem Solved
626
Contest Rating
__
5 points
Contributor
5 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
52 submissions in current year
SCHOOL (1)
BASIC (43)
EASY (178)
MEDIUM (341)
HARD (63)
- Sorting Elements of an Array by Frequency
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Rearrange a linked list
- Add 1 to a Linked List Number
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Quick Sort on Linked List
- Insert in Sorted Circular Linked List
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Sum Tree
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Flattening a Linked List
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Reverse alternate levels of a perfect binary tree
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Range Minimum Query
- Two Stacks in an Array
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Find kth element of spiral matrix
- Get Min from Stack
- Serialize and deserialize a binary tree
- Gas Station
- Wildcard Pattern Matching
- Linked List to Binary Tree
- Extreme nodes in alternate order
- Kth smallest element in a Matrix
- Validate an IP Address
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Implement Atoi
- Count of distinct substrings
- Palindrome Linked List
- Strongly Connected
- Rat in a Maze Problem - I
- Bipartite Graph
- Number of root to leaf paths
- Closest in BST
- BST with Dead End
- Merge two BST 's
- Count distinct elements in every window
- Trie | (Delete)
- Root to leaf paths sum
- Bridge edge in a graph
- Find triplets with zero sum
- Sort a stack
- Duplicate Subtree
- Top View of Binary Tree
- k-th Smallest in BST
- Level order traversal
- Peak element
- Polynomial Addition
- Delete nodes greater than k
- Merge Sort for Linked List
- Union of Two Linked Lists
- Ancestors in Binary Tree
- Binary Tree to CDLL
- Pair Sum in BST
- Root to Leaf Paths
- Complete Binary Tree
- XOR Linked List
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct Tree from Inorder & Preorder
- Construct tree from Inorder and LevelOrder
- Count the nodes at distance K from leaf
- Vertical sum
- Mirror of a given node
- Insert in Sorted way in a Sorted DLL
- Isomorphic Trees
- Maximum path sum from any node
- Predecessor and Successor
- Leaves to DLL
- Children Sum in a Binary Tree
- Diagonal sum in binary tree
- Normal BST to Balanced BST
- Construct Tree from Preorder Traversal
- Sum of nodes on the longest path
- Check if two Nodes are Cousins
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Vertical Width of a Binary Tree
- Swap Kth nodes from ends
- Mother Vertex
- Ceil in BST
- Power Of Numbers
- Wave Array
- Possible Words From Phone Digits
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Binary Array Sorting
- Count Inversions
- Unique BST's
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Triplet Sum in Array
- Possible paths between 2 vertices
- Level of Nodes
- Spirally traversing a matrix
- Search in a sorted Matrix
- Rotate by 90 degree
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarray with 0 sum
- Sort Elements by Decreasing Frequency
- Longest Consecutive Subsequence
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Combination Sum
- M-Coloring Problem
- Detect Cycle using DSU
- Stickler Thief
- Ways to Reach the n'th Stair
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Sort according to an Array
- Allocate Minimum Pages
- Preorder to BST
- X Total Shapes
- Find whether path exist
- Kth Smallest
- Implement Trie
- Shortest Common Supersequence
- Nth Catalan Number
- Rotten Oranges
- Steps by Knight
- Most frequent word in an array of strings
- Rotate by 90 degree
- Closest Three Sum
- Word Break
- Generate Parentheses
- Word Search
- Word Boggle
- Prerequisite Tasks
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Number of subarrays with maximum values in given range
- Maximize Number of 1's
- Single Among Doubles in a Sorted
- Consecutive 1's not allowed
- Count Occurences of Anagrams
- Pair Sum Closest to 0
- Search in Rotated Sorted Array
- Subarray Sum Divisible By K
- Longest subarray with sum divisible by K
- Row with max 1s
- Substrings with K Distinct
- Form a palindrome
- Rotate a Matrix
- Longest Subarray with Sum K
- Max Sum without Adjacents
- Reverse each word in a given string
- Length of the longest substring
- k largest elements
- Longest Common Substring
- Longest Substring with K Uniques
- Valid Expression
- K-th element of two Arrays
- Triplets with Smaller Sum
- Rod Cutting
- K closest elements
- Longest Palindromic Subsequence
- First negative in every window of size k
- First and Last Occurrences
- Permutations of a String
- CamelCase Pattern Matching
- Queries for counts of multiples in an array
- Modular Exponentiation
- Largest prime factor
- Minimum number of deletions and insertions
- Coin Change (Count Ways)
- Santa Banta
- Sieve of Eratosthenes
- Perfect Sum Problem
- Power Set
- Knapsack with Duplicate Items
- Maximum path sum in matrix
- Partition Equal Subset Sum
- Longest Bitonic subsequence
- Min Coin
- Subset Sums
- Number of paths
- Knight Walk
- Find nth root of m
- Sum of Query II
- Find Prime numbers in a range
- Smith Number
- Next Permutation
- Element left after performing alternate OR & XOR operation
- Smaller on Left
- Rotate matrix elements clockwise
- Array Sum Excluding Subarrays
- Matrix Exponentiation
- Is Sudoku Valid
- Total Decoding Messages
- Segregate even and odd nodes in a Linked List
- Largest square formed in a matrix
- Geek and Strings
- Product of Primes
- Replace O's with X's
- Two odd Occuring
- Check Mirror in N-ary tree
- Floyd Warshall
- Negative weight cycle
- Flood fill Algorithm
- Shortest Source to Destination Path
- Reverse Spiral Form of Matrix
- Spiral Matrix
- Coins of Geekland
- Jump Game
- Iterative Inorder
- Preorder traversal (Iterative)
- Iterative Postorder
- Subset Sum Problem
- Longest Palindromic Substring
- All Palindromic Partitions
- 3 Sum Closest
- Bellman-Ford
- Subarrays with sum K
- Minimum XOR value pair
- Open the gates
- Capacity To Ship Packages Within D Days
- Remove K Digits
- Substrings of length k with k-1 distinct elements
- Maximum XOR of two numbers in an array
- Count pairs in array divisible by K
- Number of Provinces
- Prefix match with other strings
- Maximum sum leaf to root path
- BST to greater sum tree
- Cousins of a given node
- Sort for Singly Linked List
- Flatten binary tree to linked list
- IPL 2021 - Match Day 2
- Neeman's Shoes
- Course Schedule
- Clone an Undirected Graph
- Target Sum
- Overlapping Intervals
- Reverse a Stack
- Maximum Meetings in One Room
- Maximum Winning score
- Compute Before Matrix
- Number of Distinct Islands
- Shortest Distance in a Binary Maze
- Minimum Multiplications to reach End
- Number Of Enclaves
- Eventual Safe States
- City With the Smallest Number of Neighbors at a Threshold Distance
- Alex Travelling
- Number Of Islands
- Merging Details
- Number of Ways to Arrive at Destination
- Path With Minimum Effort
- Cheapest Flights Within K Stops
- Connecting the graph
- Shortest Path in Undirected Graph
- Maximum Stone Removal
- Shortest path in Directed Acyclic Graph
- Majority Element - More Than n/3
- Koko Eating Bananas
- Search in Rotated Array 2
- Longest subarray with Atmost two distinct integers
- Longest Repeating Character Replacement
- Maximum Consecutive Ones
- Count Subarray with k odds
- Count Substring
- Binary subarray with sum
- Frog Jump
- Minimal Cost
- Geek's Training
- Grid Path 2
- Maximum point you can obtain from cards
- Subarrays with K Distinct Integers
- Stock Buy and Sell – with Cooldown
- Combination Sum III
- Aggressive Cows
- Smallest Divisor
- Subset II
- Combination Sum II
- Next Greater Element 2
- Number of greater elements to the right
- Shortest Path in Weighted undirected graph
- Prime Factorization using Sieve
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Minimum days to make M bouquets
- Generate all binary strings
- Delete all occurrences of a given key in a doubly linked list
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Buy Stock with Transaction Fee
- Number of Longest Increasing Subsequence
- Non-overlapping Intervals
- Insert Interval
- Shortest Job first
- Partition Array for Maximum Sum
- Count Square Submatrices with All Ones
- Count Number of Nodes in a Binary Tree
- Introduction to DP
- Longest String Chain
- Print Longest Increasing Subsequence
- Bit's basic operations
- Partitions with Given Difference
- Floor in BST
- Triangle Path Sum
- Largest Divisible Subset
- Maximum Value
- Next Greater Element in Circular Array
- Find the longest string
- Remove the balls
- Reverse a linked list
- Frequency in a Linked List
- Delete N nodes after M nodes of a linked list
- Pairwise swap elements of a linked list
- Node at a given index in linked list
- Compare two linked lists
- Delete nodes having greater value on right
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Middle of a Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Delete Middle of Linked List
- Transform to Sum Tree
- Intersection Sorted Linked Lists
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Square Root
- Nodes without a Sibling
- Insertion at doubly linked list
- Postorder from Inorder and Preorder
- Lowest Common Ancestor in a BST
- Binary Search
- Remove Duplicates Sorted Array
- Level Order Line by Line
- BST Keys in a Range
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- Remove every k'th node
- Leaves at Same Level or Not
- Multiply two linked lists
- Delete in a Singly Linked List
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Special Stack
- Inorder Successor in BST
- Intersection of Two Linked Lists
- Disjoint set (Union-Find)
- Insert in a Sorted List
- Level of a Node in Binary Tree
- More than n/k Occurrences
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse Using Stack
- XOR of a given range
- Full Binary Tree
- Symmetric Tree
- Delete Alternate Nodes
- Count Pairs whose sum is equal to X
- Depth of node
- Maximum Node Level
- Find length of Loop
- Median of BST
- Reverse first K of a Queue
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Closest Neighbour in BST
- Exchange the Leaf Nodes
- Sum of Leaf Nodes at Min Level
- Rotate doubly Linked List
- Product of an Array
- Bitwise Operators
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Longest Consecutive 1's
- Power of 2
- Array Leaders
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Print adjacency list
- Transpose of Matrix
- Matrix Boundary Traversal
- Reverse Words
- Parenthesis Checker
- N meetings in one room
- Union-Find
- Count number of hops
- First Repeating Element
- Pair with largest sum which is less than K in the array
- Missing in Array
- Missing And Repeating
- Find Kth Rotation
- Pairs with Difference less than K
- Common in 3 Sorted Arrays
- Sorted and Rotated Minimum
- Search in a Row-Column sorted matrix
- Missing number
- Count the triplets
- Find Pair Given Difference
- Bitonic Point
- Smallest subarray with sum greater than x
- Greater on right side
- Distinct Substrings
- Second Largest
- Number of occurrence
- Check if array is sorted
- Sum Pair closest to target
- Meta Strings
- Element with left side smaller and right side greater
- Count the Zeros
- Four Elements
- Palindrome String
- Maximum average subarray
- Bitwise OR in a given Range
- Maximum prefix sum for a given range
- Minimum Operations
- Number of 1 Bits
- AND operation
- Max Sum Subarray of size K
- Nth Fibonacci Number
- Ceil The Floor
- Prime Number
- Minimum number of Coins
- Kth Prime Factor
- Factorials Less than or Equal to n
- Least Prime Factor
- Prime Factors
- Make Zeroes
- Count Primes In Range
- Find the highest occurring digit in prime numbers in a range
- Prime number of set bits
- Inorder Traversal and BST
- Closest Triplet
- Primes sum
- Count all possible paths from top left to bottom right
- Modified Numbers and Queries
- Search insert position of K in a sorted array
- Queue using stack
- Largest value in each level
- Move Last Element to Front of a Linked List
- Find pairs with given sum in doubly linked list
- Print N to 1 without loop
- Print GFG n times
- Largest odd number in string
- All divisors of a Number
- Find XOR of numbers from L to R.
- Stock Buy and Sell – Max one Transaction Allowed
- Outermost Parentheses
- Search in Linked List
- Remove duplicates from a sorted doubly linked list
- Bit Manipulation
- Introduction to Trees
- Binary Search Trees
- Graph and Vertices
- Binary Tree Representation
- Virus Infection
- Separate Stone
- Linked List Group Reverse
- Reorder List
- Binary Tree to DLL
- Clone List with Next and Random
- Max rectangle
- Distinct occurrences
- LRU Cache
- Alien Dictionary
- Merge Sort on Doubly Linked List
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Max Path Sum 2 Special Nodes
- Trapping Rain Water
- Smallest window containing all characters
- Histogram Max Rectangular Area
- Find median in a stream
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Word Ladder I
- Median of 2 Sorted Arrays of Different Sizes
- Burning Tree
- The Painter's Partition Problem-II
- Print all LCS sequences
- Edit Distance
- Minimum Points To Reach Destination
- Minimum sum partition
- Palindromic Partitioning
- Stock Buy and Sell – Max K Transactions Allowed
- Matrix Chain Multiplication
- Median in a row-wise sorted Matrix
- Boolean Parenthesization
- Longest valid Parentheses
- N-Queen Problem
- Phone directory
- Articulation Point - II
- Maximum sum Rectangle
- 132 Geeky Buildings
- Find all Critical Connections in the Graph
- Word Break (Trie)
- Palindrome Pairs
- Word Ladder II
- Shortest Unique prefix for every word
- IPL 2021 - Final
- Split Array Largest Sum
- Find number of closed islands
- Scrambled String
- Shortest Path by Removing K walls
- Count the number of subarrays
- Articulation Point - I
- Stock Buy and Sell – Max 2 Transactions Allowed
- Number of pairs
- Maximum Connected group
- Minimum travel time
- Expression Add Operators
- MaxSkill
- Minimize Max Distance to Gas Station
- LFU cache
- Count Reverse Pairs
- Account Merge
- Maximum XOR With an Element From Array
- Chocolates Pickup
- Largest Sum Cycle
- Print Linked List
- Find Length of Linked List
- Size of Binary Tree
- Count Leaves in Binary Tree
- Postorder Traversal
- Queue using Linked List
- Queue Using Array
- Preorder Traversal
- Search a node in BST
- Linked List Insertion At End
- Minimum element in BST
- Circular Linked List Traversal
- Is Linked List Length Even?
- Identical Linked Lists
- Triplet Family
- Sum of Binary Tree
- Insert in Middle of Linked List
- Count Non-Leaf Nodes in Tree
- Count Odd and Even
- Bit Difference
- Print 1 To N Without Loop
- Array Search
- Sorted Array Search
- Reverse a String
- First n Fibonacci
- C++ Hello World
- Sort the Half Sorted
- Check Arithmetic Progression
- Immediate Smaller Element
- Quick Left Rotation
- Largest Element in Array
- One odd Occuring
- Min and Max in Array
- Odd or Even
- Find position of set bit
- Set the rightmost unset bit
- House Robber
- Reverse digits
- Binary number to decimal number
- Sum of first n terms
- Swap two numbers
- Height of Heap
- Max Min
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy