Name

Raghav Saboo

Rank in Institute

#8

Courses Attended

Other Profile Link

Overall Coding Score: 1356

Monthly Coding Score: 0

Weekly Coding Score: 0

- Binary String
- Pythagorean Triplet
- Majority Element
- Permutations of a given string
- Missing number in array
- Convert array into Zig-Zag fashion
- Maximum repeating number
- Generate Binary Numbers
- Check if two arrays are equal or not
- Find first repeated character
- Find the element that appears once in sorted array
- First element to occur k times
- Uncommon characters
- Wildcard string matching
- Longest Common Prefix in an Array
- Print first n Fibonacci Numbers
- Check if strings are rotations of each other or not
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Implement strstr
- Search a node in BST
- Implement Atoi
- Linked List Insertion

- Anagram
- Number of Unique Paths
- Wave Array
- Print Pattern
- Rotation
- Rectangles in N*N Board
- Squares in N*N Chessboard
- Maximize Toys
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Reverse words in a given string
- Count Substrings
- Move all zeroes to end of array
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Next greater number set digits
- Segregate even and odd nodes in a Linked List
- Element that appears once where every element occurs twice
- Longest Distinct characters in string
- Sum of Query I
- Maximum Product Subarray
- N meetings in one room
- Remove minimum elements
- Remove Duplicates
- Maximum sum increasing subsequence
- Reach the Nth point
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Inorder Traversal and BST
- Triplet Sum in Array
- Reach a given score
- Search in a matrix
- Shop in Candy Store
- 0 - 1 Knapsack Problem
- Valid Substring
- Next larger element
- Equilibrium point
- Maximize Dot Product
- Chocolate Distribution Problem
- Binary Tree K level sum
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Roman Number to Integer
- Gold Mine Problem
- Smallest subarray with sum greater than x
- Find Nth root of M
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Largest zigzag sequence
- Excel Sheet | Part - 2
- Smallest window in a string containing all the characters of another string
- Longest Palindromic Subsequence
- Rod Cutting
- Element with left side smaller and right side greater
- Transitive closure of a Graph
- Array Subset of another array
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Swapping pairs make sum equal
- Toppers Of Class
- Count of strings that can be formed using a, b and c under given constraints
- Minimum indexed character
- Stickler Thief
- Geek and its Colored Strings
- Sum of Lengths of Non-Overlapping SubArrays
- Roll the characters of a String
- K-Ary Tree
- Min Manipulations to make Strings Anagram
- Numbers containing 1, 2 and 3
- Maximum height of the staircase
- Print Binary Tree levels in sorted order
- Print Bracket Number
- Cutting Binary String
- Save Ironman
- SP - Palindrome Family
- SP - Beautiful Pairs
- SPP - Stack Design
- SPP - BST Traversal
- SPP - Second Smallest in Range
- SPP - Wolfish
- SPP - K
^{th}largest and smallest - SPP - Greatest Digital Root
- SPP - The Last Battle
- 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.
- Add two numbers represented by linked lists
- Rearrange a linked list
- Merge 2 sorted linked list in reverse order
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Reverse a Doubly Linked List
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- N
^{th}node from end of linked list - Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- 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
- Reverse alternate levels of a perfect binary tree
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- 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
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Max sum path in two arrays
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- K-Palindrome
- Get minimum element from stack
- Remove every k'th node
- Is Binary Tree Heap
- Multiply two linked lists
- Josephus problem
- You and your books
- Expression Tree
- Check if Linked List is Palindrome
- Generate Grey Code Sequences
- Kth largest element in BST
- Multiply two polynomials II
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Level order traversal
- Inorder Successor in BST
- Delete nodes greater than k
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Root to Leaf Paths
- Maximum path sum
- Linked List that is Sorted Alternatingly
- Modify Linked List-1
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Vertical sum
- Check if Tree is Isomorphic
- Predecessor and Successor
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Deletion and Reverse in Linked List
- K-Nearest Neighbours
- Normal BST to Balanced BST
- Leaf under budget
- Linked List Matrix
- Height of Spiral Tree
- Closest Neighbor in BST
- Sum of Leaf Nodes at Min Level

- Coin Change
- Kadane's Algorithm
- Excel Sheet | Part - 1
- Maximum Sub Array
- Overlapping Intervals
- Maximum Index
- Next Permutation
- 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
- Count of n digit numbers whose sum of digits equals to given sum
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Min Coin
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Trapping Rain Water
- String formation from substring
- Subset Sum Problem
- Number of Coins
- Stock buy and sell
- Largest Number formed from an Array
- Number of paths in a matrix with k coins
- Jumping Numbers
- Longest Palindrome in a String
- Relative Sorting
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- 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
- Largest subsquare surrounded by ‘X’
- Stock span problem
- M-Coloring Problem
- Is Binary Number Multiple of 3
- Distributing Balls
- Preorder Traversal and BST
- Longest Arithmetic Progression
- Subsets with XOR value
- Max possible amount
- Circle of strings
- Queries on Strings
- Special Matrix
- Minimize the heights
- Composite and Prime
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Subsets
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Longest Prefix Suffix
- K
^{th}smallest element - Transform String
- Count Divisors of Factorial
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Trie | (Insert and Search)
- Replace O's with X's
- Knight Walk
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Is Sudoku Valid
- 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
- K
^{th}largest element in a stream - Water Overflow
- Zero Sum Subarrays
- Magnet Array Problem
- Smallest distinct window
- Floyd Warshall
- Huffman Encoding
- Infix to Postfix
- Largest Sum Subarray of Size at least K
- Longest Bitonic subsequence
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Word Wrap
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Page Faults in LRU
- Count possible ways to construct buildings
- Rotten Oranges
- Probability of Knight
- Two water Jug problem
- CamelCase Pattern Matching
- Steps by Knight
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Maximum Tip Calculator
- Count subarrays with equal number of 1’s and 0’s
- Geek and Strings
- The Painter's Partition Problem
- SP - Special Subsequences
- SPP - Playing with Stacks
- SPP - Two digits of Fibonacci
- Given a linked list, reverse alternate nodes and append at the end
- 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
- 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
- Topological sort
- Print a Binary Tree in Vertical Order
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Circular tour
- Wildcard Pattern Matching
- Max rectangle
- Make Binary Tree
- Check if subtree
- Extreme nodes in alternate order
- Kth element in Matrix
- 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
- Multiply two strings
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Bipartite Graph
- Maximum subset XOR
- Find the Closest Element in BST
- Pots of Gold Game
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Print Nodes having K leaves
- Duplicate subtree in Binary Tree
- 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
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- Node at distance
- Pairs violating BST property
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- SPP - K Sum

- Minimum Points To Reach Destination
- Minimum sum partition
- Maximum of minimum for every window size
- Merge Two Sorted Arrays
- Allocate minimum number of pages
- Number Formation
- Boolean Parenthesization
- Longest valid Parentheses
- Minimum Cost Path
- N-Queen Problem
- Solve the Sudoku
- Find median in a stream
- Travelling Salesman Problem
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Phone directory
- Count the subarrays having product less than k
- Doctor Strange
- Kill Captain America
- SP - Range Queries
- SP - The Placement Tour
- SP - Matrix Series
- SPP - Final Destination
- SPP - Jumping the Subtree
- SPP - Partition
- SPP - CamelCase
- QuickSort on Doubly Linked List
- Reorder List
- Binary Tree to DLL
- AVL Tree Insertion
- Alien Dictionary
- AVL Tree Deletion
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST