- Search an Element in an array
- Binary String
- LCM And GCD
- Power of 2
- Pythagorean Triplet
- Majority Element
- Sieve of Eratosthenes
- Count possible triangles
- Dice throw
- Rotate Array
- Permutations of a given string
- Missing number in array
- Number of paths
- Count total set bits
- Number is sparse or not
- Bit Difference
- Immediate Smaller Element
- Number of occurrence
- Check if a number is power of another number
- Find position of set bit
- Sum of all prime numbers between 1 and N.
- Generate Binary Numbers
- Find the Odd Occurence
- Angle between hour and minute hand
- Rotating an Array
- Rotate by 90 degree
- Reverse array in groups
- Longest Consecutive 1's
- Minimize the sum of product
- Squares in a Matrix
- Find first and last occurrence of x
- Type of array
- Sum of dependencies in a graph
- Sort in specific order
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Unique Numbers
- Find first set bit
- Find first repeated character
- Does array represent Heap
- Find the element that appears once in sorted array
- Print an array in Pendulum Arrangement
- First element to occur k times
- Check whether K-th bit is set or not
- Uncommon characters
- Rotate Bits
- Check if a string is Isogram or not
- Rightmost different bit
- Set kth bit
- Toggle bits given range
- Print first n Fibonacci Numbers
- Closest Number
- Boolean String Value
- Absolute Difference of 1
- Find the fine
- Find the closest number
- Remove consonants from a string
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Ishaan Loves Chocolates
- Gray Code
- Gray to Binary equivalent
- Game of Function
- Pairing the brackets
- Unit Digit
- Print Linked List elements
- Node at a given index in linked list
- Delete node in Doubly Linked List
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Doubly linked list Insertion
- Binary Search
- Convert to Roman No
- Implement strstr
- Search a node in BST
- Remainder with 7
- Implement Atoi
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Modular Node
- Queue Reversal
- Insert in Middle of Linked List

**Currently practice data is being synced. Please try after sometime.

Name

Arushi Garg

Rank in Institute

#5

Courses Attended

Campus Ambassador

Overall Coding Score: 1825

Monthly Coding Score: 0

Weekly Coding Score: 0

- Anagram
- Print Pattern
- Search in a Rotated Array
- Squares in N*N Chessboard
- Maximize Toys
- Trailing zeroes in factorial
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Count Occurences of Anagrams
- Reverse words in a given string
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Element that appears once where every element occurs twice
- Longest Distinct characters in string
- Count distinct pairs with difference k
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Reverse Bits
- Lucky Number
- Subarray with given sum
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Inorder Traversal and BST
- Next in Series
- Possible paths
- Minimum element in a sorted and rotated array
- Number Of Open Doors
- Chinky and diamonds
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Longest Common Increasing Subsequence
- Skip the work
- Valid Substring
- Count the Reversals
- Cutted Segments
- Equilibrium point
- Floor in a Sorted Array
- Buildings receiving sunlight
- Pairs with specific difference
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Sum of k smallest elements in BST
- Flood fill Algorithm
- Longest K unique characters substring
- Roman Number to Integer
- Decode the string
- Find all pairs with a given sum
- Check if frequencies can be equal
- Shortest distance in infinite tree
- Largest zigzag sequence
- Find the string in grid
- Longest Palindromic Subsequence
- Fractional Knapsack
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Common elements
- Rod Cutting
- Sequence of Sequence
- Transitive closure of a Graph
- Array Subset of another array
- First negative integer in every window of size k
- Get Minimum Squares
- Group Anagrams Together
- Count the elements
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Swapping pairs make sum equal
- String Ignorance
- Longest alternating subsequence
- Count of strings that can be formed using a, b and c under given constraints
- Count binary strings
- Minimum indexed character
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Maximum Product Cutting
- K-Ary Tree
- Check if a Integer is power of 8 or not
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Longest common prefix
- Maximum difference of zeros and ones in binary string
- Check if array contains contiguous integers with duplicates allowed
- Winner of an election
- Print Binary Tree levels in sorted order
- Arya's Long String
- Find the closest pair from two arrays
- Print Bracket Number
- Cutting Binary String
- Minimal moves to form a string
- Print adjacency list
- Sum to Primes
- Student Record
- Check the Brackets
- Jumping the Subtree
- Sum the Alternate Leaf Nodes
- Transmutation
- Sum Array
- Maximum Integer Value
- 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
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- K distance from root
- 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
- 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
- Postorder traversal from given Inorder and Preorder traversals
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Largest subarray of 0's and 1's
- 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
- Unique rows in boolean matrix
- Remove every k'th node
- Is Binary Tree Heap
- Validate an IP Address
- Multiply two linked lists
- Distinct occurrences
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Generate Grey Code Sequences
- Check whether BST contains Dead End
- Delete a Node in Single Linked List
- Kth largest element in BST
- Count distinct elements in every window
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Delete nodes greater than k
- Index Of an Extra Element
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Intersection of Two Linked Lists
- Insert in a Sorted List
- Split Singly Linked List Alternatingly
- Ancestors in Binary Tree
- Maximum path sum
- Perfect Binary Tree
- XOR Linked List
- Full binary tree
- Construct Tree from Inorder & Preorder
- Construct BST from Postorder
- Merge Lists Alternatingly
- Huffman Decoding-1
- Check if Tree is Isomorphic
- Depth of node
- pth common ancestor in BST
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Change of Key in BST
- Normal BST to Balanced BST
- Linked List Matrix
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Left Leaf Nodes
- Closest Neighbor in BST
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Rotate doubly Linked List
- Pairwise swap of nodes in LinkeList
- Mother Vertex

