- Search an Element in an array
- Power of 2
- Pythagorean Triplet
- Majority Element
- Shortest path from 1 to n
- Rotate Array
- Permutations of a given string
- Missing number in array
- Number of paths
- Immediate Smaller Element
- k largest elements
- Rotating an Array
- Reverse array in groups
- Minimize the sum of product
- String with numbers at its end
- Type of array
- Sort in specific order
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Find first repeated character
- Find the element that appears once in sorted array
- Thief trying to escape
- Last index of One
- Print an array in Pendulum Arrangement
- First element to occur k times
- Uncommon characters
- URLify a given string
- Rightmost different bit
- Find the fine
- Find the closest number
- Fibonacci to N
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Implement strstr
- Implement Atoi
- Find triplets with zero sum
- Minimum element in BST
- Delete Alternate Nodes
- Identical Linked Lists
- Sum of Binary Tree
- Insert in Middle of Linked List

Name

Tushar Geetey

Rank in Institute

#35

Courses Attended

Campus Ambassador

Overall Coding Score: 864

Monthly Coding Score: 6

Weekly Coding Score: 5

- Anagram
- Number of Unique Paths
- Rotation
- Search in a Rotated Array
- Maximize Toys
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- First Repeating Element
- Count Occurences of Anagrams
- Reverse words in a given string
- Activity Selection
- Remove “b” and “ac” from a given string
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Finding Number
- Amount of Water
- Segregate even and odd nodes in a Linked List
- Longest Distinct characters in string
- N meetings in one room
- Maximum sum increasing subsequence
- Array to BST
- Max Sum without Adjacents
- Key Pair
- Reverse Bits
- Reach the Nth point
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Inorder Traversal and BST
- Triplet Sum in Array
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Cutted Segments
- Equilibrium point
- Buildings receiving sunlight
- Finding the numbers
- LCS with permutations
- Chocolate Distribution Problem
- Binary Tree K level sum
- Exit Point in a Matrix
- Maximum Sum Bitonic Subsequence
- 1[0]1 Pattern Count
- Sum of k smallest elements in BST
- Flood fill Algorithm
- Find Nth root of M
- Find largest word in dictionary
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Excel Sheet | Part - 2
- Longest Palindromic Subsequence
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Common elements
- Rod Cutting
- Element with left side smaller and right side greater
- Array Subset of another array
- Paths to reach origin
- Get Minimum Squares
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Mr Modulo and Pairs
- Swapping pairs make sum equal
- Maximum sum Problem
- Minimum indexed character
- Stickler Thief
- Remaining String
- Count the triplets
- Special Numbers
- Ease the Array
- Print Bracket Number
- Reverse 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.
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- 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
- BFS of graph
- 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
- Level order traversal Line by Line
- Largest subarray with 0 sum
- Minimum Depth of a Binary Tree
- Odd even level difference
- Max sum in the configuration
- Leaf at same level
- Distinct occurrences
- Josephus problem
- Longest Consecutive Subsequence
- Find duplicates in an array
- Count distinct elements in every window
- Root to leaf paths sum
- Three way partitioning
- Sort a stack
- Level order traversal
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Reverse a string using Stack
- Vertical sum
- Count Pairs whose sum is equal to X
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Sum of the Longest Bloodline of a Tree
- Check if two Nodes are Cousins

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Sum Of Prime
- Excel Sheet | Part - 1
- Print Diagonally
- Maximum Index
- 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)
- Egg Dropping Puzzle
- Edit Distance
- Consecutive 1's not allowed
- Count of Subarrays
- Longest Even Length Substring
- Path in Matrix
- Trapping Rain Water
- String formation from substring
- Subset Sum Problem
- Number of Coins
- Find Prime numbers in a range
- 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
- Relative Sorting
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Row with max 1s
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Special Keyboard
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Preorder to Postorder
- Length of the longest substring
- Longest consecutive subsequence
- Stock span problem
- Convert an array to reduced form
- M-Coloring Problem
- Subsequence matching
- Palindromic Array
- Is Binary Number Multiple of 3
- Preorder Traversal and BST
- Number of pairs
- Circle of strings
- Special Matrix
- Next larger element
- Composite and Prime
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Combination Sum - Part 2
- Word Break
- Kth smallest element
- Divisible by 8
- Count Divisors of Factorial
- Prime Factors and their Powers
- Longest Common Substring
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Knight Walk
- Find all four sum numbers
- Word Boggle
- 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
- Stepping Numbers
- Smallest window in a string containing all the characters of another string
- Floyd Warshall
- Infix to Postfix
- Smallest Positive missing number
- Longest Bitonic subsequence
- Maximum Intervals Overlap
- Perfect Sum Problem
- Page Faults in LRU
- Rotten Oranges
- Longest Common Prefix in an Array
- Steps by Knight
- Median In a Row-Wise sorted Matrix
- Optimal Strategy For A Game
- 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
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Topological sort
- Print a Binary Tree in Vertical Order
- Find the number of islands
- Circular tour
- Wildcard Pattern Matching
- Max rectangle
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Interleaved Strings
- Box Stacking
- Multiply two strings
- Minimum Swaps to Sort
- Rat in a Maze Problem
- Find the Closest Element in BST
- Duplicate subtree in Binary Tree
- Count ways to N'th Stair(Order does not matter)