- Repetitive Addition Of Digits
- Nth Fibonacci Number
- Dice throw
- Bit Difference
- Find position of set bit
- Pattern Jumping
- Ways To Tile A Floor
- Generate Binary Numbers
- Searching an element in a sorted array
- Find first set bit
- Find first repeated character
- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Power of Four
- Delete node in Doubly Linked List
- Finding middle element in a linked list
- Implement Queue using array
- Doubly linked list Insertion
- Search a node in BST
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Delete Alternate Nodes

Name

Sanjit Prasad

Institution

Rank in Institute

#30

Campus Ambassador

Overall Coding Score: 374

Monthly Coding Score: 3

Weekly Coding Score: 0

- Count Occurences of Anagrams
- Maximum sum increasing subsequence
- Array to BST
- Max Sum without Adjacents
- Count Smaller elements
- Adjacents are not allowed
- Cycle Race
- Reach a given score
- Moving on grid
- Minimum element in a sorted and rotated array
- 0 - 1 Knapsack Problem
- Valid Substring
- Cutted Segments
- Number that are not divisible
- Minimum Notes Required
- Maximize Dot Product
- Game of cells
- Pairs with specific difference
- Min sum formed by digits
- Knapsack with Duplicate Items
- Friends Pairing Problem
- Max sum in sub-arrays
- Gold Mine Problem
- Sum of all substrings of a number
- Find all pairs with a given sum
- Largest zigzag sequence
- Temple Offerings
- Longest Palindromic Subsequence
- Evaluation of Postfix Expression
- Sequence of Sequence
- First negative integer in every window of size k
- Nth catalan number
- Shortest Common Supersequence
- Painting the Fence
- Minimum steps to minimize n as per given condition
- Longest alternating subsequence
- Subset with sum divisible by m
- Longest subsequence-1
- Maximum sum Problem
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Compute (a*b)%c
- Ritika's Money
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Add two numbers represented by linked lists
- 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
- Diameter of Binary Tree
- Nth node from end of linked list
- Merge two sorted linked lists
- Intersection of two sorted Linked lists
- Level order traversal in spiral form
- Reverse Level Order Traversal
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Delete a Node in Single Linked List
- Sort a stack
- Level order traversal
- Inorder Successor in BST
- Merge Sort for Linked List
- Insert in a Sorted List
- Sum of leaf nodes in BST
- Reverse a string using Stack
- Predecessor and Successor

- Coin Change
- Kadane's Algorithm
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Egg Dropping Puzzle
- Edit Distance
- Magic Triplets
- nCr
- Path in Matrix
- Subset Sum Problem
- Minimum Platforms
- Number of paths in a matrix with k coins
- Longest Palindrome in a String
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Minimum Cost of ropes
- Inversion of array
- Divide and Subtract Game
- Next larger element
- Word Break
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Hamiltonian Path
- First non-repeating character in a stream
- Floyd Warshall
- Infix to Postfix
- Longest Bitonic subsequence
- Minimum Time
- Perfect Sum Problem
- Job Sequencing Problem
- LCS of three strings
- Count digit groupings of a number
- Minimum cost to fill given weight in a bag
- Matrix Chain Multiplication
- Count of Palindromic substrings in an Index range
- Nitika and her queries
- Reverse a Linked List in groups of given size.
- Check for BST
- Delete without head pointer
- Delete a node from BST
- Circular tour
- Remove loop in Linked List
- Max length chain
- Largest BST
- Box Stacking
- Count Palindromic Subsequences
- Delete keys in a Linked list
- k-th smallest element in BST
- Merge Sort on Doubly Linked List
- Find a pair with given target in BST