- Power of 2
- Sort The Array
- Pythagorean Triplet
- Nth Fibonacci Number
- Doubling the value
- Majority Element
- Shortest path from 1 to n
- Rotate Array
- Swap two nibbles in a byte
- Number is sparse or not
- Bit Difference
- Greater on right side
- Immediate Smaller Element
- Binary Array Sorting
- Minimum difference pair
- Find position of set bit
- Pattern Jumping
- Maximum money
- Ways To Tile A Floor
- Find the Odd Occurence
- Rotating an Array
- Reverse array in groups
- Set Bits
- Count Squares
- String Reversal
- Find first and last occurrence of x
- Type of array
- Sum of dependencies in a graph
- Sort in specific order
- Find first set bit
- Find the element that appears once in sorted array
- Cyclically rotate an array by one
- Print an array in Pendulum Arrangement
- Transform to prime
- Absolute Difference of 1
- Repeated I.Ds
- Find the fine
- Akash and Friend
- Find the closest number
- Ishaan Loves Chocolates
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Implement Stack using Linked List
- Implement Queue using Linked List
- Square root
- Binary Search
- Replace all 0's with 5
- Find triplets with zero sum
- Minimum element in BST
- Product of array elements
- Start Coding - Python
- Space Seperated - Python
- Concatenating Strings - Python
- Taking input and typecasting - Python
- Taking input - Python
- Welcome aboard - Python
- Regex - Python
- Iterating through Lists - Python
- Functions - Python
- Variable Arguments - Python
- Anonymous Functions - Python
- Two digit Sum
- AweSum
- Copy the End
- KaBoom
- Lambda Sum

Name

Subhadeep Gupta

Rank in Institute

#20

Courses Attended

Overall Coding Score: 443

Monthly Coding Score: 123

Weekly Coding Score: 0

- Number of Unique Paths
- Print Pattern
- Squares in N*N Chessboard
- Trailing zeroes in factorial
- Good Pairs
- Reverse words in a given string
- Sort an array of 0s, 1s and 2s
- Maximum value in a bitonic array
- Finding Position
- Element that appears once where every element occurs twice
- Column name from a given column number
- Maximum sum increasing subsequence
- Facing the sun
- Maximum Difference
- Product array puzzle
- Reach the Nth point
- Leaders in an array
- Pair in array whose sum is closest to X
- Swap all odd and even bits
- Count number of hops
- Count pairs with given sum
- Triplet Sum in Array
- Minimum element in a sorted and rotated array
- Missing element of AP
- Count the Zeros
- Trail of ones
- Arithmetic Number
- Perfect Numbers
- Element appearing once
- Equilibrium point
- Floor in a Sorted Array
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Exit Point in a Matrix
- 1[0]1 Pattern Count
- Decode the pattern
- Maximum no of 1's row
- Friends Pairing Problem
- Gold Mine Problem
- Find Nth root of M
- Sum of all substrings of a number
- Minimum Operations
- Largest Fibonacci Subsequence
- Transitive closure of a Graph
- Array Subset of another array
- Paths to reach origin
- Nth catalan number
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Maximum sum Problem
- Minimum indexed character
- Pairs which are Divisible by 4
- Reorganize The Array
- Counts Zeros Xor Pairs
- Eulerian Path in an Undirected Graph
- Reverse 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.
- linked list of strings forms a palindrome
- Compare two linked lists
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Quick Sort
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Heap Sort
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Find Transition Point
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Determine if Two Trees are Identical
- Root to leaf path sum
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Print BST elements in given range
- Largest subarray with 0 sum
- Odd even level difference
- Match specific pattern
- Distinct occurrences
- Expression Tree
- Max distance between same elements
- Kth largest element in BST
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Level order traversal
- Peak element
- Index Of an Extra Element
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Full binary tree
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Linked List Matrix
- Sum of Leaf Nodes
- Learning Macros
- Matrix Interchange
- Delete Array
- Pair Sum in Vector
- Repetitive Printing - Python
- Split the input - Python
- Comment in Python
- If conditional statement- Python
- Mark Even and Odd - Python
- Slicing in String - Python
- Repeat the Strings - Python
- String Functions - II - Python
- String Functions I - Python
- Intro to Lists - Python
- Count Even Odd - Python
- Functions in Lists - Python
- Classes and Objects - Python
- Average_Min_Max - Python
- Mean Finder
- Intro to Dictionary - Python
- Neighbor of 10
- Dictionary in Python - II
- Deep Copy objects
- List Average
- sep and end in Print()
- Modules
- Reverse words in a given string

- Coin Change
- Kadane's Algorithm
- Longest Common Subsequence
- Count ways to N'th Stair(Order does not matter)
- Count of Subarrays
- Path in Matrix
- Subset Sum Problem
- Largest square formed in a matrix
- Nuts and Bolts Problem
- Next larger element
- Unique BST's
- Word Break
- Kth smallest element
- Longest Common Substring
- Rotate and delete
- Unit Area of largest region of 1's
- Count subsequences of type a^i b^j c^k
- Magnet Array Problem
- Smallest Positive missing number
- Perfect Sum Problem
- Rotten Oranges
- Longest Common Prefix in an Array
- Matrix Chain Multiplication
- Unit Digit
- Reverse a Linked List in groups of given size.
- Quick Sort on Linked List
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Serialize and Deserialize a Binary Tree
- Remove loop in Linked List
- Delete keys in a Linked list
- Count Number of SubTrees having given Sum
- Nearest Power
- Unlucky Number
- Unit Area of largest region of 1's