- Size of Binary Tree
- Count Non-Leaf Nodes in Tree
- Height of Binary Tree
- Prime Number
- GCD of Array
- Repetitive Addition Of Digits
- Strong Number
- Doubling the value
- Shortest path from 1 to n
- Missing number in array
- Frobenius coin problem
- Number of occurrence
- Ways To Tile A Floor
- Find first and last occurrence of x
- Sum of dependencies in a graph
- Long Long Decimal
- Find the element that appears once in sorted array
- Last index of One
- Check whether K-th bit is set or not
- Extract Maximum
- Total digits
- Elements in the Range
- Print first n Fibonacci Numbers
- Check perfect square
- GCD, LCM and Distributive Property
- Print Matrix in snake Pattern
- Change all even bits in a number to 0
- Carol Number
- XOR Count Zero and One
- Make the hit in power game !
- First and last Bit
- Minimum product pair
- Product of factors of number
- Smallest K digit number divisible by X
- One's Complement
- Make Co-prime Array
- Making elements distinct
- Ishaan's Internship
- Number Series
- Difference series
- Reducing Walls
- Gray to Binary equivalent
- Maximum Perimeter of Triangle from array

Name

Pranchal Katiyar

Rank in Institute

#1

Courses Attended

Campus Ambassador

Overall Coding Score: 1348

Monthly Coding Score: 0

Weekly Coding Score: 0

