M
manishkrjha
STREAK
02/1473
days
Longest streak/Global longest streak
Language Used
C++, C
Coding Score
344
Problem Solved
165
Contest Rating
__
76 points
Contributor
76 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 (38)
EASY (69)
MEDIUM (54)
HARD (4)
- Check for BST
- Mirror Tree
- Height of Binary Tree
- Kth from End of Linked List
- Left View of Binary Tree
- Transform to Sum Tree
- Queue using two Stacks
- Reverse Level Order Traversal
- DFS of Graph
- Stack using Linked List
- Implement stack using array
- BFS of graph
- Root to leaf path sum
- Run Length Encoding
- Multiply two linked lists
- Special Stack
- Increment a variable
- Perfect Binary Tree
- Reverse Using Stack
- Construct BST from Postorder
- Linked List Matrix
- The New Line
- 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
- Swap the array elements
- Count the Specials
- Matrix Interchange
- Predict the Column
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Power of 2
- Minimum Cost of ropes
- N meetings in one room
- Search an element in sorted and rotated array
- k sorted array
- Drive the car
- Next Greater Even Number
- Two Sum - Pair with Given Sum
- Two sum -Pairs with 0 Sum
- Print an array in Pendulum Arrangement
- Palindrome String
- Max Sum Subarray of size K
- Count Digits
- Powers game
- Carol Numbers
- Kth Prime Factor
- Find (a^b)%m
- Geometric Progression
- Least Prime Factor
- Sixy Primes
- Arithmetic Number
- Prime number of set bits
- Primes sum
- Merge Sort
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Merge two sorted linked lists
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- Largest subarray with 0 sum
- Topological sort
- Get Min from Stack
- Interleaved Strings
- Sorted subsequence of size 3
- Rat in a Maze Problem - I
- Bipartite Graph
- Top View of Binary Tree
- ZigZag Tree Traversal
- Wave Array
- Kadane's Algorithm
- Fractional Knapsack
- Egg Dropping Puzzle
- 0 - 1 Knapsack Problem
- Kth Smallest
- Shortest Common Supersequence
- Count Occurences of Anagrams
- Search in Rotated Sorted Array
- Count pairs Sum in matrices
- Max value after m range operation
- Form a palindrome
- Max Sum without Adjacents
- Longest Common Substring
- Longest Substring with K Uniques
- K-th element of two Arrays
- Rod Cutting
- Number of pairs
- First negative in every window of size k
- Transform to prime
- Minimum number of deletions
- Unique Number II
- Largest prime factor
- Minimum number of deletions and insertions
- Coin Change (Count Ways)
- Sieve of Eratosthenes
- Coin Change (Minimum Coins)
- Knapsack with Duplicate Items
- Partition Equal Subset Sum
- Digit multiplier
- Subset Sums
- Next Permutation
- How Many X's?
- Longest Repeating Subsequence
- Subset Sum Problem
- Rank The Permutations
- Target Sum
- Concatenate Equal to Target
- Multiply Matrices
- Modular Node
- Sum of Binary Tree
- Start Coding
- The Size of
- Logical Operators
- Count Odd and Even
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Bit Difference
- Number is sparse or not
- Addition Under Modulo
- Multiplication Under Modulo
- C++ Hello World
- Multiply Array
- Sum of Array
- Print Elements of Array
- At least two greater elements
- Value equal to index value
- Swap kth elements
- Display longest name
- Minimize string value
- C++ Input / Output
- Check if divisible by 5
- Median of an Array
- Factorial
- Power of Pow | Even Number
- Power of Pow | Odd Numbers
- Remainder Evaluation
- Matching Pair
- 12 hour clock Multiplication
- 12 hour clock addition
- 12 hour clock subtraction
- Modulus of two double numbers
- The Modulo Task
- Sophie Germain Prime
- Sorted matrix
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