R
riyaarora2468
STREAK
02/1489
days
Longest streak/Global longest streak
Language Used
C++, C, Java
Coding Score
457
Problem Solved
218
Contest Rating
__
272 points
Contributor
272 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 (1)
BASIC (58)
EASY (98)
MEDIUM (56)
HARD (5)
- Print Linked List
- Find Length of Linked List
- Size of Binary Tree
- Postorder Traversal
- Preorder Traversal
- Search a node in BST
- Linked List Insertion At End
- Minimum element in BST
- Circular Linked List Traversal
- Identical Linked Lists
- Insert in Middle of Linked List
- Alternates in an Array
- Who has the majority?
- Array insert at index
- Array insert at end
- Reversing an Array
- Bit Difference
- Print 1 To N Without Loop
- Array Search
- Sorted Array Search
- Sum of Digits of a Number
- Fibonacci Using Recursion
- Length of String
- Vowels in String
- Count Distinct Vowels in String
- Count Words in String
- Reverse a String
- Lowercase to Upercase
- Panagram Checking
- Missing Characters in Panagram
- First n Fibonacci
- Get Element At Index
- Maximum and Minimum In Array
- Print Linked List
- Sum The Nodes of Linked List
- Display Circular Linked List
- Length of Circular Linked List
- Find second largest element
- Palindrome Array
- Sum of Array
- Value equal to index value
- Lower case to upper case
- Largest Element in Array
- Rotate Array by One
- Min and Max in Array
- Convert String to LowerCase
- Reverse a String
- Odd or Even
- Check set bits
- XOR of all elements
- Find position of set bit
- Set kth bit
- Leap Year
- Factorial
- Reverse digits
- Sum of elements in a matrix
- Addition of two square matrices
- Max Min
- Reverse a linked list
- Node at a given index in linked list
- Delete in a Doubly Linked List
- Inorder Traversal
- Bubble Sort
- Selection Sort
- Check for BST
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of 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
- Delete Middle of Linked List
- Transform to Sum Tree
- Remove Duplicates from a Sorted Linked List
- Reverse Level Order Traversal
- Insert a node in a BST
- Identical Trees
- Root to leaf path sum
- Square Root
- Insertion at doubly linked list
- Lowest Common Ancestor in a BST
- Remove Duplicates Sorted Array
- Level Order Line by Line
- Binary Tree to BST
- Expression Tree
- Delete in a Singly Linked List
- Kth largest element in BST
- Intersection of Two Linked Lists
- Sum of leaf nodes in BST
- Counting Sort
- Max and min element in Binary Tree
- Symmetric Tree
- Median of BST
- Queue Reversal
- Reverse first K of a Queue
- Swap the array elements
- Matrix Interchange - Java
- Pair Sum Existence
- Hashing for pair - 1
- Hashing for pair - 2
- Check K-th Bit
- Mean And Median of Array
- Power of 2
- Sum of upper and lower triangles
- Print Matrix in snake Pattern
- Transpose of Matrix
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Exchange matrix columns
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Winner of an election
- Non Repeating Character
- Parenthesis Checker
- K largest elements
- Count Digits in a Number
- Factorial Using Recursion
- Uppercase to Lowercase
- First Repeating Element
- Union of Arrays with Duplicates
- Check Equal Arrays
- Positive Negative Pair
- Count Elements Greater Than X
- Count Smaller Than X
- Array Update At Index
- Array Delete And Shift
- Is Array Sorted
- Missing in Array
- Reverse The Array
- String Validation
- Intersection of Arrays with Distinct
- Non-Repeating Element
- Move All Zeroes to End
- Missing number
- Two Sum - Pair with Given Sum
- Number of occurrence
- Does array represent Heap
- Check if array is sorted
- Play With OR
- At Least K Occurrences
- Palindrome String
- Divisibility by 8
- Number of 1 Bits
- Armstrong Numbers
- Number of factors
- Palindrome
- Prime Number
- Array to BST
- Sum of k smallest elements in BST
- Introduction to Doubly Linked List
- Rotate a Linked List
- Add Number Linked Lists
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Sum Tree
- Diagonal Tree Traversal
- Tree Boundary Traversal
- LCA in Binary Tree
- Vertical Tree Traversal
- Find kth element of spiral matrix
- Linked List to Binary Tree
- Check if subtree
- Remove loop in Linked List
- Palindrome Linked List
- Closest in BST
- BST with Dead End
- Merge two BST 's
- Merge k Sorted Arrays
- 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
- Vertical sum
- Children Sum in a Binary Tree
- Find length of Loop
- Rotate Array
- Spirally traversing a matrix
- Rotate by 90 degree
- Subarray with 0 sum
- Postfix Evaluation
- Minimum Cost of ropes
- Sort according to an Array
- Rotate by 90 degree
- Top K Frequent in Array
- Single Among Doubles
- Rotate a Matrix
- k largest elements
- K closest elements
- First and Last Occurrences
- Rotate a Matrix by 180 Counterclockwise
- Kth Largest in a Stream
- Reverse Spiral Form of Matrix
- Spiral Matrix
- Maximum sum leaf to root path
- BST to greater sum tree
- Postfix to Infix Conversion
- Find the first node of loop in linked list
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