- Sum of array elements
- Reverse an Array
- Swap two numbers
- Addition of Two Numbers
- Print Elements of Array
- Vowel or Not
- Print table
- Simple Interest
- Compound Interest
- Sum of Digit is Pallindrome or not
- Print 1 to n without using loops
- Reverse digits
- Mean
- Compete the skills
- Count of camel case characters
- Find difference between sum of diagonals
- C++ Loops | Set 1 (Print a string N times)
- Distance between 2 points
- Sum of elements in a matrix
- Reversing the vowels
- Display longest name
- C++ Operators | Set 1 (Arithmetic)
- Reverse a String
- C++ Hello World
- C++ if-else (Decision Making)
- C++ Arrays (Sum of array) | Set 1
- C++ Strings
- C++ Array (print an element) | Set 2
- C++ Switch Case Statement
- C++ Operators (Relational) | Set 2
- Floyd's triangle
- GCD of two numbers
- Largest Element in Array
- Addition of two square matrices
- C++ Data Types
- Time to Words
- Convert time from 12 hour to 24 hour format
- Java Hello World
- Java if-else (Decision Making)
- Java Switch Case statement
- Java Arrays | Set 1
- Java Strings | Set 1
- Count of smaller elements
- Split Strings
- Count Digits
- Even Odd Sum
- Count type of Characters
- Number of Diagonals
- Decimal to binary
- Check String
- Change the string
- Sum of diagonals
- Extract the integers
- Remove vowels from string
- Upper case conversion
- Sum of odd and even elements
- Sum of AP series
- Perfect Arrays
- Full Prime
- Convert a list of characters into a String
- The dice problem
- Find n-th term of series 1, 3, 6, 10, 15, 21
- C++ Input / Output
- Power of Pow | Even Number
- Java Input/Output
- Java Reverse a String
- Java Delete alternate characters
- Java Substring
- Java Convert String to LowerCase
- C++ 2-D Arrays | Set-1
- Java Basic Data Types
- Java Operators(Relational) | Set - 2
- C++ Pointers ( Incrementing a variable) | Set 1
- C++ Functions (Sum of numbers) | Set 1
- Add Vector Elements

Name

AKASH

Institution

Rank in Institute

#2

Courses Attended

Campus Ambassador

Overall Coding Score: 1867

Monthly Coding Score: 311

Weekly Coding Score: 82