- Lowest Common Ancestor in a Binary Tree
- Sum of Leaf Nodes
- Longest Consecutive Subsequence
- Leaf at same level
- Odd even level difference
- Minimum Depth of a Binary Tree
- Max Level Sum in Binary Tree
- Lowest Common Ancestor in a BST
- Root to leaf paths sum
- Determine if Two Trees are Identical
- Level order traversal
- BFS of graph
- Height of Spiral Tree
- Maximum path sum
- DFS of Graph
- Level order traversal in spiral form
- Full binary tree
- Diameter of Binary Tree
- Mirror Tree
- Remove Half Nodes
- Number of Unique Paths
- Print Pattern
- Rectangles in N*N Board
- Squares in N*N Chessboard
- Palindrome numbers
- Magic Number
- Maximize Toys
- Trailing zeroes in factorial
- Minimum number of Coins
- Forming Rectangle
- Activity Selection
- Spirally traversing a matrix
- Maximum value in a bitonic array
- Next greater number set digits
- Finding Position
- Next sparse binary number
- Segregate even and odd nodes in a Linked List
- Element that appears once where every element occurs twice
- Count distinct pairs with difference k
- Replace by X
- Column name from a given column number
- N meetings in one room
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Triangular Number
- Make Number Odd
- Add Binary Strings
- Product array puzzle
- Multiply two polynomials
- Reverse Bits
- Lucky Number
- Swap bits
- Reach the Nth point
- Count numbers
- Swap all odd and even bits
- Max rope cutting
- Count number of hops
- Increment
- AND operation
- Copy Set Bits in Range
- Triplet Sum in Array
- Reach a given score
- Minimum element in a sorted and rotated array
- Search in a matrix
- Maximum Collatz sequence length
- Day of the week
- Largest power of prime
- Chinky and diamonds
- Shop in Candy Store
- Largest number possible
- Pick values
- Missing element of AP
- Count the Zeros
- 0 - 1 Knapsack Problem
- Trail of ones
- The Prime Twins
- Find the number of sub-arrays having even sum
- Skip the work
- Valid Substring
- Number of ways to find two numbers
- Maximize The Cut Segments
- Number of distinct subsequences
- Game of Death in a circle
- Ball coloring
- Perfect Numbers
- Change Bits
- Maximum value
- Largest number with given sum
- The Nth Fibonnaci
- Permutation with Spaces
- Element appearing once
- Floor in a Sorted Array
- Finding Profession
- Maximize Dot Product
- Letter Writer
- Finding the numbers
- Optimal walk
- Count Increasing Subsequences
- Least Prime Factor
- Collecting Trees
- Happy Number
- Time Difference
- Adding Ones
- Lucas Number
- Pairs with specific difference
- Deficient Number
- Mr. Binary
- Minimum Steps
- Maximum 0’s between two immediate 1’s
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Make Zeroes
- Find sum of divisors
- Smallest factorial number
- Last non-zero digit in factorial
- Reverse Coding
- Flood fill Algorithm
- Longest K unique characters substring
- Maximum no of 1's row
- Friends Pairing Problem
- Decode the string
- Gold Mine Problem
- Game of XOR
- Find Nth root of M
- Learn Geometry
- Love For The Twins
- Recaman’s sequence
- Minimum Operations
- Find all pairs with a given sum
- Temple Offerings
- Find the string in grid
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- Recursive sequence
- Rod Cutting
- Transitive closure of a Graph
- Array Subset of another array
- Count the paths
- Paths to reach origin
- Get Minimum Squares
- Group Anagrams Together
- Sum equals to Sum
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Assign Mice Holes
- Nth number made of prime digits
- Minimum Number in a sorted rotated array
- Euler Totient Function
- Number of Groups
- Number and the Digit Sum
- Count the number of ways to tile the floor of size n x m using 1 x m size tiles
- Break a number
- Minimum insertions to sort an array
- Minimum number of deletions and insertions.
- Minimum number of deletions to make a sorted sequence
- Minimum steps to delete a string
- Minimum steps to minimize n as per given condition
- Minimum number of deletions.
- Longest alternating subsequence
- Ways to sum to N
- Subset with sum divisible by m
- Count of strings that can be formed using a, b and c under given constraints
- Number of subsequences in a string divisible by n
- Broken blocks
- Find length of longest subsequence
- Ways to write n as sum
- Find all distinct subset (or subsequence) sums
- Longest subsequence-1
- Maximum sum Problem
- Minimum indexed character
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- Printing Maximum Sum Increasing Subsequence
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Maximum weight transformation of a given string
- Total number of non-decreasing numbers with n digits
- Minimum Swaps for Bracket Balancing
- Maximum Product Cutting
- Find the most frequent digit
- Compute nCr % p
- Find smallest values of x and y such that ax – by = 0
- Compute (a*b)%c
- Find maximum number
- Even Fibonacci Numbers Sum
- N’th Pentagonal Number
- Smallest number by rearranging digits of a given number
- Power Of 2 and Subsequences
- Maximum possible sum
- Primorial of a number
- Mersenne Prime
- K-Ary Tree
- Completing tasks
- Chicks in a Zoo
- Check if a Integer is power of 8 or not
- Geek and its Game of Coins
- Maximize XOR
- Remove minimum number of elements
- Check if divisible by 10
- Pairs with Positive Negative values
- Maximum prefix sum for a given range
- Count the pairs with maximum difference
- Numbers containing 1, 2 and 3
- Number of subarrays whose minimum and maximum are same
- Pairs with Difference less than K
- Find k-th missing element
- Woodall Number
- Incomplete Array
- Sum Indexes
- Three Number Even Sum
- GeeksforGeeks New System
- Equal Sums
- Maximum number of characters between any two same character
- Cumulative frequency of count of each element in an unsorted array
- Minimum element whose N-th power is greater than product of an array
- Next Happy Number
- Summed Matrix
- Fact Digit Sum
- Non-Repeating Element
- Last seen array element
- Count numbers which can be constructed using two numbers
- Find the maximum number of handshakes
- Nth character in Concatenated Decimal String
- Find if string is K-Palindrome or not
- Check if possible to move from given coordinate to desired coordinate
- Maximum AND Value
- Trisha's Number
- Count unset bits in a given Range
- Rearrange array such that even positioned are greater than odd
- Find winner of the Game of Nim
- Smallest subarray with all occurrences of a most frequent element
- Maximum distinct elements after removing K elements
- Maximum difference of zeros and ones in binary string
- Arya and The Great War
- Mystic Falls School
- Reorganize The Array
- Form a number divisible by 3 using array digits
- Check if array contains contiguous integers with duplicates allowed
- Rearrange an array such that arr[i] = i
- Cosmic Number
- Maximum height of the staircase
- Extra Perfect Numbers
- Rope Cutting
- Ease the Array
- Amicable Pair
- Count ways to express N as the sum of 1,3 and 4
- Counts Zeros Xor Pairs
- Count pairs Sum in matrices
- Swap every two bits in bytes
- Print Binary Tree levels in sorted order
- Convert a sentence into its equivalent mobile numeric keypad sequence
- Check if a number is divisible by 8
- XOR of two numbers after making length of their binary representations equal
- Hungry Pizza Lovers
- Ishaan and Sticks
- Akaash's Assignment
- Common Divisor
- The Inverting Factor
- Print all bitwise subsets of a number N
- Maximum sum of increasing order elements from n arrays
- Ishaan's Curiosity
- Charul and vessels
- Surround the 1's
- The Buggy Robot
- Print binomial expansion series
- The Optimal Selection
- Check if any valid sequence is divisible by M
- Variation in Nim Game
- Smallest number with sum of digits as N and divisible by 10^N
- Reaching the heights
- Lucky Ishaan
- Eulerian Path in an Undirected Graph
- Minimal moves to form a string
- Connell Sequence
- Ordered Prime Signature
- Penalty Shooters
- Are you "Perfect"
- Print adjacency list

