Courses
Tutorials
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
person_outline
Profile
description
Contributions
school
Colleges
business
Companies
people_outline
Campus Ambassadors
N
noob_coder123
Current POTD Streak
STREAK
00
/1373
days
Longest streak/Global longest streak
Institution
Jadavpur University, Kolkata
269 Rank
Institute Rank
Language Used
C++
Coding Score
116
Problem Solved
48
Contest Rating
__
Apply for Campus Ambassador
3 points
Contributor
3 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
Find Your Place Among the Best
Explore Our Badge Program and Start Writing.
Start writing
How Badges Work
0 submissions in current year
Current
2024
2023
2022
2021
2020
January
February
March
April
May
SCHOOL (1)
BASIC (8)
EASY (15)
MEDIUM (23)
HARD (1)
Binary Tree from Inorder and Postorder
Bottom View of Binary Tree
Diameter of a Binary Tree
Sum Tree
Diagonal Tree Traversal
Duplicate Subtree
Top View of Binary Tree
Construct Tree from Inorder & Preorder
Isomorphic Trees
Duplicate Subtrees
Sum of nodes on the longest path
Count total set bits
Kadane's Algorithm
Kth Smallest
Sort 0s, 1s and 2s
Count the Reversals
Longest Palindrome in a String
Friends Pairing Problem
Unique Number II
Gold Mine Problem
Power Set
Longest Repeating Subsequence
Check Mirror in N-ary tree
Right View of Binary Tree
Height of Binary Tree
Balanced Tree Check
Left View of Binary Tree
Transform to Sum Tree
Reverse Level Order Traversal
Leaves at Same Level or Not
Level order traversal
Power of 2
Parenthesis Checker
Union of Arrays with Duplicates
Common in 3 Sorted Arrays
Palindrome String
Number of 1 Bits
Copy Set Bits in Range
Edit Distance
Smallest divisible number
Absolute Value
Bit Difference
Addition Under Modulo
Reverse a String
Rotate Array by One
Find position of set bit
Middle of Three
Reverse an Array
close
N
person_outline
Profile
description
Contributions
school
Colleges
business
Companies
people_outline
Campus Ambassadors
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
Got It !