- Binary String
- Repetitive Addition Of Digits
- Nth Fibonacci Number
- Print the Kth Digit
- Majority Element
- Shortest path from 1 to n
- Rotate Array
- Missing number in array
- Swap two nibbles in a byte
- Count total set bits
- Bit Difference
- Greater on right side
- Convert array into Zig-Zag fashion
- Number of occurrence
- k largest elements
- Minimum difference pair
- Find position of set bit
- Pattern Jumping
- Maximum money
- Ways To Tile A Floor
- Middle of Three
- Generate Binary Numbers
- Smallest number
- Count the numbers
- Set Bits
- Replace the Bit
- Form a Triangle
- Sum of dependencies in a graph
- Sort in specific order
- Check if string is rotated by two places
- Find first set bit
- Geek and Coffee Shop
- Find the element that appears once in sorted array
- Swap and Maximize
- Check set bits
- Stable Sort and Position
- Elements in the Range
- Odd to Even
- Total number of Strings
- Minimum Distinct Ids
- Empty The Tank
- Rearrange the array
- How Many X's?
- Tower of Hanoi
- Count nodes of linked list
- Size of Binary Tree
- Inorder Traversal
- Height of Binary Tree
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using array
- Square root
- Insert a node in Doubly linked list
- Convert to Roman No
- Preorder Traversal
- Implement strstr
- Implement Atoi
- Circular Linked List Traversal
- Delete Alternate Nodes
- Maximum in Struct Array
- Sum of Binary Tree

Name

tanya sharma

Rank in Institute

#37

Courses Attended

Campus Ambassador

Overall Coding Score: 1082

Monthly Coding Score: 88

Weekly Coding Score: 0

