- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
R
rhythmshandlya
STREAK
03/1426
days
Longest streak/Global longest streak
67 points
Contributor
67 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 (0)
BASIC (19)
EASY (97)
MEDIUM (167)
HARD (19)
- Preorder Traversal
- Search a node in BST
- Peak element
- Minimum element in BST
- Bit Difference
- Reverse a String
- Quick Left Rotation
- Largest Element in Array
- Rotate Array by One
- Exceptionally odd
- Array Subset
- Check set bits
- Set the rightmost unset bit
- Count Squares
- Middle of Three
- Swap two numbers
- Sorted matrix
- Max Min
- Pattern 7
- Sorting Elements of an Array by Frequency
- Nearly Sorted Algorithm
- Rotate a Linked List
- Add Number Linked Lists
- Add 1 to a Linked List Number
- Detect Loop in linked list
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Flattening a Linked List
- Tree Boundary Traversal
- Delete a node from BST
- LCA in Binary Tree
- The Celebrity Problem
- Largest subarray with 0 sum
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Get Min from Stack
- Wildcard Pattern Matching
- Kth element in Matrix
- Remove loop in Linked List
- Dijkstra Algorithm
- Largest BST
- Minimum Swaps to Sort
- Implement Atoi
- Palindrome Linked List
- Rat in a Maze Problem - I
- Merge two BST 's
- Trie | (Delete)
- Merge k Sorted Arrays
- Sort a stack
- Top View of Binary Tree
- k-th Smallest in BST
- Union of Two Linked Lists
- Root to Leaf Paths
- Construct Tree from Inorder & Preorder
- Maximum path sum from any node
- Predecessor and Successor
- Children Sum in a Binary Tree
- ZigZag Tree Traversal
- Ceil in BST
- Count total set bits
- Power Of Numbers
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Union of 2 Sorted with Duplicates
- Triplet Sum in Array
- Merge Without Extra Space
- Spirally traversing a matrix
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Postfix Evaluation
- Next Greater Element
- Infix to Postfix
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Largest number in K swaps
- M-Coloring Problem
- Minimum Jumps
- Stickler Thief
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Preorder to BST
- Zero Sum Subarrays
- Kth Smallest
- Implement Trie
- Shortest Common Supersequence
- Steps by Knight
- Print Anagrams Together
- Top K Frequent in Array
- Word Break
- Stock Buy and Sell – Multiple Transaction Allowed
- Generate Parentheses
- Prerequisite Tasks
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Maximize Number of 1's
- Single Among Doubles in a Sorted
- Count Occurences of Anagrams
- Single Among Doubles
- Search in Rotated Sorted Array
- Max Score from Subarray Mins
- Maximum Product Subarray
- Row with max 1s
- Substrings with K Distinct
- Form a palindrome
- Longest Subarray with Sum K
- Max Sum without Adjacents
- Factorials of large numbers
- k largest elements
- Longest Common Substring
- Longest Substring with K Uniques
- Longest Palindrome in a String
- Valid Expression
- 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
- Minimum sum
- Minimize the Heights II
- First and Last Occurrences
- Permutations of a String
- Subarrays Product Less than K
- Minimum number of deletions and insertions
- Minimum cost to fill given weight in a bag
- Coin Change (Count Ways)
- Coin Change (Minimum Coins)
- Perfect Sum Problem
- Power Set
- Knapsack with Duplicate Items
- nCr
- Maximum path sum in matrix
- Partition Equal Subset Sum
- Min Coin
- Choose and Swap
- Next Permutation
- Segregate even and odd nodes in a Linked List
- Kth Largest in a Stream
- Two numbers with odd occurrences
- Special Matrix
- Spiral Matrix
- Help Classmates
- Jump Game
- Preorder traversal (Iterative)
- Iterative Postorder
- Subset Sum Problem
- Search Pattern (Rabin-Karp Algorithm)
- Subarrays with sum K
- Rearrange characters
- Remove K Digits
- Prefix match with other strings
- Flatten binary tree to linked list
- Target Sum
- Overlapping Intervals
- Reverse a Stack
- Next element with greater frequency
- Sum of Beauty of All Substrings
- Koko Eating Bananas
- Search in Rotated Array 2
- Count Subarray with k odds
- Sum of subarray minimum
- Frog Jump
- Asteroid Collision
- Aggressive Cows
- Next Greater Element 2
- Prime Factorization using Sieve
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Minimum days to make M bouquets
- Delete all occurrences of a given key in a doubly linked list
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Task Scheduler
- Maximum Sum Combination
- Minimum Window Substring
- Replace elements by its rank in the array
- Floor in BST
- Linked List Group Reverse
- Reorder List
- Binary Tree to DLL
- Max rectangle
- Distinct occurrences
- Trapping Rain Water
- Histogram Max Rectangular Area
- Find median in a stream
- Median of 2 Sorted Arrays of Different Sizes
- Merge Without Extra Space
- Longest Prefix Suffix
- Wildcard string matching
- Edit Distance
- Minimum sum partition
- Matrix Chain Multiplication
- Median in a row-wise sorted Matrix
- Boolean Parenthesization
- N-Queen Problem
- Word Wrap
- Reverse a linked list
- Pairwise swap elements of a linked list
- Delete nodes having greater value on right
- Split a Linked List into two halves
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Middle of a Linked List
- Left View of Binary Tree
- Delete Middle of Linked List
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Square Root
- Lowest Common Ancestor in a BST
- Binary Search
- Remove Duplicates Sorted Array
- Special Stack
- Three way partitioning
- Level order traversal
- More than n/k Occurrences
- Reverse Using Stack
- Symmetric Tree
- Find length of Loop
- Reverse first K of a Queue
- Find the Frequency
- K-th Bit is Set or Not
- Power of 2
- Frequencies in a Limited Array
- Array Leaders
- Floor in a Sorted Array
- Strings Rotations of Each Other
- Reverse Words
- Parenthesis Checker
- K largest elements
- Minimum Cost of ropes
- N meetings in one room
- Product array puzzle
- Roman Number to Integer
- Missing And Repeating
- Maximize sum after K negations
- Adding Ones
- Common in 3 Sorted Arrays
- Sorted and Rotated Minimum
- Search in a Row-Column sorted matrix
- Move All Zeroes to End
- Missing number
- Chocolate Distribution Problem
- Find Pair Given Difference
- Smallest subarray with sum greater than x
- Alternate Positive Negative
- Find all pairs with a given sum
- Number of occurrence
- Does array represent Heap
- Check if array is sorted
- Longest Common Prefix of Strings
- Two sum -Pairs with 0 Sum
- Search array with adjacent diff at most k
- Fitting The Array
- K-th missing element
- Shop in Candy Store
- Is Binary Number Multiple of 3
- Number of 1 Bits
- Max Sum Subarray of size K
- Nth Fibonacci Number
- Ceil The Floor
- Sieve of Eratosthenes
- Reach the Nth point
- Sum of First N Natural Numbers
- Find nth root of m
- Prime Factors
- Make Zeroes
- Search insert position of K in a sorted array
- Split the binary string into substrings with equal number of 0s and 1s
- Find pairs with given sum in doubly linked list
- Recursively print all sentences that can be formed from list of word lists
- Largest odd number in string
- Maximum Nesting Depth of the Parentheses
- Find XOR of numbers from L to R.
- Maximum Depth Of Binary Tree
- Remove duplicates from a sorted doubly linked list
- Bit Manipulation
- Introduction to Trees
- Binary Search Trees
- Implementation of Priority Queue using Binary Heap
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