S
shristiuniyal1999
STREAK
00/1485
days
Longest streak/Global longest streak
Language Used
Java, C++
Coding Score
565
Problem Solved
255
Contest Rating
__
326 points
Contributor
326 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 (33)
EASY (121)
MEDIUM (91)
HARD (10)
- Game of Function
- Size of Binary Tree
- Count Leaves in Binary Tree
- Postorder Traversal
- Queue using Linked List
- Queue Using Array
- Replace all 0's with 5
- Preorder Traversal
- First Occurence
- Smallest divisible number
- Remainder with 7
- Minimum element in BST
- Anagram of String
- Count Non-Leaf Nodes in Tree
- Sum the common elements
- Parties and seats
- Who has the majority?
- Operations on Queue
- Number is sparse or not
- Binary To Gray Code Conversion
- Print 1 To N Without Loop
- Binary String
- Sum of Digits of a Number
- Fibonacci Using Recursion
- Missing Characters in Panagram
- First n Fibonacci
- Uncommon characters
- Swap kth elements
- Last index of One
- Jay's Apples
- Array Subset
- GCD of Array
- Binary number to decimal number
- Reverse a linked list
- Frequency in a Linked List
- Linked list of strings forms a palindrome
- Compare two linked lists
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- 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
- Left View of Binary Tree
- Transform to Sum Tree
- Find Transition Point
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Square Root
- Lowest Common Ancestor in a BST
- Binary Search
- Level Order Line by Line
- BST Keys in a Range
- Unique rows in boolean matrix
- Leaves at Same Level or Not
- Third largest element
- Convert to Roman No
- Josephus problem
- Longest Consecutive Subsequence
- Kth largest element in BST
- Special Stack
- Intersection of Two Linked Lists
- Insert in a Sorted List
- Sum of leaf nodes in BST
- Reverse Using Stack
- Full Binary Tree
- Symmetric Tree
- Count Pairs whose sum is equal to X
- Maximum Node Level
- Find length of Loop
- Reverse first K of a Queue
- Height of Spiral Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Tilt of Binary Tree
- Controlled_Printing - Java
- The Loner - Java
- Exists or Not? - Java
- Swap the array elements
- Matrix Interchange
- Count Odd Even - Java
- Need Some Change - Java
- Almost Equal -Java
- Count the Specials - Java
- Matrix Interchange - Java
- Consonants and Vowels check - Java
- Predict the Column - Java
- Xoring and Clearing - Java
- Pair in Java
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- BigInteger mod
- Java ArrayList Operation
- Reverse an Array
- Stack Operations
- Frequency in Queue
- Operations on PriorityQueue
- Frequency Game
- Duplicate Elements
- Pair Sum Existence
- Pair Sum Existence- Revisited
- Max and Second Max
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Matrix Boundary Traversal
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Anagram
- Most Frequent Character
- Minimum indexed character
- Parenthesis Checker
- Generate Binary Numbers
- Count number of hops
- First Repeating Element
- Reach a given score
- Find Immediate Smaller Than X
- Missing in Array
- Roman Number to Integer
- Search an element in sorted and rotated array
- Pizza Love
- Count number of nodes of a Complete Binary Tree
- Move All Zeroes to End
- Minimize the sum of product
- Sort Array II
- Largest Even Number
- Two Sum - Pair with Given Sum
- Longest Common Prefix of Strings
- First Repeated Character
- Print Bracket Number
- Shop in Candy Store
- Number of 1 Bits
- Element that appears once where every element occurs twice
- Maximize Toys
- Page Faults in LRU
- Find (a^b)%m
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add 1 to a Linked List Number
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Delete without head pointer
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Flattening a Linked List
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- Absolute List Sorting
- Two Stacks in an Array
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Wildcard Pattern Matching
- Check if subtree
- Validate an IP Address
- Remove loop in Linked List
- Interleaved Strings
- Count Palindromic Subsequences
- Multiply two strings
- Implement Atoi
- Palindrome Linked List
- Merge two BST 's
- Find triplets with zero sum
- Sort a stack
- k-th Smallest in BST
- Level order traversal
- Peak element
- Merge Sort for Linked List
- Union of Two Linked Lists
- Ancestors in Binary Tree
- Root to Leaf Paths
- Linked List that is Sorted Alternatingly
- Construct Tree from Inorder & Preorder
- Isomorphic Trees
- Children Sum in a Binary Tree
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Coin Change - Minimum number of coins
- Pairwise swap of nodes in Linked List
- Gray to Binary Conversion
- Wave Array
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Smallest Positive missing number
- Union of 2 Sorted Arrays
- Search in a sorted Matrix
- Postfix Evaluation
- Stock span problem
- Infix to Postfix
- K Sized Subarray Maximum
- Stickler Thief
- Ways to Reach the n'th Stair
- Egg Dropping Puzzle
- Minimum number of jumps
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Sort according to an Array
- Shortest Common Supersequence
- Rotten Oranges
- Maximize The Cut Segments
- Sum of Middle elements of two sorted arrays
- Single Among Doubles in a Sorted
- Search in Rotated Sorted Array
- Form the Largest Number
- Efficiently sorting numbers in range from 0 to n^2 - 1
- Swapping pairs make sum equal
- Form a palindrome
- Longest Common Substring
- Longest substring with distinct characters
- K-th element of two Arrays
- Modular Exponentiation
- Max Sum Increasing Subsequence
- Coin Change (Count Ways)
- Sequence of Sequence
- Sieve of Eratosthenes
- Special Keyboard
- Number of paths
- Stream First Non-repeating
- Flood fill Algorithm
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