Name

Deepak Kumar Shukla

Rank in Institute

#19

Courses Attended

Campus Ambassador

Overall Coding Score: 981

Monthly Coding Score: 283

Weekly Coding Score: 53

- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Remove duplicate elements from sorted Array
- Preorder Traversal
- Minimum element in BST
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Sum of Binary Tree
- Count Non-Leaf Nodes in Tree
- Start Coding
- logical Operators
- Binary String
- Pythagorean Triplet
- Majority Element
- Dice throw
- Permutations of a given string
- Missing number in array
- Reverse array in groups
- Does array represent Heap
- Find the element that appears once in sorted array
- Last index of One
- Sorted matrix
- Anagram Palindrome

- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of 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 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
- Merge 2 sorted linked list in reverse order
- Linked List in Zig-Zag fashion
- 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
- Reverse a Doubly Linked List
- Quick Sort
- Right View of Binary Tree
- K distance from root
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- 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
- DFS of Graph
- Reverse alternate levels of a perfect binary tree
- BFS of graph
- 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
- 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
- Remove every k'th node
- Leaf at same level
- Is Binary Tree Heap
- Multiply two linked lists
- Distinct occurrences
- Expression Tree
- 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
- Root to leaf paths sum
- Sort a stack
- Level order traversal
- Inorder Successor in BST
- Merge Sort for Linked List
- Split Singly Linked List Alternatingly
- Ancestors in Binary Tree
- Root to Leaf Paths
- Maximum path sum
- Perfect Binary Tree
- Reverse a string using Stack
- Linked List that is Sorted Alternatingly
- XOR of a given range
- Full binary tree
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Merge Lists Alternatingly
- Huffman Decoding
- Vertical sum
- Count Pairs whose sum is equal to X
- Predecessor and Successor
- Find length of Loop
- Reverse First K elements of Queue
- Remove Half Nodes
- Sum of Leaf Nodes
- Brothers From Different Roots
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- The New Line
- Data Types
- The Size of
- Taking input
- Learn to Comment
- GetLine and Ignore
- Learning to be precise
- Bitwise Operators
- Even Odd
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Count Odd Even
- Need Some Change
- Count the Specials
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Even Subsets
- Almost Equal
- The Pattern Matcher
- Magic in CPP
- Swap the objects
- Two Dimensional World
- Delete Array
- Anagram
- Search in a Rotated Array
- Maximize Toys
- Count Occurences of Anagrams
- Remove all duplicates from a given string
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Segregate even and odd nodes in a Linked List
- Longest Distinct characters in string
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Max Sum without Adjacents
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Count pairs with given sum
- Inorder Traversal and BST
- Minimum element in a sorted and rotated array
- 0 - 1 Knapsack Problem
- Longest Common Increasing Subsequence
- Final Destination
- Left out candies
- Equilibrium point
- Adding Ones
- Pairs with specific difference
- Count Pairs in an Array
- Knapsack with Duplicate Items
- Sum of k smallest elements in BST
- Sum of all substrings of a number
- Palindromic patitioning
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Element with left side smaller and right side greater
- Paths to reach origin
- Subarrays with given sum
- Group Anagrams Together
- Second most repeated string in a sequence
- Shortest Common Supersequence
- Painting the Fence
- Minimum number of deletions and insertions.
- Ways to sum to N
- Subset with sum divisible by m
- Longest subsequence-1
- Longest Repeating Subsequence
- Stickler Thief
- Geek and its Colored Strings
- Count the triplets
- Find if string is K-Palindrome or not
- Save Ironman

- 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
- 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
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- Range Minimum Query
- The Celebrity Problem
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Circular tour
- Wildcard Pattern Matching
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Largest BST
- Interleaved Strings
- Count Palindromic Subsequences
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Bipartite Graph
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- k-th smallest element in BST
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Find a pair with given target in BST
- Occurences of 2 as a digit
- Construct expression tree
- Foldable Binary Tree
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Sub Array
- Maximum Index
- Equal Sum
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Count ways to reach the n'th stair
- Egg Dropping Puzzle
- Edit Distance
- Maximum Rectangular Area in a Histogram
- Consecutive 1's not allowed
- Longest Even Length Substring
- Path in Matrix
- Trapping Rain Water
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Largest Number formed from an Array
- Longest Palindrome in a String
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Boolean Matrix Problem
- Design a tiny URL or URL shortener
- Special Keyboard
- Number of ways
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Length of the longest substring
- Longest consecutive subsequence
- Stock span problem
- Longest Arithmetic Progression
- Bleak Numbers
- Number of pairs
- Coin Piles
- Maximum Profit
- Minimize the heights
- Next larger element
- Total Decoding Messages
- Word Break
- Sum of Subarrays
- Count Palindrome Sub-Strings of a String
- Snake and Ladder Problem
- Shortest Source to Destination Path
- Trie | (Insert and Search)
- Find whether path exist
- Unit Area of largest region of 1's
- Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Floyd Warshall
- Infix to Postfix
- Longest Bitonic subsequence
- Mobile numeric keypad
- Maximum sum Rectangle
- Minimum Time
- Perfect Sum Problem
- Rotten Oranges
- Probability of Knight
- LCS of three strings
- Longest repeating and non-overlapping substring
- Longest Common Prefix in an Array
- Minimum cost to fill given weight in a bag
- Steps by Knight
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Count of Palindromic substrings in an Index range
- Longest subarray with sum divisible by K
- Longest Sub-Array with Sum K
- Optimal Strategy For A Game

- Reorder List
- Binary Tree to DLL
- AVL Tree Insertion
- AVL Tree Deletion
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Minimum Points To Reach Destination
- Minimum sum partition
- Merge Without Extra Space
- Find sum of different corresponding bits for all pairs
- Return two prime numbers
- Allocate minimum number of pages
- Ugly Numbers
- N-Queen Problem
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array
- Count the subarrays having product less than k