- Print Linked List elements
- Count Leaves in Binary Tree
- Height of Binary Tree
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Binary Search
- Convert to Roman No
- Search a node in BST
- Remainder with 7
- Minimum element in BST
- Queue Reversal
- Sum of Binary Tree
- logical Operators
- Sort and Reverse Vector
- Front to Back
- Queue Designer
- Search an Element in an array
- Binary String
- LCM And GCD
- Power of 2
- Pythagorean Triplet
- 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
- Immediate Smaller Element
- Number of occurrence
- Check if a number is power of another number
- 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
- Reverse array in groups
- 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
- Unique Numbers
- Find first set bit
- Print an array in Pendulum Arrangement
- First element to occur k times
- Check whether K-th bit is set or not
- Check if a string is Isogram or not
- Rightmost different bit
- Toggle bits given range
- Remove repeated digits in a given number
- Absolute Difference of 1
- Find the fine
- Find the closest number
- Remove consonants from a string
- Most frequent word in an array of strings
- 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

Name

dexter

Rank in Institute

#28

Courses Attended

Overall Coding Score: 660

Monthly Coding Score: 284

Weekly Coding Score: 44

- Reverse a Doubly Linked List
- K distance from root
- Maximum Width of Tree
- Diameter of Binary Tree
- Left View of Binary Tree
- Sum Tree
- Transform to Sum Tree
- Queue using two Stacks
- Stack using two queues
- Insert a node in a BST
- Postorder traversal from given Inorder and Preorder traversals
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Print BST elements in given range
- Odd even level difference
- Binary Tree to BST
- Validate an IP Address
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Kth largest element in BST
- Count distinct elements in every window
- Special Stack
- Sort a stack
- Print Common Nodes in BST
- Peak element
- Delete nodes greater than k
- Index Of an Extra Element
- Construct BST from Postorder
- Check if Tree is Isomorphic
- Diagonal Sum In Binary Tree
- Find length of Loop
- Change of Key in BST
- Normal BST to Balanced BST
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Learn to Comment
- While loop- printTable
- Learning Macros
- Learn to Comment - Java
- nextLine and next
- Matrix Interchange - Java
- Structs and Objects
- Learning Structs
- Delete Array
- Maximum Area Rectangle
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Queue Operations
- Frequency Game
- Print Pattern
- Maximize Toys
- Trailing zeroes in factorial
- Reverse words in a given string
- Activity Selection
- Element that appears once where every element occurs twice
- Count distinct pairs with difference k
- N meetings in one room
- 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
- Number Of Open Doors
- Chinky and diamonds
- 0 - 1 Knapsack Problem
- Longest Common Increasing Subsequence
- Valid Substring
- Equilibrium point
- Floor in a Sorted Array
- Maximize Dot Product
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Knapsack with Duplicate Items
- Longest K unique characters substring
- Decode the string
- Minimum Operations
- Shortest distance in infinite tree
- Largest zigzag sequence
- Longest Palindromic Subsequence
- Evaluation of Postfix Expression
- Rod Cutting
- Sequence of Sequence
- Array Subset of another array
- First negative integer in every window of size k
- Group Anagrams Together
- Count the elements
- Count all possible paths from top left to bottom right
- Swapping pairs make sum equal
- Count of strings that can be formed using a, b and c under given constraints
- Minimum indexed character
- Stickler Thief
- Maximum Product Cutting
- Check if a Integer is power of 8 or not
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Longest common prefix
- 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

- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Delete a node from BST
- Merge K sorted linked lists
- Get minimum element from stack
- Circular tour
- Max rectangle
- Max length chain
- Interleaved Strings
- LRU Cache
- Multiply two strings
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Polynomial Addition
- Euler circuit and Path
- Construct tree from Inorder and LevelOrder
- Leaves to DLL
- Right Sibling in Binary Tree
- Convert Level Order Traversal to BST
- Count ways to N'th Stair(Order does not matter)
- Coin Change
- Parenthesis Checker
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Maximum Rectangular Area in a Histogram
- Min Coin
- Sum of bit differences
- Possible words from Phone digits
- Jumping Numbers
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Maximum of all subarrays of size k
- Minimum Cost of ropes
- Preorder to Postorder
- Longest consecutive subsequence
- Stock span problem
- Palindromic Array
- Is Binary Number Multiple of 3
- Card Rotation
- Bleak Numbers
- Super Primes
- Maximum XOR subset
- Minimize the heights
- Next larger element
- Unique BST's
- Kth smallest element
- Divisible by 8
- Longest Common Substring
- Count the Number of Full Binary Trees
- Recursively remove all adjacent duplicates
- Find all four sum numbers
- Check Mirror in N-ary tree
- First non-repeating character in a stream
- Convex Hull
- Zero Sum Subarrays
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Infix to Postfix
- Page Faults in LRU
- Firing employees
- Rotten Oranges
- Longest Common Prefix in an Array
- Lazy Pasha
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K
- The Painter's Partition Problem