I Deserve

   - to learn
   - an opportunity
   - to contribute


I DESERVE TO LEARN

Study following topics to enhance your algorithmic skills.
These range from easy to advanced level and are frequently asked in technical interviews.


  • All Questions

  • Dynamic Programming

  • Trees Questions

  • Arrays Questions

  • Graph Questions

  • Linked List Questions

  • Strings Questions

  • Find the number which occurs odd number of times

    Find the number which occurs odd number of times
  • Sorting Algorithm - Comb Sort

    Sorting Algorithm - Comb Sort
  • Implement a fair coin from a given unfair coin

    Implement a fair coin from a given unfair coin
  • Find the missing number in the duplicate array

    Find the missing number in the duplicate array
  • Find the Element That Appears Once in an Array

    Find the Element That Appears Once in an Array
  • Iterative Pre-order Traversal of a Binary Tree

    Iterative Pre-order Traversal of a Binary Tree
  • Maximum size square sub-matrix with all 1s

    Maximum size square sub-matrix with all 1s
  • Print a Matrix Diagonally

    Print a Matrix Diagonally
  • Number of clusters of 1s OR Number of Islands

    Number of clusters of 1s OR Number of Islands
  • Find maximum element from each sub-array of size 'k'| Set 2

    Find maximum element from each sub-array of size 'k'| Set 2
  • Find maximum element from each sub-array of size 'k'| Set 1

    Find maximum element from each sub-array of size 'k'| Set 1
  • Find maximum value of sum of index element products(i*array[i]) with only rotations allowed on a given array

    Find maximum value of sum of index element products(i*array[i]) with only rotations allowed on a given array
  • Spiral Level Order Traversal of a Binary Tree | Set 1

    Spiral Level Order Traversal of a Binary Tree | Set 1
  • Spiral Level Order Traversal of a Binary Tree | Set 2

    Spiral Level Order Traversal of a Binary Tree | Set 2
  • Sum of Two Linked Lists using Recursion | Set 2

    Sum of Two Linked Lists using Recursion | Set 2
  • Sum of Two Linked Lists using Stacks

    Sum of Two Linked Lists using Stacks
  • Check if a number can be expressed as x raised to power y | Set 2

    Check if a number can be expressed as x raised to power y | Set 2
  • Sum of Two Linked Lists using Recursion | Set 1

    Sum of Two Linked Lists using Recursion | Set 1
  • Check if a number can be expressed as x raised to power y | Set 1

    Check if a number can be expressed as x raised to power y | Set 1
  • Find the 'n'th most frequent number in array

    Find the 'n'th most frequent number in array
  • Find the missing number in the increasing sequence

    Find the missing number in the increasing sequence
  • Postfix Expression Evaluation

    Postfix Expression Evaluation
  • Maximum average subarray of size k

    Maximum average subarray of size k
  • Find nth Node from the end of a Linked List

    Find nth Node from the end of a Linked List
  • Lowest Common Ancestor of two nodes in a Binary Search Tree

    Lowest Common Ancestor of two nodes in a Binary Search Tree
  • Remove spaces from a given string

    Remove spaces from a given string
  • Set Partition Problem | Dynamic Programming

    Set Partition Problem | Dynamic Programming
  • Detect a loop in a linked list and find the node where the loop starts.

    Detect a loop in a linked list and find the node where the loop starts.
  • Finding the power of a number in log(n) time | Recursion

    Finding the power of a number in log(n) time | Recursion
  • Set Partition Problem | Recursion

    Set Partition Problem | Recursion
  • Find common elements in 'n' sorted arrays

    Find common elements in 'n' sorted arrays
  • Populate right neighbors for all nodes in a binary tree

    Populate right neighbors for all nodes in a binary tree
  • Word Break Problem

    Word Break Problem
  • Diagonal Sum of a Binary Tree.

    Diagonal Sum of a Binary Tree.
  • Sorting Algorithm - Heap Sort

    Sorting Algorithm - Heap Sort
  • Minimum number of trials to reach from source word to destination word

    Minimum number of trials to reach from source word to destination word
  • Square root of a number

    Square root of a number
  • Find total number of ways to make change using given set of coins

    Find total number of ways to make change using given set of coins
  • Next greater element in an array

    Next greater element in an array
  • Find the size of largest BST in a binary tree

    Find the size of largest BST in a binary tree
  • Find minimum edit distance between given two strings

    Find minimum edit distance between given two strings
  • Find minimum cost path in a matrix

    Find minimum cost path in a matrix
  • Minimum number of coins to make change

    Minimum number of coins to make change
  • Remove the nodes of binary search tree which are outside the given range

    Remove the nodes of binary search tree which are outside the given range
  • Buy and sell stocks | Part 1

    Buy and sell stocks | Part 1
  • Group all anagrams together from a given array of strings | Set 1

    Group all anagrams together from a given array of strings | Set 1
  • Java Constructors

    Java Constructors
  • Merge two sorted arrays without using extra space

    Merge two sorted arrays without using extra space
  • Maximum subarray sum

    Maximum subarray sum
  • Count all possible decodings of a given digit sequence

    Count all possible decodings of a given digit sequence
  • Find the next greater number using same digits

    Find the next greater number using same digits
  • Check if all internal nodes of BST have only one child without building tree

    Check if all internal nodes of BST have only one child without building tree
  • Convert binary tree to binary search tree

    Convert binary tree to binary search tree
  • Find the number of Binary Sequences

    Find the number of Binary Sequences
  • Leaders in an array

    Leaders in an array
  • Breadth first search in a graph

    Breadth first search in a graph
  • 0-1 Knapsack Problem

    0-1 Knapsack Problem
  • Find the length of longest bitonic subsequence in an array

    Find the length of longest bitonic subsequence in an array
  • Find the length of longest increasing subsequence in an array

    Find the length of longest increasing subsequence in an array
  • Pancake Sorting

    Pancake Sorting
  • Check if two binary search trees are identical given their array representations

    Check if two binary search trees are identical given their array representations
  • Check if two binary search trees are identical given their array representations | Set 2

    Check if two binary search trees are identical given their array representations | Set 2
  • Count frequencies of array elements in range 1 to n

    Count frequencies of array elements in range 1 to n
  • Find duplicates in an integer array

    Find duplicates in an integer array
  • Find an integer array corresponding to the string specifying increase-decrease transitions

    Find an integer array corresponding to the string specifying increase-decrease transitions
  • Find floor and ceiling of an element from given dataset using binary search tree

    Find floor and ceiling of an element from given dataset using binary search tree
  • Generate all subsets of a given set

    Generate all subsets of a given set
  • Find increasing sub-sequence of length three having maximum product | Optimized approach

    Find increasing sub-sequence of length three having maximum product | Optimized approach
  • Find increasing sub-sequence of length three having maximum product

    Find increasing sub-sequence of length three having maximum product
  • Re-arrange elements in an array to put positive and negative elements in alternate order

    Re-arrange elements in an array to put positive and negative elements in alternate order
  • Find index of 0 to replace to get longest continuous sequence of 1s

    Find index of 0 to replace to get longest continuous sequence of 1s
  • O(n) time approach to find index of 0 to replace to get longest continuous sequence of 1s

    O(n) time approach to find index of 0 to replace to get longest continuous sequence of 1s
  • Remove all the half nodes from a given binary tree

    Remove all the half nodes from a given binary tree
  • Given an array with all distinct elements, find the length of the longest sub-array which has elements(not in any particular order) that could form a contiguous sequence

    Given an array with all distinct elements, find the length of the longest sub-array which has elements(not in any particular order) that could form a contiguous sequence
  • AVL tree | Insertion

    AVL tree | Insertion
  • Check if a binary tree is sub-tree of another binary tree in space O(1)

    Check if a binary tree is sub-tree of another binary tree in space O(1)
  • Check if two nodes are cousins in a Binary tree

    Check if two nodes are cousins in a Binary tree
  • Print all nodes of a binary tree that do not have sibling

    Print all nodes of a binary tree that do not have sibling
  • Remove all nodes which lie on path having sum less than k

    Remove all nodes which lie on path having sum less than k
  • Check if a binary tree is sub-tree of another binary tree in time O(n)

    Check if a binary tree is sub-tree of another binary tree in time O(n)
  • Check if the given n-ary tree is symmetric tree or not

    Check if the given n-ary tree is symmetric tree or not
  • Find sum of all left leaves of a binary tree

    Find sum of all left leaves of a binary tree
  • Merge Sort

    Merge Sort
  • Convert the given n-ary tree to its mirror image

    Convert the given n-ary tree to its mirror image
  • Check if a given binary tree is symmetric tree or not

    Check if a given binary tree is symmetric tree or not
  • Find depth of deepest odd level leaf node

    Find depth of deepest odd level leaf node
  • Construct the binary tree from its parent array representation

    Construct the binary tree from its parent array representation
  • Find height of the binary tree from its parent array representation

    Find height of the binary tree from its parent array representation
  • Binary Search tree | Insertion and Search

    Binary Search tree | Insertion and Search
  • Check if a binary tree is balanced or not

    Check if a binary tree is balanced or not
  • AVL tree | Deletion

    AVL tree | Deletion
  • Binary Search tree | Deletion

    Binary Search tree | Deletion
  • AVL tree | Basics

    AVL tree | Basics
  • Longest Substring with non-Repeating Characters

    Longest Substring with non-Repeating Characters
  • First non-repeating character in a string

    First non-repeating character in a string
  • Sorting Algorithm - Bubble Sort

    Sorting Algorithm - Bubble Sort
  • Sorting Algorithm - Insertion Sort

    Sorting Algorithm - Insertion Sort
  • Sorting Algorithm - Selection Sort

    Sorting Algorithm - Selection Sort
  • Check balanced parentheses in a string

    Check balanced parentheses in a string
  • Check if a binary tree is a binary search tree

    Check if a binary tree is a binary search tree
  • Convert a binary tree to doubly linked list

    Convert a binary tree to doubly linked list
  • Fibonacci Number

    Fibonacci Number
  • Rotate an Array

    Rotate an Array
  • Check whether a binary tree is complete or not

    Check whether a binary tree is complete or not
  • Check whether a binary tree is a full binary tree or not

    Check whether a binary tree is a full binary tree or not
  • Recursive algorithm to solve Towers of Hanoi puzzle

    Recursive algorithm to solve Towers of Hanoi puzzle
  • Given a sequence of words, group together all anagrams and print them.

    Given a sequence of words, group together all anagrams and print them.
  • Pattern matching using Trie

    Pattern matching using Trie
  • Reverse words in a string

    Reverse words in a string
  • Longest Prefix Matching using Trie

    Longest Prefix Matching using Trie
  • Trie Data Structure | Delete

    Trie Data Structure | Delete
  • Trie Data Structure | Insert and search

    Trie Data Structure | Insert and search
  • Print binary tree in vertical order

    Print binary tree in vertical order
  • Serialize and Deserialize a binary search tree using post order traversal

    Serialize and Deserialize a binary search tree using post order traversal
  • Construct binary tree from inorder and postorder traversals

    Construct binary tree from inorder and postorder traversals
  • Print left view of a binary tree

    Print left view of a binary tree
  • Serialize and Deserialize a binary search tree

    Serialize and Deserialize a binary search tree
  • Construct binary tree from inorder and preorder traversals

    Construct binary tree from inorder and preorder traversals
  • Print bottom view of a binary tree using level order traversal

    Print bottom view of a binary tree using level order traversal
  • Print right view of a binary tree

    Print right view of a binary tree
  • Print top view of a binary tree using level order traversal

    Print top view of a binary tree using level order traversal
  • Print bottom view of a binary tree

    Print bottom view of a binary tree
  • Print top view of a binary tree

    Print top view of a binary tree
  • Find all permutations of a String

    Find all permutations of a String
  • Check if two binary trees are identical

    Check if two binary trees are identical
  • LRU Cache Implementation

    LRU Cache Implementation
  • Convert a binary tree to its mirror tree

    Convert a binary tree to its mirror tree
  • Print all Root to Leaf paths of a Binary Tree

    Print all Root to Leaf paths of a Binary Tree
  • The Skyline Problem

    The Skyline Problem
  • Total number of possible Binary Search Trees with 'n' keys

    Total number of possible Binary Search Trees with 'n' keys
  • Trapping Rain Water between Towers

    Trapping Rain Water between Towers
  • Bellman-Ford Algorithm

    Bellman-Ford Algorithm
  • Binary Tree Level Order Traversal

    Binary Tree Level Order Traversal
  • Buy and sell stocks | Part 2

    Buy and sell stocks | Part 2
  • Convert a sorted Doubly Linked List to Balanced Binary Search Tree

    Convert a sorted Doubly Linked List to Balanced Binary Search Tree
  • Create a balanced Binary Search Tree from a sorted array

    Create a balanced Binary Search Tree from a sorted array
  • Dijkstra's Shortest Path algorithm

    Dijkstra's Shortest Path algorithm
  • Distinct binary strings of length n with no consecutive 1s

    Distinct binary strings of length n with no consecutive 1s
  • Distribute Chocolates Problem

    Distribute Chocolates Problem
  • Finding 10 letter repeated DNA sequences.

    Finding 10 letter repeated DNA sequences.
  • Find a Peak Element in an array

    Find a Peak Element in an array
  • Find element in sorted rotated array without finding pivot

    Find element in sorted rotated array without finding pivot
  • Find an element in a sorted rotated array

    Find an element in a sorted rotated array
  • Find intersection of two Linked Lists - O(m + n) Time Complexity and O(1) Space Complexity

    Find intersection of two Linked Lists - O(m + n) Time Complexity and O(1) Space Complexity
  • Find intersection of two Linked Lists

    Find intersection of two Linked Lists
  • Find Majority Element in an Array

    Find Majority Element in an Array
  • Find median of two sorted arrays

    Find median of two sorted arrays
  • Find Minimum Length Sub Array With Sum K

    Find Minimum Length Sub Array With Sum K
  • Find pivot in a sorted rotated array

    Find pivot in a sorted rotated array
  • Friend Circles Problem - Graph Theory

    Friend Circles Problem - Graph Theory
  • Gold Mine Problem

    Gold Mine Problem
  • Find the heavier ball puzzle

    Find the heavier ball puzzle
  • Recover a Binary Search Tree if positions of two nodes are swapped.

    Recover a Binary Search Tree if positions of two nodes are swapped.
  • In-order Successor of a Node in a Binary Tree

    In-order Successor of a Node in a Binary Tree
  • In-order Traversal of a Binary Tree

    In-order Traversal of a Binary Tree
  • Longest Common Subsequence

    Longest Common Subsequence
  • Longest Common Substring

    Longest Common Substring
  • Longest Increasing Subsequence O(n logn)

    Longest Increasing Subsequence O(n logn)
  • Longest Palindromic Subsequence

    Longest Palindromic Subsequence
  • Manacher's Algorithm

    Manacher's Algorithm
  • Longest Palindromic Substring

    Longest Palindromic Substring
  • Lowest Common Ancestor of 2 nodes in a Binary Tree

    Lowest Common Ancestor of 2 nodes in a Binary Tree
  • Merge two sorted linked lists

    Merge two sorted linked lists
  • Minimum Depth of a Binary Tree

    Minimum Depth of a Binary Tree
  • Minimum Stack O(1)

    Minimum Stack O(1)
  • Palindrome Min Cut

    Palindrome Min Cut
  • Post-order Traversal of a Binary Tree

    Post-order Traversal of a Binary Tree
  • Pre-order Traversal of a Binary Tree

    Pre-order Traversal of a Binary Tree
  • To print maximum number of As using four keys of special keyboard.

    To print maximum number of As using four keys of special keyboard.
  • Prisoner Hat Puzzle - who will shout first?

    Prisoner Hat Puzzle - who will shout first?
  • Reverse a Linked List - Iterative

    Reverse a Linked List - Iterative
  • Reverse a Linked List - Recursive

    Reverse a Linked List - Recursive
  • Reverse every alternate k nodes of a Linked List

    Reverse every alternate k nodes of a Linked List
  • Search a sorted matrix

    Search a sorted matrix
  • Shortest Palindrome

    Shortest Palindrome
  • Subset Sum Problem

    Subset Sum Problem
  • Toggle all the bits in the binary representation of a number

    Toggle all the bits in the binary representation of a number
  • Topological Sorting of a Directed Acyclic Graph.

    Topological Sorting of a Directed Acyclic Graph.
  • Binary Search in a Sorted Array

    Binary Search in a Sorted Array
  • Anagram Pattern Search

    Anagram Pattern Search
  • Longest Subset With Consecutive Numbers

    Longest Subset With Consecutive Numbers
  • Next Higher Number

    Next Higher Number
  • Time and Space Complexity of Recursive Algorithms

    Time and Space Complexity of Recursive Algorithms

What We Do?

We make algorithms easy and fun to learn.
We use visualization techniques and video tutorials to simplify the intricacies of complex algorithms.
We are committed to help develop algorithmic thinking and be better prepared for coding interviews.
We are also working towards connecting your efforts to dreams by helping you get the right opportunities.

service 1

Platform for Learning

Unique learning platform to enhance algorithmic skills.

service 2

Platform to connect with Companies

Connecting Efforts to Dreams.(Feature coming soon..)

service 3

Platform for sharing knowledge

Platform to express algorithms in your own unique way.

The Moment that you start to Wonder if you Deserve better, You do!

What our community has to say about us

Please help us make this platform effective and more user friendly by providing your valuable feedback.

"Good video, great explanation. Good job sir."

Andrea De Domenico IDeserve Community Member

"Wow. Such a good animating presentation to explain this hard problem. Keep doing the excellent work!!!"

James Qiu IDeserve Community Member

"This is awesome. Thank you very much!"

Roy Li IDeserve Community Member

Contact Us

We are looking forward to hearing from you.

Hyderabad, India

ideserve.co.in@gmail.com

We Are Social