Sign In
Profile
Articles
group
Community
people_outline
Campus Ambassadors
Uncover Diverse Options in Colleges and Companies
View Colleges
View Companies
close
Sort by:
relevance
date
My Profile
My Courses
Go Premium
Edit profile
settings
Account Settings
Logout
menu
Sign In
×
Sign In
Sign Up
account_circle
lock
Remember me
Forgot Password
Sign In
email
lock
business
Sign Up
or
Google
Facebook
LinkedIn
GitHub
Why Create an Account?
By creating this account, you agree to our
Privacy Policy
&
Cookie Policy
.
Please enter your email address or userHandle.
account_circle
Back to Login
Reset Password
person_outline
Profile
description
Articles
people_outline
Campus Ambassadors
Uncover Diverse Options in Colleges and Companies
View Colleges
View Companies
12101996
Follow
Current POTD Streak
STREAK
00
/970
days
Language Used
C++
Institute
_ _
Overall Coding Score
334
Total Problem Solved
182
Monthly Coding Score
_ _
Contributor
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
SCHOOL (0)
BASIC (29)
EASY (87)
MEDIUM (62)
HARD (4)
Quick Left Rotation
C++ STL | Set 5 (queue)
Check set bits
Array Subset of another array
Check if two arrays are equal or not
Reverse array in groups
Elements in the Range
Index of first 1 in a sorted array of 0s and 1s
Search a node in BST
Linked List Insertion
Implement stack using array
Check If Circular Linked List
Delete node in Doubly Linked List
Doubly linked list Insertion at given position
Implement Stack using Linked List
Implement Queue using Linked List
Node at a given index in linked list
Print Linked List elements
Count nodes of linked list
Delete Alternate Nodes
Identical Linked Lists
Find the Sum of Last N nodes of the Linked List
Linked List Length Even or Odd?
Count Leaves in Binary Tree
Inorder Traversal
Preorder Traversal
Size of Binary Tree
Postorder Traversal
Minimum element in BST
Minimum element in a sorted and rotated array
Rotation
Queue using two Stacks
Four Elements
Sum equals to Sum
Count the elements
Number of Groups
Second most repeated string in a sequence
Twice Counter
Chocolate Distribution Problem
Max Sum Subarray of size K
Leaders in an array
Equilibrium Point
Missing number in array
Count Pairs whose sum is equal to X
Does array represent Heap
Inorder Successor in BST
Inorder Traversal and BST
Move all negative elements to end
Wave Array
Longest Common Prefix in an Array
1[0]1 Pattern Count
Intersection of two sorted Linked lists
Reverse a string using Stack
Multiply two linked lists
Decimal Equivalent of Binary Linked List
Remove duplicates from an unsorted linked list
Pairwise swap elements of a linked list
Split a Circular Linked List into two halves
Remove duplicate element from sorted Linked List
Split Singly Linked List Alternatingly
Given a linked list of 0s, 1s and 2s, sort it.
Compare two linked lists
linked list of strings forms a palindrome
Delete without head pointer
Detect Loop in linked list
Check for Balanced Tree
Root to leaf path sum
Triplet with 0 sum in BST
Insert a node in a BST
Sum of leaf nodes in BST
Construct BST from Postorder
Sum of k smallest elements in BST
Nth node from end of linked list
Delete a Node in Single Linked List
Arrange Consonants and Vowels
Delete N nodes after M nodes of a linked list
Delete Middle of Linked List
Remove every kth node
Reverse a Doubly Linked List
Reverse a linked list
Occurence of an integer in a Linked List
Finding middle element in a linked list
Merge Lists Alternatingly
Symmetric Tree
K distance from root
Print all nodes that don't have sibling
Ancestors in Binary Tree
Check for BST
Longest consecutive sequence in Binary tree
Minimum Depth of a Binary Tree
Level order traversal Line by Line
Kth largest element in BST
Transform to Sum Tree
Check if all leaves are at same level
Root to leaf paths sum
Reverse alternate levels of a perfect binary tree
Binary Tree to BST
Expression Tree
Print BST elements in given range
Max Level Sum in Binary Tree
Left View of Binary Tree
Right View of Binary Tree
Reverse Level Order Traversal
Two Mirror Trees
Level order traversal in spiral form
Lowest Common Ancestor in a BST
Level order traversal
Count BST nodes that lie in a given range
Determine if Two Trees are Identical
Convert Ternary Expression to Binary Tree
Odd even level difference
Max and min element in Binary Tree
Mirror Tree
Level of a Node in Binary Tree
Height of Binary Tree
Perfect Binary Tree
Construct Tree from Inorder & Preorder
Lowest Common Ancestor in a Binary Tree
Max sum in the configuration
Search in a Rotated Array
Stock buy and sell
Pythagorean Triplet
Kth smallest element
Maximum of all subarrays of size k
Maximum sum increasing subsequence
Sort an array of 0s, 1s and 2s
Find Indexes of a subarray with given sum
Kadane's Algorithm
Find missing in second array
Reverse a Linked List in groups of given size
Check if Tree is Isomorphic
Print leaf nodes from preorder traversal of BST
Preorder Traversal and BST
Check whether BST contains Dead End
Delete a node from BST
Pairs violating BST property
Find Common Nodes in two BSTs
Unique BST's
Find a pair with given target in BST
k-th smallest element in BST
Stickler Thief
Longest Increasing Subsequence
Sort a stack
Check if Linked List is Palindrome
Polynomial Addition
Reverse alternate nodes in Link List
Find triplets with zero sum
Remove loop in Linked List
Rearrange a linked list
Delete keys in a Linked list
Intersection Point in Y Shaped Linked Lists
Absolute List Sorting
Merge two sorted linked lists
Merge 2 sorted linked list in reverse order
Make Binary Tree From Linked List
Boundary Traversal of binary tree
Bottom View of Binary Tree
Array to BST
Rotate a Linked List
Add 1 to a number represented as linked list
Add two numbers represented by linked lists
Construct Binary Tree from Inorder and Postorder
Delete nodes greater than k
Construct expression tree
Sum Tree
Vertical Traversal of Binary Tree
Complete Binary Tree
Extreme nodes in alternate order
Connect Nodes at Same Level
Number of root to leaf paths
Diagonal Traversal of Binary Tree
Is Binary Tree Heap
Add all greater values to every node in a BST
Root to Leaf Paths
Leftmost and rightmost nodes of binary tree
Diameter of a Binary Tree
Foldable Binary Tree
Find the Closest Element in BST
Merge two BST 's
Reorder List
Fixing Two nodes of a BST
Maximum Path Sum between 2 Special Nodes