- Search an Element in an array
- Maximum Occuring Character
- Binary String
- Consecutive elements
- Factorial
- Prime Number
- LCM And GCD
- GCD of Array
- Repetitive Addition Of Digits
- Searching a number
- Power of 2
- Series GP
- Celsius to Fahrenheit Conversion
- Pythagorean Triplet
- Sort a String
- Majority Element
- Shortest path from 1 to n
- Count possible triangles
- Rotate Array
- Permutations of a given string
- Swap two nibbles in a byte
- Number of paths
- Count total set bits
- Number is sparse or not
- Bit Difference
- Greater on right side
- Immediate Smaller Element
- Binary Array Sorting
- Intersection of two arrays
- Union of two arrays
- Convert array into Zig-Zag fashion
- Maximum repeating number
- k largest elements
- Pairs of prime number
- Minimum difference pair
- Roots of Quadratic Equation
- Generate Binary Numbers
- Smallest number
- Keypad typing
- Rotating an Array
- Searching an element in a sorted array
- Merge and Sort
- Rotate by 90 degree
- Reverse array in groups
- Set Bits
- Repeated sum of digits
- Longest Consecutive 1's
- Sum of divisors
- Common Divisors
- Minimize the sum of product
- String Reversal
- Reverse each word in a given string
- Type of array
- Sum of dependencies in a graph
- Sort in specific order
- Check if two arrays are equal or not
- Form largest number from digits
- Check if string is rotated by two places
- Long Long Decimal
- Find first set bit
- Find first repeated character
- Magical Number
- Wrong Ball
- Does array represent Heap
- Find the element that appears once in sorted array
- Thief trying to escape
- Print an array in Pendulum Arrangement
- Transpose of Matrix
- First element to occur k times
- Check whether K-th bit is set or not
- Remove Duplicates from unsorted array
- Uncommon characters
- Sum of numbers in string
- Find minimum and maximum element in an array
- Print first letter of every word in the string
- Determinant of a Matrix
- Equivalent Sub-Arrays
- Check if a string is Isogram or not
- Check Binary String
- Rightmost different bit
- Check set bits
- Set kth bit
- Toggle bits given range
- Twice counter
- Print first n Fibonacci Numbers
- Remove repeated digits in a given number
- Odd to Even
- Print Matrix in snake Pattern
- Closest Number
- Transform to prime
- Boolean String Value
- Tough Competitors
- Anshuman's Favourite Number
- The Counting Game !!
- Repated Sum and then Multiply
- Absolute Difference of 1
- Remove common characters and concatenate
- Repeated I.Ds
- ZERO Number
- Sum of upper and lower triangles
- Sum of Digit Modified
- Count the characters
- Find k-th character in string
- Repeated Character
- Red OR Green
- Product of factors of number
- G.F Series
- Find the fine
- Sort the string in descending order
- Sum of Digits Prime/Non-Prime
- Count number of elements between two given elements in array
- Remove all characters other than alphabets
- Weak Maths
- Perfect Array
- Find the closest number
- Sandwiched_Vowels
- Even-Odd turn game
- Narcissistic number
- Finding-Pairs
- Corner Digits
- Series X1
- Last index of a character in the string
- Make Co-prime Array
- Check for three consecutive numbers
- Maximum triplet sum in array
- Floating point number even or odd
- Squares Difference
- Factors Sum
- Check if the number is balanced
- Count the characters in each word in a given sentence
- Find sum of even factors of a number
- Weight of strings
- Extract the phone number
- Product is even or odd?
- Remove consonants from a string
- C++ A Speed Breaker
- Check if actual binary representation of a number is palindrome
- C++ Corresponding position in the two strings that hold exactly the same characters.
- Product of maximum in first array and minimum in second
- Palindrome in both Decimal and Binary
- Check if strings are rotations of each other or not
- Sophie Germain Prime
- Crazy String
- Message Spreading
- Convert the string
- Is digital root of N a prime?
- C++ Function Overloading
- C++ Sets
- Countries at war
- Last duplicate element in a sorted array
- Perfect Square String
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Inverse Permutation
- Game with nos
- Play With OR
- Why is Melody so chocolaty?
- Tywin's War Strategy
- Pattern-1
- Ishaan's Internship
- Ishaan Loves Chocolates
- Cricket Average
- Ishaan's Weight
- Chocolate lengths
- Factor OR Multiple
- Jay's Apples
- Lottery Money
- Program for length of the longest word in a sentence
- String of Commons
- The Modulo Task
- Riya's Test
- The Penalty Shootout
- GOT TV series
- The Number System
- Confused pappu
- Difference series
- Reducing Walls
- Multiply left and right array sum.
- Find the Number which contain the digit d
- Gray Code
- Gray to Binary equivalent
- Maximum Perimeter of Triangle from array
- Doctors Clinic
- How Many X's?
- Prime String
- Find The Sequence
- Height of Heap
- Fibonacci to N
- Average Count Array
- The Spider Steps
- Java Anagram Strings
- Java Collection | Set 1 (ArrayList) Part-1
- Java 1-d and 2-d Array
- Java Iterator
- C++ 2-D Arrays | Set-2
- Tower of Hanoi
- Adding two matrices
- Left Index
- Multiply the matrices
- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Insert a node in Doubly linked list
- Binary Search
- Convert to Roman No
- Preorder Traversal
- Implement strstr
- C++ STL | Set 1 (vector)
- C++ STL | Set 3 (map)
- C++ STL | Set 4 (stack)
- C++ STL | Set 5 (queue)
- Middle Pattern
- C++ STL | Set 6 (set)
- Search a node in BST
- C++ STL | Set 7 (unordered map)
- C++ STL | Set 8 (unordered set)
- Remainder with 7
- Implement Atoi
- Find Number of Numbers
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Find the Sum of Last N nodes of the Linked List
- Modular Node
- Find n/k th node in Linked list
- Queue Reversal
- Sum of Binary Tree
- Insert in Middle of Linked List
- longest substring containing '1'
- Pairwise Consecutive Elements
- Count Non-Leaf Nodes in Tree
- C++ Classes Introduction
- Product of array elements
- C++ Inheritance introduction
- C++ Call by reference
- Java Interface
- Start Coding
- logical Operators
- Filter the weeds
- Volume of Cuboid
- Vector Common Elements
- Sort and Reverse Vector
- Front to Back
- Stack and Queue Operations
- Stack designer
- Queue Designer
- Set Operations
- Map Operations
- Sum Array Puzzle
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Reversing an Array
- Operations on Stack
- Operations on Queue
- Check if a string is Isogram or not

