- Count nodes of linked list
- Finding middle element in a linked list
- Doubly linked list Insertion
- Preorder Traversal
- Search a node in BST
- Linked List Insertion
- Minimum element in BST
- Anagram of String
- Identical Linked Lists
- Insert in Middle of Linked List
- Sort and Reverse Vector
- Front to Back
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Reversing an Array
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- Majority Element
- Check if string is rotated by two places
- Check if strings are rotations of each other or not
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- GCD of Array
- Power of 2
- Missing number in array
- Number of paths
- Check if a number is power of another number
- Minimize the sum of product
- Pair cube count
- Product of maximum in first array and minimum in second
- Check if strings are rotations of each other or not
- Ishaan Loves Chocolates

Name

Yash Sharan

Rank in Institute

#3

Courses Attended

Campus Ambassador

Other Profile Link

Overall Coding Score: 867

Monthly Coding Score: 0

Weekly Coding Score: 0

- 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
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Merge Sort
- Right View of Binary Tree
- Mirror Tree
- 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
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Determine if Two Trees are Identical
- Root to leaf path sum
- Print all nodes that don't have sibling
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Odd even level difference
- Is Binary Tree Heap
- Distinct occurrences
- Josephus problem
- Check if Linked List is Palindrome
- Repetition of k length substring
- Count distinct elements in every window
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Level order traversal
- Peak element
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Sum of leaf nodes in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Children Sum Parent
- Find length of Loop
- Normal BST to Balanced BST
- Reverse First K elements of Queue
- Remove Half Nodes
- Nodes at Odd Levels
- Brothers From Different Roots
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- ArrayList Operation
- Get min at pop
- Min Heap implementation
- Max and Second Max
- Hashing for pair - 1
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Coin Change - Minimum number of coins
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Multiplicative Inverse
- Minimum adjacent difference in a circular array
- Power Of Numbers
- Wave Array
- Frequencies of Limited Range Array Elements
- Equilibrium point
- Leaders in an array
- Count 1's in binary array
- Minimum Number in a sorted rotated array
- Two Repeated Elements
- Subarray with given sum
- Print adjacency list
- Spirally traversing a matrix
- Exchange matrix columns
- Separate chaining in Hashing
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Subarray with 0 sum
- Winner of an election
- The Modified String
- Reverse words in a given string
- Minimum indexed character
- Pangram Checking
- Non Repeating Character
- Removing consecutive duplicates
- Activity Selection
- Largest number with given sum
- Count Total Digits in a Number
- Digital Root
- Ways to write n as sum
- Number of Unique Paths
- Print Pattern
- Search in a Rotated Array
- Squares in N*N Chessboard
- Maximize Toys
- Non Repeating Character
- First Repeating Element
- Reverse words in a given string
- Activity Selection
- Finding Position
- N meetings in one room
- Maximum sum increasing subsequence
- Subarray with given sum
- Leaders in an array
- Copy Set Bits in Range
- Largest number possible
- Count the Zeros
- Skip the work
- Maximize The Cut Segments
- Game of Death in a circle
- Left out candies
- Ordering of strings
- Equilibrium point
- Chocolate Distribution Problem
- Maximum Sum Bitonic Subsequence
- Reverse Coding
- Friends Pairing Problem
- Minimum Operations
- Longest Palindromic Subsequence
- Recursive sequence
- Sort the given array after applying the given equation
- Nth number made of prime digits
- Longest subsequence-1
- Stickler Thief
- Count the triplets
- Numbers containing 1, 2 and 3
- Next Happy Number
- Winner of an election
- Ease the Array
- Print Bracket Number
- Minimal moves to form a string

- Reverse a Linked List in groups of given size.
- Count BST nodes that lie in a given range
- Check for BST
- 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
- Connect Nodes at Same Level
- Flattening a Linked List
- Boundary Traversal of binary tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- Get minimum element from stack
- Circular tour
- Wildcard Pattern Matching
- Max rectangle
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Interleaved Strings
- LRU Cache
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Number of root to leaf paths
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge k Sorted Arrays
- Top View of Binary Tree
- k-th smallest element in BST
- Binary Tree to CDLL
- Find a pair with given target in BST
- Count More than n/k Occurences
- Foldable Binary Tree
- Pairs violating BST property
- Leaves to DLL
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Smallest Positive missing number
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Trapping Rain Water
- Stock buy and sell
- Unique BST's
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- Parenthesis Checker
- Job Sequencing Problem
- Minimum Platforms
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Longest Increasing Subsequence
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- 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
- Maximum Rectangular Area in a Histogram
- Consecutive 1's not allowed
- Trapping Rain Water
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Largest Number formed from an Array
- Longest Palindrome in a String
- Rearrange Array Alternately
- Relative Sorting
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- 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
- Longest consecutive subsequence
- Stock span problem
- Handshakes
- Is Binary Number Multiple of 3
- Coin Piles
- Minimize the heights
- Next larger element
- Total Decoding Messages
- Unique BST's
- Kth smallest element
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- 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 Positive missing number
- Longest Bitonic subsequence
- LCS of three strings
- In First But Second
- Maximum Tip Calculator
- Count only Repeated