- Frequencies of Limited Range Array Elements
- Print Pattern
- Rectangles in N*N Board
- Squares in N*N Chessboard
- Subarray with least average
- Magic Number
- Maximize Number of 1's
- First Repeating Element
- Count Occurences of Anagrams
- Remove all duplicates from a given string
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Finding Number
- Maximum value in a bitonic array
- Next greater number set digits
- Finding Position
- Does robot moves circular
- Column name from a given column number
- Maximum Product Subarray
- N meetings in one room
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Max Sum without Adjacents
- Maximum Difference
- Product array puzzle
- Length Unsorted Subarray
- Reverse Bits
- Count Smaller elements
- Reach the Nth point
- Adjacents are not allowed
- Count number of hops
- Equal to product
- Count pairs with given sum
- Cutting Rectangles
- Triplet Sum in Array
- Three Great Candidates
- K closest elements
- Possible paths
- Minimum element in a sorted and rotated array
- Search in a matrix
- Fibonacci Sum
- Day of the week
- Shop in Candy Store
- Valid Substring
- Tom and Jerry
- Cutted Segments
- Final Destination
- Arithmetic Number
- Left out candies
- Element appearing once
- Equilibrium point
- Floor in a Sorted Array
- Min Number of Flips
- Pairs with specific difference
- Min sum formed by digits
- Min Subsets with Consecutive Numbers
- Move all negative elements to end
- Chocolate Distribution Problem
- Exit Point in a Matrix
- Maximum Sum Bitonic Subsequence
- 1[0]1 Pattern Count
- Knapsack with Duplicate Items
- Let's Play!!!
- Pair with greatest product in array
- Decode the pattern
- Roman Number to Integer
- Maximum no of 1's row
- Drive the car
- Friends Pairing Problem
- Gold Mine Problem
- Smallest subarray with sum greater than x
- Game of XOR
- Sum of all substrings of a number
- Longest Palindromic Subsequence
- Fractional Knapsack
- Maximum difference Indexes
- Common elements
- Rod Cutting
- Element with left side smaller and right side greater
- Sequence of Sequence
- Transitive closure of a Graph
- Count the paths
- First negative integer in every window of size k
- Game with String
- Paths to reach origin
- Subarray with 0 sum
- Subarrays with given sum
- Group Anagrams Together
- Sum equals to Sum
- Find Pair Given Difference
- Second most repeated string in a sequence
- Shortest Common Supersequence
- Assign Mice Holes
- Mr Modulo and Pairs
- Painting the Fence
- Find distinct elements
- Sort by Absolute Difference
- Number of Groups
- Minimum steps to minimize n as per given condition
- Bitonic Generator Sort
- Ways to write n as sum
- Longest subsequence-1
- Maximum sum Problem
- Longest Repeating Subsequence
- Stickler Thief
- Sum of Lengths of Non-Overlapping SubArrays
- Maximum possible sum
- Roll the characters of a String
- Prime number of set bits
- Minimum rotations to unlock a circular lock
- Numbers containing 1, 2 and 3
- Longest sub-sequence such that difference between adjacents is one
- Maximum distinct elements after removing K elements
- Maximum difference of zeros and ones in binary string
- Check if array contains contiguous integers with duplicates allowed
- Maximum height of the staircase
- Ease the Array
- Print Bracket Number
- Print adjacency list
- Add 1 to a number represented as linked list
- Compare two linked lists
- Merge 2 sorted linked list in reverse order
- 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
- Two Mirror Trees
- 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
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- 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
- 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
- Max sum in the configuration
- Equilibrium index of an array
- Leaf at same level
- Match specific pattern
- Distinct occurrences
- Sorted subsequence of size 3
- Expression Tree
- Points in Straight Line
- Maximum Difference
- Check if Linked List is Palindrome
- Max distance between same elements
- Delete a Node in Single Linked List
- Kth largest element in BST
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Level order traversal
- Peak element
- Inorder Successor in BST
- Delete nodes greater than k
- Index Of an Extra Element
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Disjoint set (Union-Find)
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Root to Leaf Paths
- Maximum path sum
- Perfect Binary Tree
- Counting elements in two arrays
- Linked List that is Sorted Alternatingly
- XOR of a given range
- Full binary tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Huffman Decoding
- Vertical sum
- Check if Tree is Isomorphic
- Find length of Loop
- Sum of Leaf Nodes
- Sum of Left Leaf Nodes
- Sum of the Longest Bloodline of a Tree
- Reverse words in a given string

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Sub Array
- Overlapping Intervals
- Next Permutation
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Maximum Rectangular Area in a Histogram
- Longest Even Length Substring
- Path in Matrix
- Trapping Rain Water
- Factorials of large numbers
- 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
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Sorting Elements of an Array by Frequency
- Design a tiny URL or URL shortener
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Longest consecutive subsequence
- Stock span problem
- Palindromic Array
- Coin Piles
- Minimum sum
- Minimize the heights
- Next larger element
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Word Break
- Kth smallest element
- Longest Common Substring
- Negative weight cycle
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Knight Walk
- Distance of nearest cell having 1
- Is Sudoku Valid
- Find whether path exist
- Rearrange characters
- Count subsequences of type a^i b^j c^k
- Stepping Numbers
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Floyd Warshall
- Huffman Encoding
- Infix to Postfix
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Minimum Time
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Rotten Oranges
- Two water Jug problem
- Minimum cost to fill given weight in a bag
- Count even length
- Steps by Knight
- In First But Second
- Matrix Chain Multiplication
- Longest subarray with sum divisible by K
- Subarrays with equal 1s and 0s
- Minimum swaps and K together
- 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
- Flattening a Linked List
- Diagonal 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
- 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
- Make Binary Tree From Linked List
- 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
- LRU Cache
- Minimum Swaps to Sort
- Rat in a Maze Problem
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- k-th smallest element in BST
- Polynomial Addition
- Euler circuit and Path
- Merge Sort on Doubly Linked List
- Count More than n/k Occurences
- Populate Inorder Successor for all nodes
- K-Sum Paths
- Leftmost and rightmost nodes of binary tree
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Smallest Positive missing number
- Unique BST's
- Unit Area of largest region of 1's

- Minimum sum partition
- Merge Without Extra Space
- Find sum of different corresponding bits for all pairs
- N-Queen Problem
- Find median in a stream
- Max Circular Subarray Sum
- Convert to Strictly increasing array
- Count the subarrays having product less than k
- Reorder List
- Binary Tree to DLL
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST