Name

mazumder8

Institution

Rank in Institute

#13

Campus Ambassador

Overall Coding Score: 1238

Monthly Coding Score: 1178

Weekly Coding Score: 83

- Power of 2
- Doubling the value
- Missing number in array
- Ways To Tile A Floor
- Set Bits
- Check for subsequence
- Does array represent Heap
- Inverse Permutation
- Height of Heap
- Count nodes of linked list
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Queue using Linked List
- Preorder Traversal
- Search a node in BST
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Modular Node
- Find n/k th node in Linked list
- Queue Reversal
- Sum of Binary Tree
- Insert in Middle of Linked List
- Count Non-Leaf Nodes in Tree

- Number of Unique Paths
- First Repeating Element
- Maximum value in a bitonic array
- Longest Distinct characters in string
- Maximum sum increasing subsequence
- Key Pair
- Reach the Nth point
- Swap all odd and even bits
- Count number of hops
- Inorder Traversal and BST
- Reach a given score
- Missing element of AP
- Count the Zeros
- 0 - 1 Knapsack Problem
- Valid Substring
- Count the Reversals
- Cutted Segments
- Lexicographically previous permutation
- Least Prime Factor
- Adding Ones
- Count Pairs in an Array
- Min sum formed by digits
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Max sum in sub-arrays
- Sum of all substrings of a number
- Minimum Operations
- Excel Sheet | Part - 2
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- Evaluation of Postfix Expression
- Rod Cutting
- Paths to reach origin
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Minimum number of deletions and insertions.
- Minimum number of deletions to make a sorted sequence
- Minimum number of deletions.
- Longest alternating subsequence
- Longest subsequence-1
- Maximum sum Problem
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- Longest Repeating Subsequence
- Count the triplets
- Maximum distinct elements after removing K elements
- Print Binary Tree levels in sorted order
- Print Bracket Number
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Rearrange a linked list
- Add 1 to a number represented as linked list
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Split a Circular Linked List into two halves
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- 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
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- 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
- Reverse alternate levels of a perfect binary tree
- 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
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Level order traversal Line by Line
- Print BST elements in given range
- Minimum Depth of a Binary Tree
- Odd even level difference
- Leaf at same level
- Is Binary Tree Heap
- Distinct occurrences
- Expression Tree
- Check if Linked List is Palindrome
- Delete a Node in Single Linked List
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Level order traversal
- Peak element
- Inorder Successor in BST
- Delete nodes greater than k
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse a string using Stack
- Full binary tree
- Modify Linked List-1
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Construct BST from Postorder
- Merge Lists Alternatingly
- Vertical sum
- Next Right Node
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Deletion and Reverse in Linked List
- Reverse First K elements of Queue
- Remove Half Nodes
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Deletion in a Binary Tree
- Nodes at Odd Levels
- Sum of the Longest Bloodline of a Tree
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Move all zeros to the front of the linked list
- Vertical Width of a Binary Tree
- Rotate doubly Linked List
- Matrix Interchange - Java
- ArrayList Operation
- Operations on ArrayList
- Stack Operations
- Queue Operations
- Get min at pop

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Excel Sheet | Part - 1
- Overlapping Intervals
- Next Permutation
- Longest Increasing Subsequence
- Parenthesis Checker
- 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)
- Edit Distance
- Maximum Rectangular Area in a Histogram
- Min Coin
- Count of Subarrays
- Path in Matrix
- Trapping Rain Water
- Subset Sum Problem
- Number of Coins
- Largest Number formed from an Array
- 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
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Number of ways
- Minimum Cost of ropes
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Length of the longest substring
- Smallest number on left
- Stock span problem
- Convert an array to reduced form
- Dimensions of Rectangle
- Preorder Traversal and BST
- Card Rotation
- Your Social Network
- Next larger element
- Unique BST's
- Distinct Transformations
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Divisibility tree
- Knight Walk
- Print leaf nodes from preorder traversal of BST
- Find whether path exist
- Unit Area of largest region of 1's
- Rearrange characters
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Smallest distinct window
- Huffman Encoding
- Nearly Sorted Algorithm
- Infix to Postfix
- Longest Bitonic subsequence
- Perfect Sum Problem
- Top k numbers in a stream
- Image Multiplication
- Rotten Oranges
- LCS of three strings
- Minimum cost to fill given weight in a bag
- Steps by Knight
- Maximum bitonic subarray sum
- Biconnected Graph
- Pizza Mania
- Number of subarrays with maximum values in given range
- Count of Palindromic substrings in an Index range
- The Tiny Miny
- Save Gotham!
- Given a linked list, reverse alternate nodes and append at the end
- 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
- 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
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Print a Binary Tree in Vertical Order
- Merge K sorted linked lists
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Max rectangle
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Kth element in Matrix
- Remove loop in Linked List
- Max length chain
- Largest BST
- Box Stacking
- Count Palindromic Subsequences
- Number of root to leaf paths
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Print Nodes having K leaves
- Duplicate subtree in Binary Tree
- Top View of Binary Tree
- k-th smallest element in BST
- Polynomial Addition
- Merge Sort on Doubly Linked List
- 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
- Right Sibling in Binary Tree
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Operations on PriorityQueue
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Smallest Positive missing number
- Unique BST's
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence

- Minimum sum partition
- Maximum of minimum for every window size
- Merge Two Sorted Arrays
- Return two prime numbers
- A Simple Fraction
- Nth digit of pi
- Rohan's Love for Matrix
- Create your own Calculator
- nCr mod M | Part 1
- Number Formation
- Boolean Parenthesization
- Longest valid Parentheses
- Print all LCS sequences
- Minimum Cost Path
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Generalised Fibonacci numbers
- Find median in a stream
- Minimum number of elements
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array
- Hexadecimal to decimal counter
- Count the subarrays having product less than k
- Joey doesn't share food
- Rachael's String Challenge
- Closest Palindrome
- Doctor Strange
- Kill Captain America
- Minimum number to make median X
- Reorder List
- Binary Tree to DLL
- AVL Tree Insertion
- Partition array to K subsets
- AVL Tree Deletion
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Solve the Sudoku