- Swap two nibbles in a byte
- Count total set bits
- Bit Difference
- Count numbers containing 4
- Sum of all substrings of a number
- Total number of Strings
- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Count Leaves in Binary Tree
- Mirror Tree
- Two Mirror Trees
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Sum Tree
- Postorder Traversal
- Implement Queue using Linked List
- Preorder Traversal
- Level order traversal
- Root to Leaf Paths
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Find the Sum of Last N nodes of the Linked List
- Sum of Binary Tree

Name

Institution

Overall Coding Score: 622

Problems Solved: 232

Monthly Coding Score: 27

Weekly Coding Score: 0

- Number of paths in a matrix with k coins
- Next sparse binary number
- Does robot moves circular
- Element that appears once where every element occurs twice
- Maximum sum increasing subsequence
- Reach the Nth point
- Adjacents are not allowed
- Swap all odd and even bits
- Count number of hops
- Save Knights
- Reach a given score
- Skip the work
- Adding Ones
- Pairs with specific difference
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Decode the pattern
- Gold Mine Problem
- Minimum Operations
- Largest zigzag sequence
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- Rod Cutting
- Longest Bitonic subsequence
- Paths to reach origin
- Get Minimum Squares
- Find Pair Given Difference
- Top k numbers in a stream
- Minimum Deletions
- Shortest Common Supersequence
- Minimum Number in a sorted rotated array
- Longest alternating subsequence
- Count of strings that can be formed using a, b and c under given constraints
- Maximum sum Problem
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Equalize the Towers
- Prime number of set bits
- Swap every two bits in bytes
- Minimal moves to form a string
- Reverse a linked list
- Occurence of an integer in a Linked List
- Pairwise swap elements of a linked list by swapping data
- Given a linked list of 0s, 1s and 2s, sort it.
- 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
- Rearrange linked list in-place
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Right View of Binary Tree
- K distance from root
- Maximum Width of Tree
- Delete without head pointer
- Diameter of Binary Tree
- Check for Balanced Tree
- n'th node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Transform to Sum Tree
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of a Graph
- Reverse alternate levels of a perfect binary tree
- BFS traversal of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Postorder traversal from given Inorder and Preorder traversals
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Print BST elements in given range
- Print a Binary Tree in Vertical Order
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- Serialize and Deserialize a Binary Tree
- Expression Tree
- Check if Linked List is Palindrome
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Root to leaf paths sum
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Delete nodes greater than k
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Maximum Bipartite Matching
- Union of Two Linked Lists
- Maximum path sum
- XOR Linked List
- Full binary tree
- Symmetric Tree
- Vertical sum
- Next Right Node
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Predecessor and Successor
- Leaves to DLL
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Deletion and Reverse in Linked List
- Leaf under budget
- Linked List Matrix
- Height of Spiral Tree
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Move all zeros to the front of the linked list

- Coin Change
- Kadane's Algorithm
- Number of Unique Paths
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n’th stair
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Edit Distance
- Count of Subarrays
- Path in Matrix
- Sum of bit differences
- Largest square formed in a matrix
- Number of ways
- Sum of Query II
- Form a palindrome
- Palindromic Array
- Max possible amount
- Maximum Profit
- Unique BST's
- Distinct Transformations
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Max absolute difference
- Check Mirror in N-ary tree
- Count subsequences of type a^i b^j c^k
- Floyd Warshall
- Perfect Sum Problem
- Two water Jug problem
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Killing Spree
- Fill the Tank
- Nitika and her queries
- The Painter's Partition Problem
- Reverse a Linked List in groups of given size.
- Count BST nodes that lie in a given range
- Bottom View of Binary Tree
- 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
- 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
- Topological sort
- Find the number of islands
- Make Binary Tree
- Check if subtree
- Extreme nodes in alternate order
- Clone a Binary Tree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Minimum Swaps
- Strongly Connected Components (Kosaraju's Algo)
- Bipartite Graph
- Find the Closest Element in BST
- Length of longest palindrome in linked list
- Bridge Edge in Graph
- Polynomial Addition
- Euler Circuit in a Directed Graph
- Euler circuit and Path
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- Pairs violating BST property
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Count Number of SubTrees having given Sum
- Path Count in Directed Graph