- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Postorder Traversal
- Square root
- Preorder Traversal
- Search a node in BST
- Equal Sum and XOR
- Find Number of Numbers
- Minimum distance between two numbers
- Find triplets with zero sum
- Minimum element in BST
- Queue Reversal
- Sum of Binary Tree
- Count Non-Leaf Nodes in Tree
- Stack designer
- Repetitive Addition Of Digits
- Power of 2
- Sort The Array
- Nth Fibonacci Number
- Strong Number
- Shortest path from 1 to n
- Rotate Array
- Missing number in array
- Count total set bits
- Count numbers containing 4
- Immediate Smaller Element
- Sum of distinct elements
- k largest elements
- Maximum money
- Ways To Tile A Floor
- Rotating an Array
- Pairs with given XOR
- Padovan Sequence
- Sum of dependencies in a graph
- Check if two arrays are equal or not
- Check for subsequence
- Geek and Coffee Shop
- Does array represent Heap
- Find the element that appears once in sorted array
- Check whether K-th bit is set or not
- Extract Maximum
- Uncommon characters
- Find minimum and maximum element in an array
- URLify a given string
- Smallest power of 2 greater than or equal to n
- Pair array product sum
- Equivalent Sub-Arrays
- Max Sum Subarray of size K
- Set kth bit
- Print first n Fibonacci Numbers
- Remove repeated digits in a given number
- Check perfect square
- Anagram Palindrome
- Repeated Character
- Merge two strings
- Sort String
- Find the fine
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Ishaan Loves Chocolates
- Find The Sequence
- Height of Heap
- Average Count Array

Name

Rahul Kumar

Rank in Institute

#18

Courses Attended

Campus Ambassador

Overall Coding Score: 1387

Monthly Coding Score: 216

Weekly Coding Score: 0

