- Power of 2
- Pythagorean Triplet
- Majority Element
- Permutations of a given string
- Missing number in array
- Number of paths
- Count total set bits
- Number is sparse or not
- Bit Difference
- Convert array into Zig-Zag fashion
- k largest elements
- Find position of set bit
- Find the Odd Occurence
- Reverse array in groups
- Set Bits
- Longest Consecutive 1's
- Minimize the sum of product
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Find first repeated character
- Find the element that appears once in sorted array
- Last index of One
- First element to occur k times
- Check whether K-th bit is set or not
- Uncommon characters
- Rotate Bits
- Max Sum Subarray of size K
- Rightmost different bit
- Set kth bit
- Toggle bits given range
- Print first n Fibonacci Numbers
- Remove common characters and concatenate
- Repeated Character
- Check if strings are rotations of each other or not
- Height of Heap
- Game of Function
- Pairing the brackets
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Implement Stack using Linked List
- Implement Queue using Linked List
- Binary Search
- Preorder Traversal
- Implement strstr
- Search a node in BST
- Implement Atoi
- Find triplets with zero sum
- Minimum element in BST

Name

fus ro dah

Rank in Institute

#62

Courses Attended

Campus Ambassador

Overall Coding Score: 877

Monthly Coding Score: 214

Weekly Coding Score: 0

- Anagram
- Search in a Rotated Array
- Maximize Toys
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- 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
- Longest Distinct characters in string
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Reverse Bits
- Subarray with given sum
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Inorder Traversal and BST
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Tom and Jerry
- Cutted Segments
- Largest number with given sum
- Equilibrium point
- Flip Bits
- Help Nobita
- Chocolate Distribution Problem
- Flood fill Algorithm
- Roman Number to Integer
- Game of XOR
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Longest Palindromic Subsequence
- Fractional Knapsack
- K-th element of two sorted Arrays
- Common elements
- Rod Cutting
- Element with left side smaller and right side greater
- Transitive closure of a Graph
- Array Subset of another array
- Subarray with 0 sum
- Second most repeated string in a sequence
- Shortest Common Supersequence
- Swapping pairs make sum equal
- String Ignorance
- Jumping Caterpillars
- Minimum indexed character
- Stickler Thief
- Power Set
- Geek and its Colored Strings
- Count the triplets
- Special Numbers
- Longest common prefix
- Smallest greater elements in whole array
- Save Ironman
- Print adjacency list
- Pair with given sum in a sorted array
- Sum to Primes
- Student Record
- Check the Brackets
- Jumping the Subtree
- Sum the Alternate Leaf Nodes
- Reverse 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
- Detect Loop in linked list
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- Mirror 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
- Queue using two Stacks
- Stack using two queues
- Level order traversal in spiral form
- 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
- Lowest Common Ancestor in a BST
- Binary Heap Operations
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Largest subarray with 0 sum
- Unique rows in boolean matrix
- Josephus problem
- Maximum Difference
- Check if Linked List is Palindrome
- Longest Consecutive Subsequence
- Find duplicates in an array
- Count distinct elements in every window
- Three way partitioning
- Longest consecutive sequence in Binary tree
- Level order traversal
- Maximum path sum
- Counting elements in two arrays
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Huffman Decoding-1
- Predecessor and Successor
- Children Sum Parent
- Median of BST
- Normal BST to Balanced BST
- Closest Neighbor in BST
- ZigZag Tree Traversal

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Index
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Egg Dropping Puzzle
- Edit Distance
- Longest Span with same Sum in two Binary arrays
- Consecutive 1's not allowed
- Path in Matrix
- Trapping Rain Water
- Subset Sum Problem
- Minimum Platforms
- Stock buy and sell
- Largest Number formed from an Array
- Longest Palindrome in a String
- Rearrange Array Alternately
- Relative Sorting
- Black and White
- 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
- Nuts and Bolts Problem
- Special Keyboard
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Longest consecutive subsequence
- M-Coloring Problem
- Preorder Traversal and BST
- Number of pairs
- Coin Piles
- Circle of strings
- Largest number in K swaps
- Minimize the heights
- Next larger element
- Total Decoding Messages
- Unique BST's
- Subsets
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Kth smallest element
- Longest Common Substring
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Trie | (Insert and Search)
- Knight Walk
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Find whether path exist
- Rearrange characters
- First non-repeating character in a stream
- K
^{th}largest element in a stream - Water Overflow
- Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Floyd Warshall
- Nearly Sorted Algorithm
- Geek collects the balls
- Smallest Positive missing number
- Longest Bitonic subsequence
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Page Faults in LRU
- Rotten Oranges
- CamelCase Pattern Matching
- Longest Common Prefix in an Array
- Coins and Game
- Brackets in Matrix Chain Multiplication
- Maximum Tip Calculator
- Longest subarray with sum divisible by K
- Longest Sub-Array with Sum K
- Rat Maze With Multiple Jumps
- Optimal Strategy For A Game
- The Game of Digits
- Sorting distance
- Reverse a Linked List in groups of given size.
- 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
- 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
- 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
- Generate IP Addresses
- 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
- Minimum Swaps to Sort
- Rat in a Maze Problem
- Merge two BST 's
- Merge k Sorted Arrays
- k-th smallest element in BST
- Binary Tree to CDLL
- Find a pair with given target in BST
- Leaves to DLL
- Convert Level Order Traversal to BST