Name

Abhigyan Bharati

Rank in Institute

#92

Courses Attended

Campus Ambassador

Overall Coding Score: 698

Monthly Coding Score: 343

Weekly Coding Score: 2

- Repetitive Addition Of Digits
- Nth Fibonacci Number
- Rotate Array
- k largest elements
- Rotating an Array
- Minimize the sum of product
- Does array represent Heap
- Minimum move to front operations
- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Linked List Insertion
- Circular Linked List Traversal
- Delete Alternate Nodes

- Distinct Substrings
- Count Occurences of Anagrams
- N meetings in one room
- Maximum sum increasing subsequence
- Array to BST
- Max Sum without Adjacents
- Adjacents are not allowed
- Count number of hops
- Inorder Traversal and BST
- Two Repeated Elements
- Reach a given score
- K-Pangrams
- 0 - 1 Knapsack Problem
- Cutted Segments
- Smallest number subset
- Game of Death in a circle
- Pairs with specific difference
- Sum of elements between k1'th and k2'th smallest elements
- Min sum formed by digits
- String Manipulation
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Sum of k smallest elements in BST
- Drive the car
- Friends Pairing Problem
- Gold Mine Problem
- Sum of all substrings of a number
- Common elements
- Rod Cutting
- Sequence of Sequence
- Merge two binary Max heaps
- Paths to reach origin
- Nth catalan number
- Group Anagrams Together
- Count all possible paths from top left to bottom right
- Painting the Fence
- Sort by Absolute Difference
- Count the number of ways to tile the floor of size n x m using 1 x m size tiles
- Minimum steps to minimize n as per given condition
- Jumping Caterpillars
- Ways to sum to N
- Subset with sum divisible by m
- Longest subsequence-1
- Maximum sum Problem
- Longest Repeating Subsequence
- Stickler Thief
- Maximum distinct elements after removing K elements
- Reorganize The Array
- The Optimal Selection
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Split a Circular Linked List into two halves
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Remove duplicate element from sorted Linked List
- Reverse Level Order Traversal
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- 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
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Print BST elements in given range
- Odd even level difference
- Binary Tree to BST
- Unique rows in boolean matrix
- Leaf at same level
- Find Maximum value
- Multiply two linked lists
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Delete a Node in Single Linked List
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Three way partitioning
- Sort a stack
- Level order traversal
- Inorder Successor in BST
- Merge Sort for Linked List
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Perfect Binary Tree
- Reverse a string using Stack
- Full binary tree
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Vertical sum
- Check if Tree is Isomorphic
- Predecessor and Successor
- Find length of Loop
- Median of BST
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Closest Neighbor in BST
- Brothers From Different Roots
- Sum of the Longest Bloodline of a Tree
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Vertical Width of a Binary Tree

- Coin Change
- Kadane's Algorithm
- Print Diagonally
- Maximum Index
- Next Permutation
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Path in Matrix
- Subset Sum Problem
- Longest Palindrome in a String
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Sorting Elements of an Array by Frequency
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Stock span problem
- Minimum steps to get desired array
- Number of pairs
- Minimize the heights
- Next larger element
- Unique BST's
- Word Break
- Kth smallest element
- Rotate and delete
- Trie | (Insert and Search)
- Find all four sum numbers
- Word Boggle
- Rearrange characters
- First non-repeating character in a stream
- K
^{th}largest element in a stream - Smallest Absolute Difference
- Longest Bitonic subsequence
- Minimum Time
- Perfect Sum Problem
- Job Sequencing Problem
- LCS of three strings
- CamelCase Pattern Matching
- Longest Common Prefix in an Array
- Minimum cost to fill given weight in a bag
- Count even length
- Matrix Chain Multiplication
- Find the last digit when factorial of A divides factorial of B
- Geek and Strings
- Reverse a Linked List in groups of given size.
- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Construct Binary Tree from Parent Array
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- Print a Binary Tree in Vertical Order
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Max length chain
- Largest BST
- Find the Closest Element in BST
- Merge k Sorted Arrays
- Duplicate subtree in Binary Tree
- Top View of Binary Tree
- k-th smallest element in BST
- Polynomial Addition
- Binary Tree to CDLL
- Find a pair with given target in BST
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- Node at distance
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum

- Maximum of minimum for every window size
- Merge Without Extra Space
- Next Smallest Palindrome
- Ugly Numbers
- Word Break - Part 2
- Find median in a stream
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array
- Phone directory
- Binary Tree to DLL
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree