namankumar2592
STREAK
00/1468
days
Longest streak/Global longest streak
Language Used
C++, Python, Java, C
Coding Score
795
Problem Solved
240
Contest Rating
__
195 points
Contributor
195 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
0 submissions in current year
SCHOOL (1)
BASIC (13)
EASY (70)
MEDIUM (131)
HARD (25)
- Rearrange characters
- Nearly Sorted Algorithm
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Add 1 to a Linked List Number
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Flattening a Linked List
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Delete a node from BST
- LCA in Binary Tree
- Two Stacks in an Array
- The Celebrity Problem
- Vertical Tree Traversal
- Merge K sorted linked lists
- Serialize and deserialize a binary tree
- Gas Station
- Kth smallest element in a Matrix
- Remove loop in Linked List
- Largest BST
- Multiply two strings
- Minimum Swaps to Sort
- Palindrome Linked List
- Rat in a Maze Problem - I
- Closest in BST
- BST with Dead End
- Merge two BST 's
- Merge k Sorted Arrays
- Sort a stack
- Duplicate Subtree
- Top View of Binary Tree
- k-th Smallest in BST
- Level order traversal
- Merge Sort for Linked List
- Pair Sum in BST
- Complete Binary Tree
- Populate Inorder Successor for all nodes
- Construct Tree from Inorder & Preorder
- Isomorphic Trees
- Maximum path sum from any node
- Predecessor and Successor
- Normal BST to Balanced BST
- Duplicate Subtrees
- Sum of nodes on the longest path
- Kth Ancestor in a Tree
- ZigZag Tree Traversal
- Ceil in BST
- Wave Array
- Rearrange an array with O(1) extra space
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Triplet Sum in Array
- Spirally traversing a matrix
- Rotate by 90 degree
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Postfix Evaluation
- Next Greater Element
- Nearly sorted
- Largest number in K swaps
- Combination Sum
- M-Coloring Problem
- Minimum Jumps
- Egg Dropping Puzzle
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Allocate Minimum Pages
- Preorder to BST
- Zero Sum Subarrays
- Kth Smallest
- Shortest Common Supersequence
- Print Anagrams Together
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Search in Rotated Sorted Array
- Smallest number with at least n trailing zeroes in factorial
- Maximum Product Subarray
- Row with max 1s
- Form a palindrome
- Nuts and Bolts Problem
- Transform String
- Count the Reversals
- Factorials of large numbers
- k largest elements
- Longest Common Substring
- Smallest distinct window
- Longest Palindrome in a String
- K-th element of two Arrays
- Triplets with Smaller Sum
- Rod Cutting
- Minimum swaps and K together
- Longest Palindromic Subsequence
- First negative in every window of size k
- Minimize the Heights II
- First and Last Occurrences
- Valid Substring
- Minimum number of deletions
- Minimum Swaps for Bracket Balancing
- Permutations of a String
- Minimum number of deletions and insertions
- Coin Change (Count Ways)
- Knapsack with Duplicate Items
- Partition Equal Subset Sum
- Min Coin
- Path of greater than equal to k length
- Next Permutation
- Longest Repeating Subsequence
- Preorder Traversal and BST
- Stream First Non-repeating
- Segregate even and odd nodes in a Linked List
- Check Mirror in N-ary tree
- Iterative Inorder
- Preorder traversal (Iterative)
- Iterative Postorder
- Subset Sum Problem
- All Palindromic Partitions
- Rearrange characters
- Flatten binary tree to linked list
- Target Sum
- Overlapping Intervals
- Reverse a Stack
- Stack Permutations
- Replace every element with the least greater element on its right
- Reverse a linked list
- Delete nodes having greater value on right
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Inorder Traversal
- Reverse a Doubly Linked List
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Middle of a Linked List
- Left View of Binary Tree
- Transform to Sum Tree
- Intersection Sorted Linked Lists
- Find Transition Point
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Reverse Level Order Traversal
- Insert a node in a BST
- Identical Trees
- Lowest Common Ancestor in a BST
- Equilibrium index of an array
- Leaves at Same Level or Not
- Multiply two linked lists
- Kth largest element in BST
- Special Stack
- Three way partitioning
- Inorder Successor in BST
- Index of an Extra Element
- Reverse Using Stack
- Symmetric Tree
- Median of BST
- Brothers From Different Roots
- Delete Mid of a Stack
- Rotate doubly Linked List
- Swap the array elements
- Equilibrium Point
- Array Leaders
- Parenthesis Checker
- Union of Arrays with Duplicates
- Product array puzzle
- Roman Number to Integer
- Mean of range in array
- Missing And Repeating
- Sort by Set Bit Count
- Adding Ones
- Common in 3 Sorted Arrays
- String Duplicates Removal
- Chocolate Distribution Problem
- Find Pair Given Difference
- Bitonic Point
- Single Number
- Remove Consecutive Characters
- Addition of submatrix
- Second most repeated string in a sequence
- Rope Cutting
- Find missing in second array
- Longest Common Prefix of Strings
- Min Number of Flips
- Two sum -Pairs with 0 Sum
- Count the Zeros
- Palindrome String
- Search array with adjacent diff at most k
- Max Sum Subarray of size K
- Arithmetic Number
- Geek and Snow Fighting
- Linked List Group Reverse
- Binary Tree to DLL
- Clone List with Next and Random
- Min distance between two given nodes of a Binary Tree
- Max rectangle
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Trapping Rain Water
- Max Circular Subarray Sum
- Smallest window containing all characters
- Histogram Max Rectangular Area
- Solve the Sudoku
- Burning Tree
- Merge Without Extra Space
- Count Pairs in an Array
- The Painter's Partition Problem-II
- Longest Prefix Suffix
- Minimum sum partition
- Palindromic Partitioning
- Matrix Chain Multiplication
- Median in a row-wise sorted Matrix
- Boolean Parenthesization
- Word Break - 2
- N-Queen Problem
- Minimum swap required to convert binary tree to binary search tree
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