- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
A
deepaman07ad
STREAK
01/1431
days
Longest streak/Global longest streak
Language Used
C++, C
Coding Score
635
Problem Solved
222
Contest Rating
__
263 points
Contributor
263 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
7 submissions in current year
SCHOOL (0)
BASIC (27)
EASY (80)
MEDIUM (97)
HARD (18)
- 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
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Transform to Sum Tree
- Intersection Sorted Linked Lists
- Queue using two Stacks
- Stack using two queues
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a BST
- Binary Tree to BST
- Leaves at Same Level or Not
- Multiply two linked lists
- Kth largest element in BST
- Level order traversal
- Reverse Using Stack
- Median of BST
- Queue Reversal
- Reverse first K of a Queue
- Brothers From Different Roots
- Delete Mid of a Stack
- Rotate doubly Linked List
- Frequencies in a Limited Array
- Parenthesis Checker
- K largest elements
- Minimum Cost of ropes
- Product array puzzle
- Missing And Repeating
- Sort by Set Bit Count
- Common in 3 Sorted Arrays
- Sum of elements between k1'th and k2'th smallest elements
- Chocolate Distribution Problem
- Find Pair Given Difference
- Left most and right most index
- Smallest subarray with sum greater than x
- Two sum -Pairs with 0 Sum
- Merge two binary Max heaps
- Search array with adjacent diff at most k
- Armstrong Numbers
- Reverse Bits
- Count Digits
- Palindrome
- Shortest path from 1 to n
- Sum 1 to n Divisors
- Factorials Less than or Equal to n
- First and last occurrences of x
- Split the binary string into substrings with equal number of 0s and 1s
- Subsequence Mex
- Again Permutation
- Kth Mex
- Pattern 2
- Pattern 3
- Pattern 4
- Pattern 14
- Pattern 15
- Pattern 16
- Pattern 17
- Pattern 18
- Pattern 19
- Pattern 20
- Pattern 21
- Print N to 1 without loop
- Print GFG n times
- Pattern 12
- Pattern 22
- Search in Linked List
- Array to Linked List
- Introduction to Doubly Linked List
- Count Linked List Nodes
- Postorder Traversal
- Implement stack using array
- Preorder Traversal
- Search a node in BST
- Palindromic Array
- Linked List Insertion At End
- Minimum element in BST
- Print 1 To N Without Loop
- Value equal to index value
- Rotate Array by One
- Array Subset
- Decision Making in Java
- LCM And GCD
- Median of an Array
- Sum of first n terms
- Count Squares
- Middle of Three
- Sorted matrix
- Pattern 1
- Pattern 5
- Pattern 6
- Pattern 7
- Pattern 8
- Pattern 10
- Pattern 11
- Pattern 13
- Sort a linked list of 0s, 1s and 2s
- Add 1 to a Linked List Number
- Quick Sort on Linked List
- Count BST nodes that lie in a given range
- Merge Sort
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Sum Tree
- Flattening a Linked List
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Two Stacks in an Array
- The Celebrity Problem
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Gas Station
- Kth element in Matrix
- Is Binary Tree Heap
- Minimum Swaps to Sort
- Palindrome Linked List
- Rat in a Maze Problem - I
- Sort a stack
- Top View of Binary Tree
- k-th Smallest in BST
- Merge Sort for Linked List
- Populate Inorder Successor for all nodes
- K Sum Paths
- Construct Tree from Inorder & Preorder
- Predecessor and Successor
- Deletion and Reverse in Circular Linked List
- Normal BST to Balanced BST
- Duplicate Subtrees
- Sum of nodes on the longest path
- Kth Ancestor in a Tree
- ZigZag Tree Traversal
- Maximum sum of Non-adjacent nodes
- Smallest Positive Missing
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Triplet Sum in Array
- Spirally traversing a matrix
- Subarray with 0 sum
- Next Greater Element
- Minimum Platforms
- Combination Sum
- Minimum Jumps
- Stickler Thief
- Allocate Minimum Pages
- Zero Sum Subarrays
- Kth Smallest
- Maximize The Cut Segments
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Smallest factorial number
- Maximum Product Subarray
- Row with max 1s
- Max Sum without Adjacents
- Factorials of large numbers
- k largest elements
- Longest Substring with K Uniques
- Longest Palindrome in a String
- Valid Expression
- K-th element of two Arrays
- Triplets with Smaller Sum
- First negative in every window of size k
- Minimum sum
- Minimize the Heights II
- First and Last Occurrences
- Valid Substring
- Permutations of a String
- Coin Change (Count Ways)
- Coin Change (Minimum Coins)
- Partition Equal Subset Sum
- Game with String
- Longest Repeating Subsequence
- Stream First Non-repeating
- Check Mirror in N-ary tree
- Flood fill Algorithm
- Help Classmates
- Subset Sum Problem
- Subarrays with sum K
- Rearrange characters
- Number of Provinces
- Flatten binary tree to linked list
- Min Cost Climbing Stairs
- Overlapping Intervals
- Reverse a Stack
- K-th Largest Sum Contiguous Subarray
- Check if all levels of two trees are anagrams or not
- Maximum Multiple
- Pattern
- Binary Tree to DLL
- Clone List with Next and Random
- Min distance between two given nodes of a Binary Tree
- Max rectangle
- Smallest range in K lists
- Trapping Rain Water
- Smallest window containing all characters of another string
- Find median in a stream
- Solve the Sudoku
- Burning Tree
- Merge Without Extra Space
- Minimum sum partition
- Median in a row-wise sorted Matrix
- Word Break - 2
- N-Queen Problem
- Word Break (Trie)
- Shortest Unique prefix for every word
- Remove Invalid Parentheses
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