Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
M
02dce
STREAK
00/1547
days
Longest streak/Global longest streak
Language Used
C++
Coding Score
161
Problem Solved
75
Contest Rating
__
4481 points
Contributor
4481 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 (7)
EASY (31)
MEDIUM (34)
HARD (3)
- SP - Palindrome Family
- SP - Beautiful Pairs
- Reverse a linked list
- Height of Binary Tree
- Balanced Tree Check
- Middle of a Linked List
- Left View of Binary Tree
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Identical Trees
- Root to leaf path sum
- Binary Search
- Delete in a Singly Linked List
- Symmetric Tree
- First Set Bit
- Power of 2
- Array Leaders
- Minimum Number in a sorted rotated array
- Anagram
- Reverse Words
- Parenthesis Checker
- Count number of hops
- Missing in Array
- Count the triplets
- Convert array into Zig-Zag fashion
- Two Sum - Pair with Given Sum
- First Repeated Character
- Minimum number of Coins
- Tom and Jerry
- Help the Old Man!!!
- Maximum Sum LCM
- SP - Special Subsequences
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Count BST nodes that lie in a given range
- Check for BST
- Merge Sort
- Quick Sort
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Stack using Queue
- Lowest Common Ancestor in a BST
- Vertical Tree Traversal
- Gas Station
- Implement Atoi
- Rat in a Maze
- Kadane's Algorithm
- Binary Array Sorting
- Indexes of Subarray Sum
- Sort by Absolute Difference
- Infix to Postfix
- Find median in a stream
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Sort 0s, 1s and 2s
- Single Among Doubles in a Sorted
- K-th element of two Arrays
- Permutations of a String
- Max Sum Increasing Subsequence
- Array Pair Sum Divisibility Problem
- Choose and Swap
- LCM Triplet
- Print leaf nodes from preorder traversal of BST