Name

Rank in Institute

#106

Courses Attended

Campus Ambassador

Overall Coding Score: 673

Monthly Coding Score: 46

Weekly Coding Score: 0

- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Postorder Traversal
- Implement Stack using Linked List
- Implement Queue using Linked List
- Preorder Traversal
- Start Coding - Python
- Space Seperated - Python
- Concatenating Strings - Python
- Taking input and typecasting - Python
- Taking input - Python
- Comparison Operators - Python
- Pythagorean Triplet
- Majority Element
- Shortest path from 1 to n
- Rotate Array
- Missing number in array
- Immediate Smaller Element
- k largest elements
- Smallest number
- Rotating an Array
- Reverse array in groups
- Set Bits
- Minimize the sum of product
- Type of array
- Sum of dependencies in a graph
- Sort in specific order
- Check if string is rotated by two places
- Print an array in Pendulum Arrangement
- Find the fine
- Find the closest number

- Reverse a linked list
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Merge 2 sorted linked list in reverse order
- 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
- Check for Balanced Tree
- Heap Sort
- Left View of Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Remove duplicate element from sorted Linked List
- 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
- Absolute List Sorting
- Implement two stacks in an array
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Is Binary Tree Heap
- Check if Linked List is Palindrome
- Count distinct elements in every window
- Special Stack
- Sort a stack
- Level order traversal
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Maximum path sum
- Huffman Decoding
- Huffman Decoding-1
- Count Pairs whose sum is equal to X
- Find length of Loop
- Deletion and Reverse in Linked List
- Linked List Matrix
- Sum of Leaf Nodes
- Move all zeros to the front of the linked list
- Delete middle element of a stack
- Rotate doubly Linked List
- Magic in CPP
- Swap the objects
- Structs and Objects
- Two Dimensional World
- Learning Structs
- Delete Array
- Repetitive Printing - Python
- Operators in Python
- Split the input - Python
- Comment in Python
- Logical Operators - Python
- Increment and Decrement - Python
- Bitwise Operators - Python
- Is and In Operator
- sep and end in Print()
- Mother Vertex
- Anagram
- Maximize Toys
- Trailing zeroes in factorial
- Minimum number of Coins
- Sort an array of 0s, 1s and 2s
- Segregate even and odd nodes in a Linked List
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Possible paths
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Valid Substring
- Equilibrium point
- Chocolate Distribution Problem
- Flood fill Algorithm
- Roman Number to Integer
- Decode the string
- Find largest word in dictionary
- Recamanâ€™s sequence
- Minimum Operations
- Longest Palindromic Subsequence
- Recursive sequence
- Transitive closure of a Graph
- Count the paths
- Nth catalan number
- Count all possible paths from top left to bottom right
- Eulerian Path in an Undirected Graph
- Print adjacency list

- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Quick Sort on Linked List
- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Topological sort
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Bipartite Graph
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Bridge Edge in Graph
- Top View of Binary Tree
- Polynomial Addition
- Euler Circuit in a Directed Graph
- Euler circuit and Path
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Leaves to DLL
- Path Count in Directed Graph
- Unit Area of largest region of 1's
- Coin Change
- Kadane's Algorithm
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to N'th Stair(Order does not matter)
- Edit Distance
- nCr
- Consecutive 1's not allowed
- Longest Even Length Substring
- Path in Matrix
- Subset Sum Problem
- Largest Number formed from an Array
- Possible words from Phone digits
- Jumping Numbers
- Longest Palindrome in a String
- Relative Sorting
- Maximum of all subarrays of size k
- Sorting Elements of an Array by Frequency
- Minimum Cost of ropes
- Inversion of array
- Length of the longest substring
- M-Coloring Problem
- Is Binary Number Multiple of 3
- Your Social Network
- Largest number in K swaps
- Special Matrix
- Minimize the heights
- X Total Shapes
- Total Decoding Messages
- Longest Common Substring
- Negative weight cycle
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Divisibility tree
- Knight Walk
- Find whether path exist
- Unit Area of largest region of 1's
- First non-repeating character in a stream
- Floyd Warshall
- Page Faults in LRU
- N Digit numbers with digits in increasing order
- Rotten Oranges
- Steps by Knight
- Numbers with alternative 1's
- Biconnected Graph
- Construct binary palindrome by repeated appending and trimming