- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
hritikgupta7080
STREAK
00/1426
days
Longest streak/Global longest streak
Language Used
Python, C++, Java
Coding Score
552
Problem Solved
222
Contest Rating
__
229 points
Contributor
229 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 (31)
EASY (92)
MEDIUM (89)
HARD (10)
- Count Linked List Nodes
- Doubly linked list Insertion at given position
- First Occurence
- Search a node in BST
- Peak element
- Linked List Insertion At End
- Minimum element in BST
- Identical Linked Lists
- Insert in Middle of Linked List
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Bit Difference
- Number is sparse or not
- Binary To Gray Code equivalent
- Print 1 To N Without Loop
- Left Index
- Binary Array Sorting
- Adding two matrices
- Multiply the matrices
- Check if a string is Isogram or not
- Binary String
- Most Frequent Character
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Keypad typing
- Nearest Perfect Square
- A Boolean Matrix Problem
- Toggle The Middle
- K Sum
- XOR Pair
- Triangle and Square
- M and N
- Satisfy the condition
- Reverse a linked list
- Remove duplicates from an unsorted linked list
- Bubble Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Delete without head pointer
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Left View of Binary Tree
- Remove Duplicates from a Sorted Linked List
- Level Order in spiral form
- Insert a node in a BST
- Identical Trees
- Square Root
- Lowest Common Ancestor in a BST
- Level Order Line by Line
- BST Keys in a Range
- Three way partitioning
- Level order traversal
- More than n/k Occurrences
- Counting Sort
- Find length of Loop
- Sum of Leaf Nodes
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Inorder traversal of a BST
- Levelorder traversal of a BST
- First Set Bit
- Rightmost different bit
- K-th Bit is Set or Not
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Mean And Median of Array
- Modular Inverse
- Power of 2
- Swap all odd and even bits
- Minimum adjacent difference in a circular array
- Wave Array
- Frequencies in a Limited Array
- Equilibrium Point
- Array Leaders
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Roof Top
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Sum of upper and lower triangles
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Exchange matrix columns
- Naive Pattern Search
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Winner of an election
- Strings Rotations of Each Other
- Isomorphic Strings
- The Modified String
- Reverse Words
- Minimum indexed character
- Panagram Checking
- Non Repeating Character
- Count Total Digits in a Number
- Digital Root
- First Repeating Element
- Union of Arrays with Duplicates
- Check Equal Arrays
- Nth number made of prime digits
- Numbers containing 1, 2 and 3
- Intersection of Arrays with Distinct
- K-Pangrams
- Smaller on Right
- The Conversion To One
- Get the Shadow
- Without Adjacent
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Delete a node from BST
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Vertical Tree Traversal
- Merge K sorted linked lists
- Serialize and deserialize a binary tree
- Linked List to Binary Tree
- Check if subtree
- Remove loop in Linked List
- Palindrome Linked List
- Closest in BST
- Merge two BST 's
- Top View of Binary Tree
- Find Common Nodes in two BSTs
- Merge Sort for Linked List
- Binary Tree to CDLL
- Foldable Binary Tree
- Count the nodes at distance K from leaf
- Maximum path sum from any node
- Children Sum in a Binary Tree
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Vertical Width of a Binary Tree
- Pairwise swap of nodes in LinkedList
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Rabin Karp - Pattern Searching
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Smallest Positive Missing
- Possible Words From Phone Digits
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Stock buy and sell
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Count the number of possible triangles
- Triplet Sum in Array
- Number of pairs
- Merge Without Extra Space
- Merge three sorted arrays
- Closer to sort
- Make Matrix Beautiful
- Boolean Matrix
- Spirally traversing a matrix
- Search in a sorted Matrix
- Determinant of a Matrix
- Subarray with 0 sum
- Subarrays with equal 1s and 0s
- Sort Elements by Decreasing Frequency
- Longest Consecutive Subsequence
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- Kth smallest element
- Rearrange characters
- Minimum Platforms
- Rat Maze With Multiple Jumps
- Black and White
- Sort according to an Array
- Allocate Minimum Pages
- Zero Sum Subarrays
- Kth Smallest
- Count only Repeated
- Maximum Water Between Two Buildings
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