Name

Rahul Gupta

Institution

Rank in Institute

#1

Courses Attended

Overall Coding Score: 609

Monthly Coding Score: 607

Weekly Coding Score: 0

- Count nodes of linked list
- Inorder Traversal
- Bubble Sort
- Height of Binary Tree
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Doubly linked list Insertion
- Preorder Traversal
- Implement strstr
- Search a node in BST
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Identical Linked Lists
- Queue Reversal
- Insert in Middle of Linked List
- Start coding - C
- The new line - C
- Absolute Value
- Convert Celsius To Fahrenheit
- Count total set bits
- Number is sparse or not
- Gray Code
- Gray to Binary equivalent
- Power of 2
- Rotate Array
- Search an Element in an array
- Binary Array Sorting
- Count possible triangles
- Print Matrix in snake Pattern
- Determinant of a Matrix
- Check if a string is Isogram or not
- Check if strings are rotations of each other or not
- Maximum Occuring Character
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Generate Binary Numbers
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Print first n Fibonacci Numbers
- Intersection of two arrays
- Union of two arrays
- Keypad typing
- Check if two arrays are equal or not

- Reverse a linked list
- Rotate a Linked List
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Quick Sort
- Right View of Binary Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Level order traversal Line by Line
- Print BST elements in given range
- Josephus problem
- Check if Linked List is Palindrome
- Three way partitioning
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Merge Sort for Linked List
- Counting Sort
- Huffman Decoding
- Children Sum Parent
- Reverse First K elements of Queue
- ZigZag Tree Traversal
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Get min at pop
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Maximum AND Value
- Maximum occured integer
- Wave Array
- Equilibrium point
- Minimum Number in a sorted rotated array
- Roof Top
- Union of Two Sorted Arrays
- Closet 0s 1s and 2s
- Triplet Sum in Array
- Print adjacency list
- Anagram
- Subarray with 0 sum
- Isomorphic Strings
- The Modified String
- Pangram Checking
- N meetings in one room
- Fractional Knapsack
- Count Total Digits in a Number
- Digital Root
- Ways to write n as sum
- Stickler Thief
- Numbers containing 1, 2 and 3
- First Repeating Element
- Nth number made of prime digits
- Reach a given score
- Shortest Common Supersequence
- Nth catalan number
- Number of Unique Paths

- 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
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Max sum subarray by removing at most one element
- Find the Closest Element in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Bridge Edge in Graph
- Top View of Binary Tree
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Node at distance
- Maximum path sum from any node
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Implementing Floor in BST
- Pair Sum in BST
- Smallest Positive missing number
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Trapping Rain Water
- Stock buy and sell
- Kadane's Algorithm
- Number of pairs
- Make Matrix Beautiful
- Distance of nearest cell having 1
- Subarrays with equal 1s and 0s
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Infix to Postfix
- Kth smallest element
- Kth largest element in a stream
- Minimum Cost of ropes
- Rearrange characters
- Job Sequencing Problem
- Minimum Platforms
- Largest number in K swaps
- Black and White
- Combination Sum
- Subsets
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Optimal Strategy For A Game
- nCr
- Longest Common Subsequence
- Kth smallest element
- Steps by Knight
- Rotten Oranges
- Zero Sum Subarrays
- Find whether path exist
- Trie | (Insert and Search)
- Unique BST's
- X Total Shapes
- Preorder to Postorder
- Relative Sorting
- Subset Sum Problem
- Minimum number of jumps