Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
R
rupalics18
STREAK
01/1540
days
Longest streak/Global longest streak
72 points
Contributor
72 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
72 submissions in current year
SCHOOL (0)
BASIC (21)
EASY (67)
MEDIUM (119)
HARD (18)
- Reverse a linked list
- Frequency in a Linked List
- Pairwise swap elements of a linked list
- Node at a given index in linked list
- Split a Linked List into two halves
- Delete in a Doubly Linked List
- Inorder Traversal
- Right View of Binary Tree
- K distance from root
- Mirror 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
- Intersection Sorted Linked Lists
- Remove Duplicates from a Sorted Linked List
- Postorder Traversal
- Reverse Level Order Traversal
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Insertion at doubly linked list
- Binary Tree to BST
- Search a node in BST
- Delete in a Singly Linked List
- Kth largest element in BST
- Minimum element in BST
- Counting Sort
- Reverse Using Stack
- Symmetric Tree
- Reverse an Array
- Floor in a Sorted Array
- Parenthesis Checker
- N meetings in one room
- Missing in Array
- Product array puzzle
- Max Value Permutation
- Missing And Repeating
- Find Kth Rotation
- Maximize sum after K negations
- Common in 3 Sorted Arrays
- Sorted and Rotated Minimum
- Move all negative elements to end
- Chocolate Distribution Problem
- Alternate Positive Negative
- Number of occurrence
- Min Number of Flips
- Palindrome String
- Shop in Candy Store
- Number of 1 Bits
- Armstrong Numbers
- Nth Fibonacci Number
- Count Digits
- Prime Number
- Prime Factors
- Count Primes In Range
- Rearrange Geek and his Classmates
- Negative Prefix
- Print N to 1 without loop
- Print GFG n times
- All divisors of a Number
- Implement Lower Bound
- Implement Upper Bound
- Ceil in a Sorted Array
- Min distance between two given nodes of a Binary Tree
- Serialize and deserialize a binary tree
- Alien Dictionary
- Nodes at given distance in binary tree
- Trapping Rain Water
- Solve the Sudoku
- Burning Tree
- The Painter's Partition Problem-II
- Palindrome SubStrings
- Palindromic Partitioning
- Matrix Chain Multiplication
- Median in a row-wise sorted Matrix
- Boolean Parenthesization
- Word Break - 2
- N-Queen Problem
- Optimal binary search tree
- Word Ladder II
- Minimize Max Distance to Gas Station
- Detect Loop in linked list
- Insert in Sorted Circular Linked List
- Check for BST
- Merge Sort
- Quick Sort
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Flattening a Linked List
- Tree Boundary Traversal
- Implement stack using array
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Lowest Common Ancestor in a BST
- Two Stacks in an Array
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Kth smallest element in a Matrix
- Dijkstra Algorithm
- Minimum Spanning Tree
- Interleaved Strings
- Count Palindromic Subsequences
- Palindrome Linked List
- Rat in a Maze
- Bipartite Graph
- Top View of Binary Tree
- k-th Smallest in BST
- Level order traversal
- Root to Leaf Paths
- Populate Inorder Successor for all nodes
- Construct Tree from Inorder & Preorder
- Maximum path sum
- Predecessor and Successor
- Children Sum in a Binary Tree
- Find length of Loop
- Normal BST to Balanced BST
- ZigZag Tree Traversal
- Ceil in BST
- Wave Array
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Triplet Sum in Array
- Spirally traversing a matrix
- Distance of nearest cell having 1
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Strings Rotations of Each Other
- Case-specific Sorting of Strings
- Postfix Evaluation
- Infix to Postfix
- K Sized Subarray Maximum
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Target Sum Combinations
- M-Coloring Problem
- Egg Dropping Puzzle
- Optimal Strategy For A Game
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Allocate Minimum Pages
- Preorder to BST
- Kth Smallest
- Nth Catalan Number
- Rotate by 90 degree
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Search in Rotated Sorted Array
- Maximum Product Subarray
- Row with max 1s
- Longest Subarray with Sum K
- Count the Reversals
- Longest Common Substring
- Smallest distinct window
- Longest Substring with K Uniques
- K-th element of two Arrays
- Triplets with Smaller Sum
- Rod Cutting
- Minimum swaps and K together
- Longest Palindromic Subsequence
- First and Last Occurrences
- Coin Change (Count Ways)
- Sieve of Eratosthenes
- Gold Mine Problem
- Power Set
- nCr
- Maximum path sum in matrix
- Partition Equal Subset Sum
- Subset Sums
- Choose and Swap
- Find nth root of m
- Preorder Traversal and BST
- Segregate even and odd nodes in a Linked List
- Floyd Warshall
- Negative weight cycle
- Iterative Inorder
- Preorder traversal (Iterative)
- Iterative Postorder
- Subset Sum Problem
- All Palindromic Partitions
- Bellman-Ford
- Flatten binary tree to linked list
- Number of Distinct Islands
- Shortest Distance in a Binary Maze
- Minimum Multiplications to reach End
- Shortest Path in Undirected Graph
- Shortest path in Directed Acyclic Graph
- Frog Jump
- Geek's Training
- Aggressive Cows
- Shortest Path in Weighted undirected graph
- Non-overlapping Intervals
- Shortest Job first
- Floor in BST
- Rotate Array
- Find Length of Linked List
- Queue Using Array
- Preorder Traversal
- Linked List Insertion At End
- Circular Linked List Traversal
- Print 1 To N Without Loop
- Sorted Array Search
- Reverse a String
- Find second largest element
- Sum of Natural Numbers
- Value equal to index value
- Quick Left Rotation
- Largest Element in Array
- Rotate Array by One
- Rotating an Array
- GCD of two numbers
- Factorial
- Print 1 to n without using loops
- Count Squares
- Sorted matrix