- Merge 2 sorted linked list in reverse order
- Insertion Sort
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Left View of Binary Tree
- Sum Tree
- Find Transition Point
- Queue using two Stacks
- Stack using two queues
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Determine if Two Trees are Identical
- Root to leaf path sum
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Minimum Depth of a Binary Tree
- Odd even level difference
- Almost Prime Numbers
- K-Palindrome
- Max sum in the configuration
- Equilibrium index of an array
- Leaf at same level
- Is Binary Tree Heap
- Match specific pattern
- Find Maximum value
- Josephus problem
- Expression Tree
- Max distance between same elements
- Longest Consecutive Subsequence
- Kth largest element in BST
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Root to leaf paths sum
- Three way partitioning
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Index Of an Extra Element
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Counting Sort
- Max and min element in Binary Tree
- Counting elements in two arrays
- Reverse a string using Stack
- Full binary tree
- Symmetric Tree
- Vertical sum
- Check if Tree is Isomorphic
- Depth of node
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Closest Neighbor in BST
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Need Some Change
- Matrix Interchange
- Predict the Column
- Matrix Interchange - Java
- Predict the Column - Java
- ArrayList Operation
- Operations on ArrayList
- Mother Vertex
- Union of Two Sorted Arrays
- Print adjacency list
- Subarray with 0 sum
- Winner of an election
- Minimum indexed character
- Minimum indexed character
- Frequencies of Limited Range Array Elements
- Number of Unique Paths
- Wave Array
- Print Pattern
- Rotation
- Rectangles in N*N Board
- Squares in N*N Chessboard
- Palindrome numbers
- Maximize Toys
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Good Pairs
- First Repeating Element
- Count Occurences of Anagrams
- Reverse words in a given string
- Move all zeroes to end of array
- Remove all duplicates from a given string
- Activity Selection
- Equal Sum and Product
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Maximum value in a bitonic array
- Next greater number set digits
- Finding Position
- Single Number
- Count increasing Subarrays
- Element that appears once where every element occurs twice
- Replace by X
- N meetings in one room
- Addition of submatrix
- Maximum sum increasing subsequence
- Facing the sun
- Triangular Number
- Key Pair
- Maximum Difference
- Product array puzzle
- Reverse Bits
- Count Smaller elements
- Reach the Nth point
- Subarray with given sum
- Count numbers
- Leaders in an array
- Count number of hops
- Count pairs with given sum
- Inorder Traversal and BST
- Segregate 0s and 1s
- Two Repeated Elements
- Reach a given score
- Minimum element in a sorted and rotated array
- Fibonacci Sum
- Day of the week
- Largest power of prime
- Shop in Candy Store
- Largest number possible
- Missing element of AP
- Count the Zeros
- Distinct absolute array elements
- 0 - 1 Knapsack Problem
- Find the number of sub-arrays having even sum
- Valid Substring
- Number of ways to find two numbers
- Cutted Segments
- Minimum number of swaps needed
- Game of Death in a circle
- Help Mommy out
- Power of Numbers
- Arithmetic Number
- Left out candies
- Largest number with given sum
- Element appearing once
- Floor in a Sorted Array
- Buildings receiving sunlight
- Finding Profession
- Sort by Set Bit Count
- Count Increasing Subsequences
- Equal 0, 1 and 2
- Adding Ones
- Lucas Number
- Largest Even Number
- Count Pairs in an Array
- Min sum formed by digits
- Min Subsets with Consecutive Numbers
- Chocolate Distribution Problem
- Maximum Sum Bitonic Subsequence
- Smallest factorial number
- Last non-zero digit in factorial
- Reverse Coding
- Flood fill Algorithm
- Maximum no of 1's row
- Friends Pairing Problem
- Decode the string
- Gold Mine Problem
- Smallest subarray with sum greater than x
- Rahul a Geek
- Love For The Twins
- Sum of all substrings of a number
- Recamanâ€™s sequence
- Minimum Operations
- Find all pairs with a given sum
- Largest Fibonacci Subsequence
- Increasing Sub Sequence
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Maximum difference Indexes
- Count subsets having distinct even numbers
- Common elements
- Recursive sequence
- Rod Cutting
- Efficiently sorting numbers in range from 0 to n^2 - 1
- Sequence of Sequence
- Element in a Series
- Array Subset of another array
- First negative integer in every window of size k
- Paths to reach origin
- Subarray with 0 sum
- Faulty wiring and Bulbs
- Nth catalan number
- Subarrays with given sum
- Group Anagrams Together
- Find Pair Given Difference
- Count the elements
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Sort the given array after applying the given equation
- k sorted array
- Assign Mice Holes
- Happiest Triplet
- Find pairs with given relation
- Mr Modulo and Pairs
- Painting the Fence
- Minimum Number in a sorted rotated array
- Find distinct elements
- Sort by Absolute Difference
- Toppers Of Class
- Minimum insertions to sort an array
- Minimum number of deletions and insertions.
- Minimum number of deletions to make a sorted sequence
- Minimum number of deletions.
- Closest Strings
- Subset with sum divisible by m
- Count of strings that can be formed using a, b and c under given constraints
- Nth item through sum
- Ways to write n as sum
- Longest subsequence-1
- Sum of average of all subsets
- Maximum sum Problem
- Minimum indexed character
- Minimum Cost To Make Two Strings Identical
- Find the most frequent digit
- Compute (a*b)%c
- Merging two unsorted arrays in sorted order
- Winter is Coming
- Sum of Lengths of Non-Overlapping SubArrays
- Sort the way !
- Minimum rotations to unlock a circular lock
- Numbers containing 1, 2 and 3
- Cumulative frequency of count of each element in an unsorted array
- Non-Repeating Element
- Last seen array element
- Find if string is K-Palindrome or not
- Roof Top
- Pairs which are Divisible by 4
- Find winner of the Game of Nim
- 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
- Maximum height of the staircase
- Winner of an election
- Rope Cutting
- Count ways to express N as the sum of 1,3 and 4
- Counts Zeros Xor Pairs
- Check if a number is divisible by 8
- Hungry Pizza Lovers
- Ishaan and Sticks
- Find the closest pair from two arrays
- Maximum sum of increasing order elements from n arrays
- Longest substring with equal number of 0s and 1s
- Print Bracket Number
- Searching in an array where adjacent differ by at most k
- The Optimal Selection
- Sorting all array elements except one
- Smallest number with sum of digits as N and divisible by 10^N
- Reaching the heights
- Smallest greater elements in whole array
- Fitting The Array
- Print adjacency list

- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Add all greater values to every node in a BST
- Connect Nodes at Same Level
- Diagonal Traversal of Binary Tree
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- Print a Binary Tree in Vertical Order
- Find the number of islands
- Check if subtree
- Kth element in Matrix
- Max length chain
- Interleaved Strings
- Box Stacking
- Minimum Swaps to Sort
- Bipartite Graph
- Number of root to leaf paths
- Find the Closest Element in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Print Nodes having K leaves
- Top View of Binary Tree
- k-th smallest element in BST
- Find a pair with given target in BST
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Pairs violating BST property
- Largest Independent Set Problem
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- C++ Generic sort
- Smallest Positive missing number
- Unique BST's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Count ways to N'th Stair(Order does not matter)
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Sub Array
- Equal Sum
- Longest Increasing Subsequence
- Parenthesis Checker
- 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)
- Edit Distance
- nCr
- Min Coin
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Trapping Rain Water
- Case-specific Sorting of Strings
- Sum of bit differences
- Subset Sum Problem
- Factorials of large numbers
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Smallest number on left
- Longest consecutive subsequence
- Stock span problem
- Convert an array to reduced form
- Minimum steps to get desired array
- Dimensions of Rectangle
- Handshakes
- Number to words
- Palindromic Array
- Is Binary Number Multiple of 3
- Longest Arithmetic Progression
- Subsets with XOR value
- Max possible amount
- Bleak Numbers
- Super Primes
- Number of pairs
- Maximum XOR subset
- Maximum Profit
- Special Matrix
- Next larger element
- Unique BST's
- Distinct Transformations
- Matchsticks game
- Kth smallest element
- Divisible by 8
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Check if a string is repetition of its substring of k-length
- Recursively remove all adjacent duplicates
- Replace O's with X's
- Find all four sum numbers
- Max absolute difference
- Print leaf nodes from preorder traversal of BST
- Distance of nearest cell having 1
- Is Sudoku Valid
- Find whether path exist
- Rearrange characters
- 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
- Zero Sum Subarrays
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Floyd Warshall
- Nearly Sorted Algorithm
- Smallest Positive missing number
- Longest Bitonic subsequence
- Maximum Intervals Overlap
- Perfect Sum Problem
- Longest Path in a matrix
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Number of palindromic strings
- Rotten Oranges
- Minimum cost to fill given weight in a bag
- Count even length
- Median In a Row-Wise sorted Matrix
- In First But Second
- Row with minimum number of 1's
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K
- Marks of PCM
- Container with most water
- The Painter's Partition Problem
- Optimal Strategy For A Game

- Reorder List
- Binary Tree to DLL
- Maximum subset XOR
- Alien Dictionary
- Minimum Points To Reach Destination
- Minimum sum partition
- Merge Without Extra Space
- Next Smallest Palindrome
- Find sum of different corresponding bits for all pairs
- Return two prime numbers
- Allocate minimum number of pages
- A Simple Fraction
- Ugly Numbers
- Create your own Calculator
- nCr mod M | Part 1
- Longest valid Parentheses
- Word Break - Part 2
- Minimum Cost Path
- Generalised Fibonacci numbers
- Distinct palindromic substrings
- Convert to Strictly increasing array
- Count the subarrays having product less than k
- Closest Palindrome