- Top View of Binary Tree
- Find the number of islands
- Find the Closest Element in BST
- Foldable Binary Tree
- Number of root to leaf paths
- Minimum Swaps to Sort
- Minimum Spanning Tree
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Clone a Binary Tree
- Extreme nodes in alternate order
- Topological sort
- Maximum difference between node and its ancestor
- Detect cycle in an undirected graph
- Detect cycle in a directed graph
- Delete a node from BST
- Boundary Traversal of binary tree
- Add all greater values to every node in a BST
- Count Number of SubTrees having given Sum
- Count BST nodes that lie in a given range
- Coin Change
- Kadane's Algorithm
- Maximum Index
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Edit Distance
- nCr
- Min Coin
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Case-specific Sorting of Strings
- Rank of Matrix
- Sum of bit differences
- Maximize The Array
- Number of Coins
- Find Prime numbers in a range
- Number of paths in a matrix with k coins
- Possible words from Phone digits
- Jumping Numbers
- Rearrange an array with O(1) extra space
- Relative Sorting
- Largest square formed in a matrix
- Count Integral Points
- Sorting Elements of an Array by Frequency
- Special Keyboard
- Number of ways
- Power of Largest Prime
- Sum of Query II
- Form a palindrome
- Preorder to Postorder
- Longest consecutive subsequence
- Largest subsquare surrounded by ‘X’
- Convert an array to reduced form
- Minimum steps to get desired array
- Dimensions of Rectangle
- Handshakes
- Palindromic Array
- Unique partitions
- Is Binary Number Multiple of 3
- Preorder Traversal and BST
- Longest Arithmetic Progression
- Jumbled Strings
- Palindromic Strings
- Bleak Numbers
- Crazy Equations
- Product of Primes
- Maximum Profit
- Digit multiplier
- Circle of strings
- Queries on Strings
- Special Matrix
- Composite and Prime
- Taking 1 out of 3 consecutives
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Combination Sum
- Count Divisors of Factorial
- Maximum calorie
- Prime Factors and their Powers
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Rotate and delete
- Hamiltonian Path
- Sonam Bewafa asks questions
- Mathematical manipulation
- Snake and Ladder Problem
- Tricky Subset Problem
- Shortest Source to Destination Path
- Number of Palindromic paths in a Matrix
- Replace O's with X's
- Knight Walk
- Word Boggle
- Form coils in a matrix
- Max absolute difference
- Print leaf nodes from preorder traversal of BST
- Distance of nearest cell having 1
- Is Sudoku Valid
- Find whether path exist
- Largest prime factor
- Unit Area of largest region of 1's
- Express as sum of power of natural numbers
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- Count in array
- Water Overflow
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- James Bond and Divisors
- Floyd Warshall
- Largest Sum Subarray of Size at least K
- Longest Bitonic subsequence
- Mobile numeric keypad
- Reverse Spiral Form of Matrix
- Pyramid form
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Minimum Time
- Perfect Sum Problem
- Job Sequencing Problem
- Number of palindromic strings
- Min cut Square
- N Digit numbers with digits in increasing order
- Prime factorization and geek number
- Modify array to maximize sum of adjacent differences
- Probability of Knight
- LCS of three strings
- Two water Jug problem
- Longest repeating and non-overlapping substring
- Minimum cost to fill given weight in a bag
- Count even length
- Numbers with alternative 1's
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Count divisors of product of array elements
- Print N-bit binary numbers having more 1’s than 0’s
- Longest subarray with sum divisible by K
- Subarrays with equal 1s and 0s
- Make Matrix Beautiful
- Longest Sub-Array with Sum K
- The Fibonacci-prime number
- Sum of XOR of all pairs
- Marks of PCM
- Container with most water
- The Painter's Partition Problem
- Aditya and his building blocks
- Minimum swaps and K together
- Large Factorials
- Lucky alive person in a circle
- Construct binary palindrome by repeated appending and trimming

- QuickSort on Doubly Linked List
- AVL Tree Deletion
- AVL Tree Insertion
- Reorder List
- Binary Tree to DLL
- Find sum of different corresponding bits for all pairs
- Return two prime numbers
- Largest rectangle of 1’s with swapping of columns allowed
- Rohan's Love for Matrix
- Longest valid Parentheses
- Word Break - Part 2
- Minimum Cost Path
- Travelling Salesman Problem
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array