- Coin Change
- Kadane's Algorithm
- Complement
- Excel Sheet | Part - 1
- Maximum Sub Array
- Print Diagonally
- 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
- Longest Even Length Substring
- Path in Matrix
- String formation from substring
- 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
- Rearrange Array Alternately
- Relative Sorting
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Design a tiny URL or URL shortener
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Length of the longest substring
- Longest consecutive subsequence
- Stock span problem
- Minimum steps to get desired array
- Dimensions of Rectangle
- Handshakes
- Tic-Tac-Toe
- Number to words
- Palindromic Array
- Betting game
- Unique partitions
- Is Binary Number Multiple of 3
- Possible groups
- Preorder Traversal and BST
- Card Rotation
- Longest Arithmetic Progression
- Subsets with XOR value
- Jumbled Strings
- Palindromic Strings
- Max possible amount
- Bleak Numbers
- Super Primes
- Number of pairs
- Coin Piles
- Maximum XOR subset
- Maximum Profit
- Digit multiplier
- Circle of strings
- Queries on Strings
- Special Matrix
- Next larger element
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Subsets
- Matchsticks game
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Longest Prefix Suffix
- Kth smallest element
- Divisible by 8
- Maximum calorie
- Prime Factors and their Powers
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Negative weight cycle
- Hamiltonian Path
- Count the Number of Full Binary Trees
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Divisibility tree
- Trie | (Insert and Search)
- Replace O's with X's
- Knight Walk
- Find all four sum numbers
- Count of AP Subsequences
- Word Boggle
- Max absolute difference
- Is Sudoku Valid
- Find whether path exist
- Largest prime factor
- Check Mirror in N-ary tree
- Unit Area of largest region of 1's
- Rearrange characters
- Express as sum of power of natural numbers
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- Count in array
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Minimum number of steps to reach a given number.
- Floyd Warshall
- Infix to Postfix
- Smallest Absolute Difference
- Geek collects the balls
- Largest Sum Subarray of Size at least K
- Smallest Positive missing number
- Longest Bitonic subsequence
- Mobile numeric keypad
- Pyramid form
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Minimum Time
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Page Faults in LRU
- Count possible ways to construct buildings
- Firing employees
- Rotten Oranges
- Modify array to maximize sum of adjacent differences
- LCS of three strings
- Longest repeating and non-overlapping substring
- Longest Common Prefix in an Array
- Minimum cost to fill given weight in a bag
- Count even length
- Steps by Knight
- Numbers with alternative 1's
- Matrix Chain Multiplication
- Maximum Tip Calculator
- Series with largest GCD and sum equals to N
- Pizza Mania
- Killing Spree
- Mike and Photographic Memory
- Lazy Pasha
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K
- Beautiful SubSequence
- The Tiny Miny
- String Conversion
- Container with most water
- Buying Vegetables
- The Painter's Partition Problem
- Castle RUN
- Possible paths between 2 vertices
- Optimal Strategy For A Game
- The Game of Digits
- Sorting distance
- Maximum number evaluation
- Increment and Move
- 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
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- 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
- Clone a Binary Tree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Interleaved Strings
- Sum of permutations
- LRU Cache
- Box Stacking
- Multiply two strings
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Bipartite Graph
- Max sum subarray by removing at most one element
- 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
- k-th smallest element in BST
- Polynomial Addition
- Euler Circuit in a Directed Graph
- Euler circuit and Path
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Occurences of 2 as a digit
- Populate Inorder Successor for all nodes
- K-Sum Paths
- Foldable Binary Tree
- Construct tree from Inorder and LevelOrder
- Node at distance
- Leaves to DLL
- Largest Independent Set Problem
- Right Sibling in Binary Tree
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Trapping Rain Water
- Unique BST's
- Unit Area of largest region of 1's
- Longest consecutive subsequence
- Count ways to N'th Stair(Order does not matter)

- Minimum Points To Reach Destination
- Minimum sum partition
- Maximum of minimum for every window size
- 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
- N-Queen Problem
- Solve the Sudoku
- Find median in a stream
- Travelling Salesman Problem
- Max Circular Subarray Sum
- Minimum number of elements
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array
- Phone directory
- Count the subarrays having product less than k
- Queries on a Matrix
- Adventure in a Maze
- Santa and Gift
- Reorder List
- Binary Tree to DLL
- Alien Dictionary
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Solve the Sudoku