- Frequencies of Limited Range Array Elements
- Anagram
- Number of Unique Paths
- Wave Array
- Maximum Gap
- Print Pattern
- Search in a Rotated Array
- Maximize Toys
- Trailing zeroes in factorial
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- First Repeating Element
- Reverse words in a given string
- Isomorphic Strings
- Count Substrings
- Move all zeroes to end of array
- Activity Selection
- Remove “b” and “ac” from a given string
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Next greater number set digits
- Finding Position
- Amount of Water
- Longest Distinct characters in string
- Column name from a given column number
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Triangular Number
- Add Binary Strings
- Product array puzzle
- Count Smaller elements
- Reach the Nth point
- Subarray with given sum
- Adjacents are not allowed
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Count pairs with given sum
- Inorder Traversal and BST
- Triplet Sum in Array
- Two Repeated Elements
- Three Great Candidates
- Reach a given score
- Possible paths
- Search in a matrix
- Cross the Bridge
- Day of the week
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Longest Common Increasing Subsequence
- Pangram Checking
- Skip the work
- Cutted Segments
- Game of Death in a circle
- Power of Numbers
- Perfect Numbers
- Count digits in a factorial
- Ordering of strings
- Largest number with given sum
- Equilibrium point
- Floor in a Sorted Array
- Finding Profession
- Prime Factors
- Pairs with specific difference
- Count Pairs in an Array
- Chocolate Distribution Problem
- Binary Tree K level sum
- Maximum Sum Bitonic Subsequence
- Sum of k smallest elements in BST
- Flood fill Algorithm
- Decode the pattern
- Roman Number to Integer
- Largest Product Pallindrome
- Decode the string
- Find Nth root of M
- Love For The Twins
- Sum of all substrings of a number
- Recaman’s sequence
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Shortest distance in infinite tree
- Largest zigzag sequence
- Palindromic patitioning
- Largest Fibonacci Subsequence
- Increasing Sub Sequence
- Fractional Knapsack
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Common elements
- Recursive sequence
- Element with left side smaller and right side greater
- Modular multiplicative inverse
- Array Subset of another array
- Karatsuba Algorithm
- Count the paths
- Paths to reach origin
- Subarray with 0 sum
- Nth catalan number
- Subarrays with given sum
- Second most repeated string in a sequence
- Shortest Common Supersequence
- Nth number made of prime digits
- Large number division
- Rearrange a string
- Minimum Number in a sorted rotated array
- Sort by Absolute Difference
- Maximum occured integer
- BBT counter
- Swapping pairs make sum equal
- String Ignorance
- Jumping Caterpillars
- Longest alternating subsequence
- Count of strings that can be formed using a, b and c under given constraints
- Ways to write n as sum
- Maximum sum Problem
- Minimum indexed character
- Find number of times a string occurs as a subsequence
- Stickler Thief
- Geek and its Colored Strings
- Transform the array
- Primorial of a number
- Numbers containing 1, 2 and 3
- Geek and his Tricky Series
- Next Happy Number
- Longest common prefix
- Roof Top
- Pairs which are Divisible by 4
- Maximum AND Value
- Trisha's Number
- Ritika's Money
- Count unset bits in a given Range
- Find winner of the Game of Nim
- Sum of all divisors from 1 to n
- Maximum distinct elements after removing K elements
- Maximum difference of zeros and ones in binary string
- Nearest multiple of 10
- Winner of an election
- Ease the Array
- Pair the minimum
- Easy string
- Swap every two bits in bytes
- Print Binary Tree levels in sorted order
- Check if a number is divisible by 8
- XOR of two numbers after making length of their binary representations equal
- Hungry Pizza Lovers
- Arya's Long String
- Ishaan and Sticks
- Mysterious Series
- Akaash's Assignment
- Find the closest pair from two arrays
- Common Divisor
- Minimum Swaps required to group all 1’s together
- The Inverting Factor
- Summing the Sum
- Maximum sum of increasing order elements from n arrays
- The Non-repetitive String
- Maximum number of partitions that can be sorted individually to make sorted
- Check if it is possible to survive on Island
- Searching in an array where adjacent differ by at most k
- The Even Array
- Shoot, Reload, Repeat
- Palindromic Series
- The Light Problem
- The Modified String
- The Optimal Selection
- Minimum changes to make all substrings distinct
- Find n-th Fortunate Number
- Help Ishaan
- Sorting all array elements except one
- Candy Packets
- Delete array elements which are smaller than next or become smaller
- Mansi and her series
- The Strange Assignment
- Withdrawing Money
- Lucky Ishaan
- The Wedding Date
- Smallest greater elements in whole array
- Eulerian Path in an Undirected Graph
- Minimal moves to form a string
- Product of Prime Factors
- Ordered Prime Signature
- Ways to split string such that each partition starts with distinct letter
- Save Ironman
- Penalty Shooters
- Fitting The Array
- Are you "Perfect"
- K-th missing element
- Print adjacency list
- C++ Exception Handling
- Pair with given sum in a sorted array
- Positive Negative Pair
- Exchange matrix columns
- Reversing the columns of a Matrix
- Interchanging the rows of a Matrix
- Boundary traversal of matrix
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Separate chaining in Hashing
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Print Distinct Elements
- Count Distinct Elements
- Mean and Median
- Area Manipulation
- Count 1's in binary array
- Minimum adjacent difference in a circular array
- Toggle The Middle
- Union of Two Sorted Arrays
- Intersection of two sorted arrays
- Naive Pattern Search
- Distinct Pattern Search
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- linked list of strings forms a palindrome
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Reverse a Doubly Linked List
- Insertion Sort
- 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
- 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
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Max sum path in two arrays
- Level order traversal Line by Line
- 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
- Remove every k'th node
- Leaf at same level
- Is Binary Tree Heap
- Validate an IP Address
- Distinct occurrences
- Sorted subsequence of size 3
- Expression Tree
- Check if Linked List is Palindrome
- Max distance between same elements
- Longest Consecutive Subsequence
- Check whether BST contains Dead End
- Kth largest element in BST
- Find duplicates in an array
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Three way partitioning
- Sort a stack
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Inorder Successor in BST
- Delete nodes greater than k
- Merge Sort for Linked List
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Split Singly Linked List Alternatingly
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Counting Sort
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse a string using Stack
- XOR of a given range
- Full binary tree
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Construct BST from Postorder
- Huffman Decoding-1
- Vertical sum
- Next Right Node
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Depth of node
- pth common ancestor in BST
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Deletion and Reverse in Linked List
- Change of Key in BST
- Median of BST
- Normal BST to Balanced BST
- Leaf under budget
- Reverse First K elements of Queue
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Deletion in a Binary Tree
- Nodes at Odd Levels
- Closest Neighbor in BST
- Brothers From Different Roots
- Sum of the Longest Bloodline of a Tree
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Move all zeros to the front of the linked list
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Rotate doubly Linked List
- C++ Multi-level inheritance
- C++ Function overloading
- C++ complex number addition (operator overloading)
- C++ Template
- The New Line
- Controlled_Printing
- Coding with Operators
- Data Types
- The Size of
- Taking input
- Learn to Comment
- GetLine and Ignore
- Learning to be precise
- Bitwise Operators
- Even Odd
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Exists or Not?
- The Loner
- Count Odd Even
- Need Some Change
- Count the Specials
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Almost Equal
- The Pattern Matcher
- Magic in CPP
- Swap the objects
- Structs and Objects
- Two Dimensional World
- Learning Structs
- Delete Array
- Cover the distance
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Student of the Year
- Get min at pop
- Deque Implementations
- Min Heap implementation
- Multiset Operations
- Multimap Operations
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Coin Change - Minimum number of coins
- Kadane's Algorithm - I
- Kadane's Algorithm - II
- Pairwise swap of nodes in LinkeList
- Mother Vertex
- Print adjacency list
- Subarray with 0 sum

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Sum Of Prime
- Excel Sheet | Part - 1
- Maximum Sub Array
- Print Diagonally
- Maximum Index
- 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
- Edit Distance
- nCr
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Trapping Rain Water
- Case-specific Sorting of Strings
- Rank of Matrix
- Sum of bit differences
- Subset Sum Problem
- Minimum Platforms
- Find Prime numbers in a range
- Stock buy and sell
- Possible words from Phone digits
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Relative Sorting
- Black and White
- Maximum of all subarrays of size k
- Boolean Matrix Problem
- 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
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Smallest number on left
- Longest consecutive subsequence
- Stock span problem
- Convert an array to reduced form
- M-Coloring Problem
- Palindromic Array
- Betting game
- Preorder Traversal and BST
- Cost of Sweets
- Bleak Numbers
- Number of pairs
- Product of Primes
- Coin Piles
- Maximum Profit
- Circle of strings
- Your Social Network
- Largest number in K swaps
- Minimize the heights
- Next larger element
- Composite and Prime
- X Total Shapes
- Unique BST's
- Subsets
- Matchsticks game
- Combination Sum
- Kth smallest element
- 3 Divisors
- Count Divisors of Factorial
- Prime Factors and their Powers
- Longest Common Substring
- Easy Query
- Rotate and delete
- 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
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Distance of nearest cell having 1
- Find whether path exist
- Largest prime factor
- Unit Area of largest region of 1's
- Rearrange characters
- Count subsequences of type a^i b^j c^k
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Floyd Warshall
- Nearly Sorted Algorithm
- Infix to Postfix
- Geek collects the balls
- Smallest Positive missing number
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Page Faults in LRU
- Firing employees
- Rotten Oranges
- Longest Common Prefix in an Array
- Steps by Knight
- Biconnected Graph
- Lazy Pasha
- Subarrays with equal 1s and 0s
- Make Matrix Beautiful
- Container with most water
- Save Gotham!
- Shreyansh and his bits
- Maximize the sum of selected numbers from an array to make it empty
- Find the N-th character
- Part of it.
- Rat Maze With Multiple Jumps
- Construct binary palindrome by repeated appending and trimming
- Unit Digit
- Game of Powers
- Number of possible squares
- Smaller on Left
- Closer to sort
- Count only Repeated
- Merge three sorted arrays
- Level of Nodes
- Possible paths between 2 vertices
- The Conversion To One
- K Most occurring elements
- Nearly sorted
- Check if array is sorted and rotated clockwise
- Maximum Product of Increasing Subsequence of Size 3
- Get the Shadow
- Smaller on Right
- Kth largest element
- Kth smallest element
- Optimal Strategy For A Game
- Reverse a Linked List in groups of given size.
- Quick Sort on Linked List
- 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
- Maximum difference between node and its ancestor
- 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
- Make Binary Tree From Linked List
- Generate IP Addresses
- Check if subtree
- Extreme nodes in alternate order
- Clone a Binary Tree
- 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
- Strongly Connected Components (Kosaraju's Algo)
- Max sum subarray by removing at most one element
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Bridge Edge in Graph
- Top View of Binary Tree
- 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
- Find a pair with given target in BST
- Count Element Occurences
- Occurences of 2 as a digit
- Populate Inorder Successor for all nodes
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Mirror of a given node
- Pairs violating BST property
- Maximum path sum from any node
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Path Count in Directed Graph
- C++ Generic sort
- Diagonal Sum
- Operations on PriorityQueue
- Pattern Printer - CPP
- Swap Kth nodes from ends
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Unique BST's
- Unit Area of largest region of 1's
- Longest consecutive subsequence

- Minimum sum partition
- Merge Two Sorted Arrays
- Return two prime numbers
- Allocate minimum number of pages
- Minimum Cost Path
- N-Queen Problem
- Solve the Sudoku
- Find median in a stream
- Max Circular Subarray Sum
- Phone directory
- Median of Two sorted arrays
- Binary Tree to DLL
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Make them One