- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
R
rd9437
starstarstar
STREAK
419/1432
days
Longest streak/Global longest streak
Language Used
Python, Java, C++
Coding Score
2187
Problem Solved
697
Contest Rating
1630
67 points
Contributor
67 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
583 submissions in current year
SCHOOL (0)
BASIC (72)
EASY (237)
MEDIUM (336)
HARD (52)
- Reverse a linked list
- Occurence of an integer in a Linked List
- Linked list of strings forms a palindrome
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Insertion Sort
- 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
- Check If Circular Linked List
- Left View of Binary Tree
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- DFS of Graph
- Stack using Linked List
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Square Root
- Lowest Common Ancestor in a BST
- Largest subarray of 0's and 1's
- BST Keys in a Range
- Remove duplicates in array
- Multiply two linked lists
- You and your books
- Max distance between same elements
- Count distinct elements in every window
- Three way partitioning
- Level order traversal
- Index of an Extra Element
- Split Linked List Alternatingly
- More than n/k Occurrences
- Counting Sort
- Symmetric Tree
- Delete Alternate Nodes
- Find the Sum of Last N nodes of the Linked List
- Find length of Loop
- Linked List Matrix
- Queue Reversal
- Reverse first K of a Queue
- Remove Half Nodes
- Closest Neighbour in BST
- Delete Mid of a Stack
- Reverse an Array
- Get min at pop
- Implement Stack Using Array
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Kadane's Algorithm - I
- Kadane's Algorithm - II
- First Set Bit
- Rightmost different bit
- K-th Bit is Set or Not
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Inverse
- Power of 2
- Swap all odd and even bits
- Equilibrium Point
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Roof Top
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Sort by Absolute Difference
- Print adjacency list
- Sum of upper and lower triangles
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Matrix Boundary Traversal
- Exchange matrix columns
- Naive Pattern Search
- Anagram
- String Rotated by 2 Places
- Strings Rotations of Each Other
- Isomorphic Strings
- Reverse Words
- Non Repeating Character
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Parenthesis Checker
- Minimum indexed character
- Generate Binary Numbers
- Minimum Cost of ropes
- N meetings in one room
- Largest number with given sum
- Count Total Digits in a Number
- Power Set Using Recursion
- Union-Find
- Count number of hops
- Recursively Sum N Numbers
- Factorial Using Recursion
- Check Palindrome
- Middle Of Stack
- Rotate Deque By K
- Union of Arrays with Duplicates
- Reach a given score
- Check Equal Arrays
- Nth number made of prime digits
- Numbers containing 1, 2 and 3
- Positive Negative Pair
- Search Query for Strings
- Count Elements Greater Than X
- Count Smaller Than X
- Find Immediate Smaller Than X
- Array Update At Index
- Array Delete And Shift
- Is Array Sorted
- Find Immediate Greater Than X
- Missing in Array
- Product array puzzle
- Reverse The Array
- Find nCr
- Delete Tail of Linked List
- Delete Head of Linked List
- Linked List Delete at Position
- Is Linked List Sorted
- Join Two Linked Lists
- Circular Linked List Head Insert
- Circular Linked List Tail Insert
- Circular Linked List Insertion At Position
- Delete Tail of Circular Linked List
- Delete Head of Circular Linked List
- Circular Linked List Delete at Position
- Delete Tail of Doubly Linked List
- Delete Head of Doubly Linked List
- Is The Doubly Linked List Circular
- Compare Circular Doubly Linked Lists
- Find Middle of Circular Doubly Linked List
- Intersection of Arrays with Distinct
- Sort 0s, 1s and 2s
- Maximize Array Value After Rearrangement
- Find the closest number
- Left Index
- Split the Array
- Sorted and Rotated Minimum
- Search in a Row-Column sorted matrix
- Move All Zeroes to End
- Count pairs Sum in matrices
- Find Pair Given Difference
- Pairs with difference k
- Swap and Maximize
- Bitonic Point
- Single Number
- Alternate positive and negative numbers
- Remaining String
- Kth distance
- Remove Duplicates
- Nearest multiple of 10
- Reorganize The Array
- Facing the sun
- Second Largest
- Convert array into Zig-Zag fashion
- Two Sum - Pair with Given Sum
- Number of occurrence
- K-Pangrams
- Modify the Array
- Sum Pair closest to target
- Longest Common Prefix of Strings
- Longest substring with distinct characters
- Substrings with same first and last characters
- Segregate 0s and 1s
- Total count
- Pair with given sum in a sorted array
- Print Bracket Number
- Odd Even Problem
- Binary representation of next number
- Padovan Sequence
- Extract the Number from the String
- Find the Highest number
- Armstrong Numbers
- Swap two nibbles in a byte
- Count numbers containing 4
- Trail of ones
- K-Palindrome
- Minimum Cost To Make Two Strings Identical
- Compare two fractions
- Juggler Sequence
- Summed Matrix
- Coverage of all Zeros in a Binary Matrix
- Array to BST
- Find maximum volume of a cuboid
- Sort a k sorted doubly linked list
- Stock Buy and Sell – Max one Transaction Allowed
- Find the first node of loop in linked list
- Nearest Perfect Square
- The Conversion To One
- A Boolean Matrix Problem
- Toggle The Middle
- Without Adjacent
- K Sum
- XOR Pair
- Kth Smallest Difference
- Doubly Linked List Conversion
- Average of String
- Rolling Hash
- Closest friends!
- Pairing the brackets
- Alternate Leaf Nodes Sum
- Kth Maximum element of Max-Heap
- Matrix - Destination
- Maximum Integer Value
- Are we facebook friends?
- Give it a trie!
- Two Smallests in Every Subarray
- Split an array into two equal Sum subarrays
- Largest Pair Sum
- Two Swaps
- Maximize partitions in a String
- Count pairs with given sum
- Count Pairs whose sum is less than target
- Union of Two Sorted Arrays with Distinct Elements
- Intersection of Two arrays with Duplicate Elements
- Find All Triplets with Zero Sum
- Search in a row-wise sorted matrix
- Find Only Repetitive Element from 1 to n-1
- Unique Number I
- Rotate a Linked List
- 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
- Quick Sort on Linked List
- Insert in Sorted Circular Linked List
- Count BST nodes that lie in a given range
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Sum Tree
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Tree Boundary Traversal
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Two Stacks in an Array
- Binary Heap Operations
- Max sum path in two arrays
- The Celebrity Problem
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Max sum in the configuration
- Get Min from Stack
- Serialize and deserialize a binary tree
- Gas Station
- Linked List to Binary Tree
- Toeplitz matrix
- Check if subtree
- Kth element in Matrix
- Is Binary Tree Heap
- Validate an IP Address
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Sorted subsequence of size 3
- Multiply two strings
- Minimum Swaps to Sort
- Implement Atoi
- Maximum Difference
- Palindrome Linked List
- Strongly Connected
- Rat in a Maze Problem - I
- Closest in BST
- BST with Dead End
- Merge two BST 's
- Merge k Sorted Arrays
- Root to leaf paths sum
- Bridge edge in a graph
- Find triplets with zero sum
- Top View of Binary Tree
- k-th Smallest in BST
- Find Common Nodes in two BSTs
- Ancestors in Binary Tree
- Binary Tree to CDLL
- Pair Sum in BST
- Root to Leaf Paths
- Populate Inorder Successor for all nodes
- XOR Linked List
- Counting elements in two arrays
- K Sum Paths
- Foldable Binary Tree
- Construct Tree from Inorder & Preorder
- Count the nodes at distance K from leaf
- Insert in Sorted way in a Sorted DLL
- Maximum path sum from any node
- Predecessor and Successor
- Children Sum in a Binary Tree
- Deletion and Reverse in Circular Linked List
- Duplicate Subtrees
- Sum of nodes on the longest path
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Largest Sum Contiguous Subarray in Range
- Vertical Width of a Binary Tree
- Coin Change - Minimum number of coins
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Mother Vertex
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Count total set bits
- Gray to Binary equivalent
- Maximum AND Value
- Tower Of Hanoi
- Smallest Positive Missing
- Power Of Numbers
- Maximum occured integer
- Possible Words From Phone Digits
- Rotate and delete
- Rearrange an array with O(1) extra space
- Maximum Index
- Stock buy and sell
- Rotate Array
- Check if array is sorted and rotated
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Smallest Positive missing number
- Unique BST's
- Union of 2 Sorted with Duplicates
- Indexes of Subarray Sum
- Count the number of possible triangles
- Triplet Sum in Array
- Number of pairs
- Merge three sorted arrays
- Closer to sort
- Make Matrix Beautiful
- Boolean Matrix
- Spirally traversing a matrix
- Search in a sorted Matrix
- Determinant of a Matrix
- Level of Nodes
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Possible paths between 2 vertices
- Subarray with 0 sum
- Subarray range with given sum
- Subarrays with equal 1s and 0s
- Sort Elements by Decreasing Frequency
- Longest Consecutive Subsequence
- Case-specific Sorting of Strings
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Kth largest element
- Kth smallest element
- K Most occurring elements
- Nearly sorted
- Activity Selection
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Largest number in K swaps
- Black and White
- Combination Sum
- Unique Subsets
- M-Coloring Problem
- Minimum Jumps
- Detect Cycle using DSU
- Ways to write n as sum
- Stickler Thief
- Ways to Reach the n'th Stair
- Egg Dropping Puzzle
- Optimal Strategy For A Game
- nCr
- Sum of all substrings of a number
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Range Min Max Queries
- Range Longest Correct Bracket Subsequence Queries
- Range GCD Queries
- Range LCM Queries
- Number of Unique Paths
- Minimum number of jumps
- Equal Sum Partition
- Allocate Minimum Pages
- Preorder to BST
- X Total Shapes
- Zero Sum Subarrays
- 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
- Smaller on Right
- Count only Repeated
- Camel Case
- Renaming Cities
- Longest Subarray Of Evens And Odds
- Maximize The Cut Segments
- Container With Most Water
- Print Anagrams Together
- Rotate by 90 degree
- Closest Three Sum
- Word Break
- Word Search
- Maximum Water Between Two Buildings
- Missing And Repeating
- Pascal Triangle
- Longest Span in two Binary Arrays
- Median of two sorted arrays
- Pythagorean Triplet
- Search in Rotated Sorted Array
- Add Binary Strings
- Maximum Product Subarray
- Sort the given array after applying the given equation
- Row with max 1s
- Swapping pairs make sum equal
- Check if frequencies can be equal
- Substrings with K Distinct
- Palindrome SubStrings
- Form a palindrome
- Nuts and Bolts Problem
- Longest Subarray with Sum K
- Search Pattern (KMP-Algorithm)
- k largest elements
- Longest Common Substring
- Smallest distinct window
- Longest Substring with K Uniques
- Longest Palindrome in a String
- Look and Say Pattern
- K-th element of two Arrays
- K closest elements
- Missing element of AP
- LCS of three strings
- Longest Palindromic Subsequence
- Equalize the Towers
- Minimum sum
- Not a subset sum
- Minimize the Heights II
- Minimum Deletions
- Nearly sorted
- Permutations of a String
- Unique Number II
- Modular Exponentiation for large numbers
- Maximum Tip Calculator
- Minimum number of deletions and insertions
- Minimum cost to fill given weight in a bag
- Coin Change (Count Ways)
- String Subsequence
- Mobile numeric keypad
- Coin Change (Minimum Coins)
- Dice throw
- Smallest number
- Longest subsequence-1
- Count ways to N'th Stair(Order does not matter)
- nCr
- Geek and its Game of Coins
- Minimum steps to destination
- Partition Equal Subset Sum
- Prime Pair with Target Sum
- Nth Natural Number
- Game of Chocolates
- Game with String
- Next Permutation
- Longest alternating subsequence
- Left Rotate Matrix K times
- Decode the string
- Total Decoding Messages
- Check If two Line segments Intersect
- Print leaf nodes from preorder traversal of BST
- Number of Rectangles in a Circle
- Largest square formed in a matrix
- Rat Maze With Multiple Jumps
- Integral Points Inside Triangle
- Kth Largest in a Stream
- Divide and Subtract Game
- Count the paths
- Floyd Warshall
- Flood fill Algorithm
- Divisibility tree
- Police and Thieves
- Subset Sum Problem
- Search Pattern (Rabin-Karp Algorithm)
- All Palindromic Partitions
- Bellman-Ford
- Subarrays with sum K
- Coin Piles
- Rearrange characters
- Substrings of length k with k-1 distinct elements
- Maximum XOR of two numbers in an array
- Construct list using given q XOR queries
- Find rectangle with corners as 1
- Remove all occurences of duplicates in a linked list
- Minimize the Heights I
- Unique Number III
- Clone an Undirected Graph
- Min Cost Climbing Stairs
- Overlapping Intervals
- Maximum product subset of an array
- K-th Largest Sum Contiguous Subarray
- Exactly one swap
- Path With Minimum Effort
- Shortest path in Undirected Graph
- Majority Element II
- Koko Eating Bananas
- Longest subarray with Atmost two distinct integers
- Minimal Cost
- Aggressive Cows
- Smallest Divisor
- Shortest Path in Weighted undirected graph
- Prefix to Infix Conversion
- Postfix to Infix Conversion
- Non-overlapping Intervals
- Stickler Thief II
- Insert Interval
- Longest String Chain
- Negative weight cycle
- Partitions with Given Difference
- Largest Divisible Subset
- Make array elements unique
- Minimum repeat to make substring
- Prime List
- Unique Paths in a Grid
- Number of Good Components
- Remove the balls
- Get the Shadow
- Sum Array
- Range LCM Queries
- Kth Missing Positive Number in a Sorted Array
- Count Subarrays with given XOR
- Set Matrix Zeroes
- Minimum cost to connect all houses in a city
- Meeting Rooms
- Split array in three equal sum subarrays
- Search in an almost Sorted Array
- Find H-Index
- Longest Subarray with Majority Greater than K
- Count all triplets with given sum in sorted array
- Implement Pow
- K Closest Points to Origin
- Longest Bounded-Difference Subarray
- Water Tanks
- Lexicographically Largest String After K Deletions
- Group Balls by Sequence
- Linked List Group Reverse
- Binary Tree to DLL
- Clone List with Next and Random
- Wildcard Pattern Matching
- LRU Cache
- Alien Dictionary
- Smallest range in K lists
- Fixing Two nodes of a BST
- Huffman Decoding
- Trapping Rain Water
- Max Circular Subarray Sum
- Merge Without Extra Space
- Pattern Search
- Smallest window containing all characters of another string
- Histogram Max Rectangular Area
- Max of min for every window size
- Find median in a stream
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Largest Sum Contiguous Subarray in Range
- Minimum Cost Path
- Median of Two sorted arrays
- Contiguous Elements XOR
- Stock Buy and Sell – Multiple Transaction Allowed
- Burning Tree
- Merge Without Extra Space
- Count Smaller elements
- Longest Prefix Suffix
- Circle of strings
- Sum-string
- Sub-arrays with equal number of occurences
- Edit Distance
- Stock Buy and Sell – Max K Transactions Allowed
- Matrix Chain Multiplication
- The Palindrome Pattern
- Boolean Parenthesization
- Longest valid Parentheses
- N-Queen Problem
- Articulation Point - II
- Split Array Largest Sum
- Articulation Point - I
- Kth Smallest Number in Multiplication Table
- Stock Buy and Sell – Max 2 Transactions Allowed
- Min Chars to Add for Palindrome
- Number of pairs
- Maximum Connected group
- Minimize Max Distance to Gas Station
- Account Merge
- Max min Height
- Total Strongly Connected Components
- Meeting Rooms III
- Minimum Weight Cycle
- Count Linked List Nodes
- Postorder Traversal
- Queue using Linked List
- Queue Using Array
- Doubly linked list Insertion at given position
- Preorder Traversal
- First Occurence
- Search a node in BST
- Peak element
- Linked List Insertion At End
- Minimum element in BST
- Is Linked List Length Even?
- Identical Linked Lists
- Triplet Family
- Who has the majority?
- Array insert at index
- Array insert at end
- Operations on Stack
- Operations on Queue
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Bit Difference
- Number is sparse or not
- Binary To Gray Code equivalent
- Print 1 To N Without Loop
- Array Search
- Sorted Array Search
- Binary Array Sorting
- Adding two matrices
- Multiply the matrices
- Check if a string is Isogram or not
- Binary String
- Most Frequent Character
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Print Array Elements Using Recursion
- The Sequence
- GCD Euclid
- Insert In Stack
- Reverse Array Using Stack
- Preorder in BST
- Inorder in BST
- Postorder in BST
- Levelorder in BST
- Insertion in deque
- Deque Traversal
- Deque deletion
- Keypad typing
- First n Fibonacci
- Get Element At Index
- Maximum and Minimum In Array
- Display Linked List
- Sum The Nodes of Linked List
- Maximum And Minimum In Linked List
- Search In Linked List
- Linked List Insertion At Position
- Display Circular Linked List
- Length of Circular Linked List
- Display Doubly Linked List
- Doubly Linked List Head Insert
- Doubly Linked List Tail Insert
- Display Circular Doubly Linked List
- Implement Dequeue Using Linked List
- Alternative Sorting
- Minimum At Pop
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