Name

Yenni Kaushik

Institution

Rank in Institute

#1

Courses Attended

Overall Coding Score: 1383

Monthly Coding Score: 0

Weekly Coding Score: 0

- Mirror Tree
- Max sum path in two arrays
- Max sum in the configuration
- Expression Tree
- Max Level Sum in Binary Tree
- Merge Sort for Linked List
- Level of a Node in Binary Tree
- Vertical sum
- Count Pairs whose sum is equal to X
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Remove Half Nodes
- Key Pair

- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- 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
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- Range Minimum Query
- The Celebrity Problem
- Topological sort
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Wildcard Pattern Matching
- Max rectangle
- Make Binary Tree From Linked List
- Generate IP Addresses
- Check if subtree
- Extreme nodes in alternate order
- Clone a Binary Tree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Largest BST
- Interleaved Strings
- LRU Cache
- Box Stacking
- Rat in a Maze Problem
- Max sum subarray by removing at most one element
- 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
- Bridge Edge in Graph
- Print Nodes having K leaves
- Top View of Binary Tree
- Smallest range in K lists
- k-th smallest element in BST
- Polynomial Addition
- Binary Tree to CDLL
- Find a pair with given target in BST
- Occurences of 2 as a digit
- Populate Inorder Successor for all nodes
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- 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
- Duplicate Subtrees
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Path Count in Directed Graph
- 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
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- M-Coloring Problem
- Count ways to N'th Stair(Order does not matter)
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Complement
- Rank The Permutations
- Excel Sheet | Part - 1
- Maximum Sub Array
- Overlapping Intervals
- Maximum Index
- 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
- Count of n digit numbers whose sum of digits equals to given sum
- Maximum Rectangular Area in a Histogram
- Min Coin
- Path in Matrix
- Trapping Rain Water
- String formation from substring
- Sum of bit differences
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Largest Number formed from an Array
- Number of paths in a matrix with k coins
- Possible words from Phone digits
- Jumping Numbers
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- 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
- Handshakes
- Tic-Tac-Toe
- Palindromic Array
- Betting game
- Unique partitions
- Is Binary Number Multiple of 3
- Possible groups
- Card Rotation
- Longest Arithmetic Progression
- Bleak Numbers
- Super Primes
- Maximum XOR subset
- Maximum Profit
- Digit multiplier
- Your Social Network
- Largest number in K swaps
- Special Matrix
- Minimize the heights
- Next larger element
- Total Decoding Messages
- Unique BST's
- Subsets
- Matchsticks game
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Longest Prefix Suffix
- Kth smallest element
- Divisible by 8
- Transform String
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Hamiltonian Path
- Count the Number of Full Binary Trees
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Replace O's with X's
- Find all four sum numbers
- Word Boggle
- Find whether path exist
- Check Mirror in N-ary tree
- 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
- Stepping Numbers
- Convex Hull
- K
^{th}largest element in a stream - Water Overflow
- Zero Sum Subarrays
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Huffman Encoding
- Nearly Sorted Algorithm
- Infix to Postfix
- Geek collects the balls
- Find minimum s-t cut in a flow network
- Smallest Positive missing number
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Top k numbers in a stream
- Page Faults in LRU
- Firing employees
- Rotten Oranges
- Probability of Knight
- Two water Jug problem
- Steps by Knight
- Row with minimum number of 1's
- Matrix Chain Multiplication
- Maximum Tip Calculator
- Leftmost Divisor
- Pizza Mania
- Killing Spree
- Number of subarrays with maximum values in given range
- Count of Palindromic substrings in an Index range
- Mike and Photographic Memory
- Fill the Tank
- Party in Town
- Lazy Pasha
- Longest subarray with sum divisible by K
- Subarrays with equal 1s and 0s
- Make Matrix Beautiful
- Longest Sub-Array with Sum K
- Sick Pasha
- Santa Banta
- The Tiny Miny
- Big Numbers Series
- Sum of XOR of all pairs
- String Conversion
- Grouping Of Numbers
- Geek and Strings
- Container with most water
- Save Gotham!
- Buying Vegetables
- The Painter's Partition Problem
- Aditya and his building blocks
- Shreyansh and his bits
- Minimum swaps and K together
- Maximize the sum of selected numbers from an array to make it empty
- Find the N-th character
- Large Factorials
- Lucky alive person in a circle
- count special palindromic
- Rat Maze With Multiple Jumps
- Construct binary palindrome by repeated appending and trimming
- Castle RUN
- Smaller on Left
- A difference of values and indexes
- Possible paths between 2 vertices
- Optimal Strategy For A Game

- Reorder List
- Binary Tree to DLL
- AVL Tree Insertion
- Maximum subset XOR
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Solve the Sudoku
- Minimum Points To Reach Destination
- Minimum sum partition
- Maximum of minimum for every window size
- Head to Tail ordering
- Merge Without Extra Space
- Next Smallest Palindrome
- Find sum of different corresponding bits for all pairs
- Return two prime numbers
- Allocate minimum number of pages
- A Simple Fraction
- Ugly Numbers
- Path of greater than equal to k length
- Boolean Parenthesization
- Longest valid Parentheses
- Word Break - Part 2
- Minimum Cost Path
- Strongly connected component (Tarjans's Algo)
- Find median in a stream
- Travelling Salesman Problem
- Find the Maximum Flow
- Max Circular Subarray Sum
- Minimum number of elements
- Very Tough Problem
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Similar expressions
- Convert to Strictly increasing array
- Phone directory
- Numbers with one absolute difference
- Bike Racing
- Adventure in a Maze
- Closest Palindrome
- Doctor Strange
- Minimum number to make median X