- Height of Binary Tree
- Binary String
- Finding middle element in a linked list
- Square root
- Inorder Traversal
- Preorder Traversal
- Count Leaves in Binary Tree
- Implement strstr
- Replace all 0's with 5
- Implement Queue using Linked List
- Implement Stack using Linked List
- Binary String
- Consecutive elements
- Power of 2
- Rotate Array
- Permutations of a given string
- Swap two nibbles in a byte
- Maximum product of two numbers
- Number of paths
- Count total set bits
- Bit Difference
- Greater on right side
- Binary Array Sorting
- Convert array into Zig-Zag fashion
- Remove character
- Number of occurrence
- Minimum difference pair
- Sum of all prime numbers between 1 and N.
- Pattern Jumping
- Maximum money
- Generate Binary Numbers
- Find the Odd Occurence
- Keypad typing
- Rotate by 90 degree
- Set Bits
- String Reversal
- Reverse each word in a given string
- Check if string is rotated by two places
- Unique Numbers
- Substrings with similar first and last characters
- Geek and Coffee Shop
- Find the element that appears once in sorted array
- Uncommon characters
- Sorted matrix
- Check set bits
- Twice counter
- Total number of Strings
- Find the Highest number
- How Many X's?

Name

Prerna Suneja

Rank in Institute

#34

Campus Ambassador

Overall Coding Score: 509

Monthly Coding Score: 0

Weekly Coding Score: 0

- Josephus problem
- Match specific pattern
- Kth largest element in BST
- Expression Tree
- Root to leaf paths sum
- Equilibrium index of an array
- Max sum in the configuration
- Odd even level difference
- Minimum Depth of a Binary Tree
- Print BST elements in given range
- Implement two stacks in an array
- Maximum path sum
- Reverse words in a given string
- Remove Half Nodes
- Diagonal Sum In Binary Tree
- Children Sum Parent
- Maximum Node Level
- Check if Tree is Isomorphic
- Vertical sum
- Symmetric Tree
- Max Level Sum in Binary Tree
- Disjoint set (Union-Find)
- Union of Two Linked Lists
- Index Of an Extra Element
- Peak element
- Level order traversal
- Sort a stack
- Given a linked list of 0s, 1s and 2s, sort it.
- Special Stack
- Maximum Width of Tree
- Transform to Sum Tree
- Merge two sorted linked lists
- Delete Middle of Linked List
- Left View of Binary Tree
- Nth node from end of linked list
- Heap Sort
- Check for Balanced Tree
- Diameter of Binary Tree
- Absolute List Sorting
- Two Mirror Trees
- Mirror Tree
- K distance from root
- Right View of Binary Tree
- Detect Loop in linked list
- Linked List in Zig-Zag fashion
- Add 1 to a number represented as linked list
- Reverse a linked list
- Lowest Common Ancestor in a BST
- Root to leaf path sum
- Find Transition Point
- DFS of Graph
- Determine if Two Trees are Identical
- Anagram
- Count Occurences of Anagrams
- Reverse words in a given string
- Move all zeroes to end of array
- Remove “b” and “ac” from a given string
- Sort an array of 0s, 1s and 2s
- Maximum value in a bitonic array
- Next greater number set digits
- Finding Position
- Segregate even and odd nodes in a Linked List
- Element that appears once where every element occurs twice
- Column name from a given column number
- N meetings in one room
- Addition of submatrix
- Product array puzzle
- Reverse Bits
- Count number of hops
- Triplet Sum in Array
- Count the Zeros
- Final Destination
- Element appearing once
- Binary Tree K level sum
- Exit Point in a Matrix
- 1[0]1 Pattern Count
- Decode the pattern
- Roman Number to Integer
- Find the string in grid
- Evaluation of Postfix Expression
- Second most repeated string in a sequence
- Number of Groups
- Stickler Thief
- Sum of Lengths of Non-Overlapping SubArrays
- Prime number of set bits
- C++ Matrix Rotation by 180 degree

- Binary Tree to CDLL
- Wildcard Pattern Matching
- Boundary Traversal of binary tree
- Delete a node from BST
- Find the number of islands
- Detect cycle in a directed graph
- Leaves to DLL
- Check for BST
- Min distance between two given nodes of a Binary Tree
- Construct Tree from Preorder Traversal
- Smallest Positive missing number
- Unique BST's
- Unit Area of largest region of 1's
- Count ways to N'th Stair(Order does not matter)
- Delete without head pointer
- Minimum Spanning Tree
- Largest BST
- Remove loop in Linked List
- LRU Cache
- Add all greater values to every node in a BST
- Bipartite Graph
- Diagonal Traversal of Binary Tree
- Delete keys in a Linked list
- Clone a Binary Tree
- Extreme nodes in alternate order
- k-th smallest element in BST
- Make Binary Tree From Linked List
- Max rectangle
- Intersection Point in Y Shapped Linked Lists
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Print Diagonally
- Longest Increasing Subsequence
- Count ways to N'th Stair(Order does not matter)
- Maximum Rectangular Area in a Histogram
- Factorials of large numbers
- Number following a pattern
- Longest Palindrome in a String
- Largest square formed in a matrix
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Sum of Query II
- Longest consecutive subsequence
- Stock span problem
- Palindromic Array
- X Total Shapes
- Unique BST's
- Word Break
- Kth smallest element
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Number of Palindromic paths in a Matrix
- Is Sudoku Valid
- Find whether path exist
- Unit Area of largest region of 1's
- Rearrange characters
- Infix to Postfix
- Smallest Positive missing number
- Maximum Intervals Overlap
- Rotten Oranges
- Steps by Knight