A
coder_1999
STREAK
00/1475
days
Longest streak/Global longest streak
15 points
Contributor
15 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 (3)
BASIC (44)
EASY (70)
MEDIUM (22)
HARD (2)
- SPP - BST Traversal
- Golden String
- Geek String
- Implement input/output
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- BST Keys in a Range
- Third largest element
- C++ STL | Set 2 (pair)
- Increment a variable
- SP - Second Highest
- 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
- Start Coding - Java
- The New Line - Java
- Exists or Not?
- The Loner
- Swap the array elements
- Count the Specials
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Even Subsets
- Almost Equal
- The Pattern Matcher
- 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
- Decimal to binary
- Power of 2
- Equilibrium Point
- Array Leaders
- Count number of hops
- Missing in Array
- Find the closest number
- Chocolate Distribution Problem
- Count the triplets
- Print an array in Pendulum Arrangement
- Palindrome
- Prime Number
- Factorials Less than or Equal to n
- Series GP
- Print Pattern
- Rat in a Maze Problem - I
- Count distinct elements in every window
- SP - The Pattern
- Diagonal Sum
- Pattern Printer - CPP
- Reverse array in groups
- Rearrange Array Alternately
- Stock buy and sell
- Kadane's Algorithm
- Indexes of Subarray Sum
- K Sized Subarray Maximum
- Minimum Platforms
- 0 - 1 Knapsack Problem
- Kth Smallest
- Sort 0s, 1s and 2s
- Pythagorean Triplet
- Form the Largest Number
- Sort in specific order
- Coin Change (Count Ways)
- Sieve of Eratosthenes
- Number of paths
- How Many X's?
- Rotate Array
- In new line
- Check for Binary String
- Replace all 0's with 5
- Print number pattern
- C++ STL | Set 1 (vector)
- C++ STL | Set 4 (stack)
- Search a node in BST
- Smallest divisible number
- Palindromic Array
- C++ Functions (Sum of numbers) | Set 1
- Minimum element in BST
- C++ Classes Introduction
- Alternates in an Array
- 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
- Queue Push & Pop
- Absolute Value
- Convert Celsius To Fahrenheit
- Addition Under Modulo
- First n Fibonacci
- Palindrome Array
- Value equal to index value
- Immediate Smaller Element
- Last index of One
- Rotating an Array
- Check for Power
- Even Odd Sum
- Find the fine
- LCM And GCD
- Factorial
- Sum of AP series
- Closest Number
- Series AP
- Print the Kth Digit
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