H
hemant-garg
STREAK
00/1446
days
Longest streak/Global longest streak
Language Used
C++, C
Coding Score
260
Problem Solved
168
Contest Rating
__
27 points
Contributor
27 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 (2)
BASIC (44)
EASY (93)
MEDIUM (28)
HARD (1)
- Nearest Perfect Square
- Toggle The Middle
- Geeks and the test
- Geek and the base
- Transmutation
- Sum Array
- Maximum Integer Value
- Reverse a linked list
- Inorder Traversal
- Check for BST
- 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
- Find Transition Point
- Queue using two Stacks
- Stack using two queues
- Level Order in spiral form
- Identical Trees
- Level Order Line by Line
- Third largest element
- Max Level Sum in Binary Tree
- Level order traversal
- The New Line
- Controlled_Printing
- Coding with Operators
- Bridge of Stones
- Data Types
- Taking input
- Learn to Comment
- GetLine and Ignore
- Learning to be precise
- Bitwise Operators
- Even Odd
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Exists or Not?
- The Loner
- Swap the array elements
- Count the Specials
- Matrix Interchange
- Predict the Column
- Swap values using References
- Swap the objects
- Structs and Objects
- Two Dimensional World
- Learning Structs
- Delete Array
- Cover the distance
- Play With Vectors
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Student of the Year
- Get min at pop
- Deque Implementations
- Min Heap implementation
- Strings Frequency
- Multiset Operations
- Multimap Operations
- Max and Second Max
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Power of 2
- Swap odd and even bits
- Minimum adjacent difference in a circular array
- Wave Array
- Equilibrium Point
- Array Leaders
- Transpose of Matrix
- Reversing the columns of a Matrix
- Matrix Boundary Traversal
- Exchange matrix columns
- Parenthesis Checker
- Missing in Array
- Product array puzzle
- Adding Ones
- Search in a Row-Column sorted matrix
- Largest Fibonacci Subsequence
- Min Manipulations to make Strings Anagram
- Count the Zeros
- Armstrong Numbers
- Count digits in a factorial
- Mean and Median
- Area Manipulation
- Series GP
- Interchanging the rows of a Matrix
- Sum of dependencies in a graph
- The Conversion To One
- Geek and the lockers
- Rotate a Linked List
- Detect Loop in linked list
- Get Min from Stack
- Remove loop in Linked List
- Palindrome Linked List
- Children Sum in a Binary Tree
- Diagonal Sum
- Pattern Printer - CPP
- Count set bits
- Maximum occured integer
- Rearrange Array Alternately
- Stock buy and sell
- Kadane's Algorithm
- Indexes of Subarray Sum
- Boolean Matrix
- Spirally traversing a matrix
- Next Greater Element
- Kth smallest element
- Minimum Platforms
- Ways to Reach the n'th Stair
- Sort 0s, 1s and 2s
- 3 Divisors
- Stream First Non-repeating
- Game of Powers
- Number of possible squares
- IPL 2021 - Match Day 2
- Rotate Array
- Geek and the equation
- Check for Binary String
- Postorder Traversal
- Preorder Traversal
- Peak element
- Start Coding
- The Size of
- Logical Operators
- Count Odd and Even
- Filter the weeds
- Volume of Cuboid
- Vector Common Elements
- Sort and Reverse Vector
- Front to Back
- Stack and Queue Operations
- Stack designer
- Banish the Commons
- Queue Push & Pop
- Set Operations
- Map Operations
- Who has the majority?
- Array insert at index
- Array insert at end
- Reversing an Array
- Bit Difference
- Array Search
- Sorted Array Search
- Immediate Smaller Element
- Last duplicate element in a sorted array
- Rotating an Array
- Multiply left and right array sum
- Perfect Square String
- LCM And GCD
- Celsius to Fahrenheit Conversion
- Factorial
- Sum of Digit is Palindrome or not
- Difference series
- Binary number to decimal number
- Prime Number
- Series AP
- Print the Kth Digit
- Pairs of prime number
- Roots of Quadratic Equation
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