Name

Chirag Gupta

Institution

Rank in Institute

#10

Courses Attended

Campus Ambassador

Overall Coding Score: 848

Monthly Coding Score: 456

Weekly Coding Score: 36

- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Postorder Traversal
- Preorder Traversal
- Search a node in BST
- Minimum element in BST
- Circular Linked List Traversal
- Queue Reversal
- Sum of Binary Tree
- Check if a string is Isogram or not
- Shortest path from 1 to n
- Missing number in array
- Count numbers containing 4
- Ways To Tile A Floor
- Smallest number
- Padovan Sequence
- Minimize the sum of product
- Sum of dependencies in a graph
- Does array represent Heap
- Print first n Fibonacci Numbers
- First and last occurrences of X
- Ishaan Loves Chocolates

- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of a linked list
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Rearrange a linked list
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Compare two linked lists
- 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
- Quick Sort
- Right View of Binary Tree
- K distance from root
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Left View of Binary Tree
- Sum Tree
- Transform to Sum Tree
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- 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
- Postorder traversal from given Inorder and Preorder traversals
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Level order traversal Line by Line
- Print BST elements in given range
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- Leaf at same level
- Is Binary Tree Heap
- Expression Tree
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Print Common Nodes in BST
- Level order traversal
- Inorder Successor in BST
- Delete nodes greater than k
- Index Of an Extra Element
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Counting Sort
- Max and min element in Binary Tree
- Perfect Binary Tree
- Counting elements in two arrays
- Reverse a string using Stack
- Full binary tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Construct BST from Postorder
- Merge Lists Alternatingly
- Huffman Decoding
- Huffman Decoding-1
- Vertical sum
- Count Pairs whose sum is equal to X
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Deletion and Reverse in Linked List
- Change of Key in BST
- Median of BST
- Normal BST to Balanced BST
- Linked List Matrix
- Reverse First K elements of Queue
- Remove Half Nodes
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Closest Neighbor in BST
- Brothers From Different Roots
- Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node)
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Delete middle element of a stack
- Rotate doubly Linked List
- Learning Structs
- Get min at pop
- Mother Vertex
- Number of Unique Paths
- Good Pairs
- Reverse words in a given string
- Remove all duplicates from a given string
- Sort an array of 0s, 1s and 2s
- Maximum value in a bitonic array
- Array to BST
- Inorder Traversal and BST
- Reach a given score
- Count the Zeros
- Element appearing once
- Sum of k smallest elements in BST
- Flood fill Algorithm
- Love For The Twins
- Minimum Operations
- Find all pairs with a given sum
- Meta Strings
- Largest Fibonacci Subsequence
- Increasing Sub Sequence
- Array Subset of another array
- Count the paths
- Find the closest prime number to a given number
- Find Pair Given Difference
- k sorted array
- Minimum Number in a sorted rotated array
- Number and the Digit Sum
- Count of strings that can be formed using a, b and c under given constraints
- Maximum sum Problem
- K-Ary Tree
- Akku and Binary Numbers
- Smallest number with sum of digits as N and divisible by 10^N
- Eulerian Path in an Undirected Graph

- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- 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
- Connect Nodes at Same Level
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- Vertical Traversal of Binary Tree
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Remove loop in Linked List
- Max length chain
- Largest BST
- Minimum Swaps to Sort
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Print Nodes having K leaves
- Duplicate subtree in Binary Tree
- Top View of Binary Tree
- k-th smallest element in BST
- Binary Tree to CDLL
- Find a pair with given target in BST
- Populate Inorder Successor for all nodes
- Construct expression tree
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Node at distance
- Mirror of a given node
- Pairs violating BST property
- Maximum path sum from any node
- Leaves to DLL
- Largest Independent Set Problem
- Duplicate Subtrees
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Smallest Positive missing number
- Unique BST's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Case-specific Sorting of Strings
- Count ways to N'th Stair(Order does not matter)
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Complement
- Maximum Sub Array
- Overlapping Intervals
- Parenthesis Checker
- Minimum number of jumps
- Consecutive 1's not allowed
- Longest Even Length Substring
- Trapping Rain Water
- Sum of bit differences
- Subset Sum Problem
- Factorials of large numbers
- Number following a pattern
- Largest Number formed from an Array
- Modular Exponentiation for large numbers
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Design a tiny URL or URL shortener
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Inversion of array
- Preorder to Postorder
- Length of the longest substring
- Longest consecutive subsequence
- Stock span problem
- Convert an array to reduced form
- Tic-Tac-Toe
- Palindromic Array
- Preorder Traversal and BST
- Bleak Numbers
- Next larger element
- Unique BST's
- Kth smallest element
- Count Palindrome Sub-Strings of a String
- Print leaf nodes from preorder traversal of BST
- Rearrange characters
- Count subsequences of type a^i b^j c^k
- Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Nearly Sorted Algorithm
- Smallest Absolute Difference
- Job Sequencing Problem
- LCS of three strings
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Killing Spree
- Longest subarray with sum divisible by K
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K
- Container with most water
- Lucky alive person in a circle