IDeserve - Unique learning platform to enhance algorithmic skills.

• https://www.ideserve.co.in/
• https://www.ideserve.co.in/search
• https://www.youtube.com/c/ideserve
• http://angrynerds.io/my-account
• https://www.ideserve.co.in/learn/last-index-of-element-in-sorted-array-with-duplicates
• https://www.ideserve.co.in/learn/first-index-of-element-in-sorted-array-with-duplicates
• https://www.ideserve.co.in/learn/all-palindromic-partitions
• https://www.ideserve.co.in/learn/find-the-number-which-occurs-odd-number-of-times
• https://www.ideserve.co.in/learn/comb-sort
• https://www.ideserve.co.in/learn/implement-a-fair-coin-using-an-unfair-coin
• https://www.ideserve.co.in/learn/find-the-missing-number-in-the-duplicate-array
• https://www.ideserve.co.in/learn/find-the-element-that-appears-once-in-an-array
• https://www.ideserve.co.in/learn/iterative-preorder-traversal-of-binary-tree
• https://www.ideserve.co.in/learn/maximum-size-square-sub-matrix-with-all-1s
• https://www.ideserve.co.in/learn/print-matrix-diagonally
• https://www.ideserve.co.in/learn/number-of-clusters-of-1s
• https://www.ideserve.co.in/learn/maximum-element-from-each-subarray-of-size-k-set-2
• https://www.ideserve.co.in/learn/maximum-element-from-each-subarray-of-size-k-set-1
• https://www.ideserve.co.in/learn/maximum-value-of-index-element-product-sum-with-only-rotations
• https://www.ideserve.co.in/learn/spiral-level-order-traversal-of-a-binary-tree-set-1
• https://www.ideserve.co.in/learn/spiral-level-order-traversal-of-a-binary-tree-set-2
• https://www.ideserve.co.in/learn/sum-of-two-linked-lists-using-recursion-set-2
• https://www.ideserve.co.in/learn/sum-of-two-linked-lists-using-stacks
• https://www.ideserve.co.in/learn/check-if-a-number-can-be-expressed-as-x-raised-to-power-y-set-2
• https://www.ideserve.co.in/learn/sum-of-two-linked-lists-using-recursion-set-1
• https://www.ideserve.co.in/learn/check-if-a-number-can-be-expressed-as-x-raised-to-power-y-set-1
• https://www.ideserve.co.in/learn/find-the-nth-most-frequent-number-in-array
• https://www.ideserve.co.in/learn/find-the-missing-number-in-the-increasing-sequence
• https://www.ideserve.co.in/learn/postfix-expression-evaluation
• https://www.ideserve.co.in/learn/maximum-average-subarray
• https://www.ideserve.co.in/learn/find-nth-node-from-the-end-of-linked-list
• https://www.ideserve.co.in/learn/lowest-common-ancestor-of-two-nodes-binary-search-tree
• https://www.ideserve.co.in/learn/remove-spaces-from-string
• https://www.ideserve.co.in/learn/set-partition-problem-dynamic-programming
• https://www.ideserve.co.in/learn/detect-a-loop-in-a-linked-list
• https://www.ideserve.co.in/learn/how-to-find-the-power-of-a-number
• https://www.ideserve.co.in/learn/set-partition-problem-recursion
• https://www.ideserve.co.in/learn/find-common-elements-in-n-sorted-arrays
• https://www.ideserve.co.in/learn/populate-right-neighbors-in-a-binary-tree
• https://www.ideserve.co.in/learn/word-break-problem
• https://www.ideserve.co.in/learn/diagonal-sum-of-a-binary-tree
• https://www.ideserve.co.in/learn/heap-sort
• https://www.ideserve.co.in/learn/minimum-trials-to-reach-from-source-to-destination-word
• https://www.ideserve.co.in/learn/square-root-of-a-number
• https://www.ideserve.co.in/learn/coin-change-problem-number-of-ways-to-make-change
• https://www.ideserve.co.in/learn/next-great-element-in-an-array
• https://www.ideserve.co.in/learn/size-of-largest-bst-in-binary-tree
• https://www.ideserve.co.in/learn/edit-distance-dynamic-programming
• https://www.ideserve.co.in/learn/minimum-cost-path
• https://www.ideserve.co.in/learn/minimum-number-of-coins-to-make-change
• https://www.ideserve.co.in/learn/remove-out-of-range-bst-nodes
• https://www.ideserve.co.in/learn/buy-and-sell-stock-part-one
• https://www.ideserve.co.in/learn/group-all-anagrams-together-set-1
• https://www.ideserve.co.in/learn/java-constructor
• https://www.ideserve.co.in/learn/merge-two-sorted-arrays-without-extra-space
• https://www.ideserve.co.in/learn/maximum-subarray-sum
• https://www.ideserve.co.in/learn/count-possible-decodings-of-a-given-digit-sequence
• https://www.ideserve.co.in/learn/next-greater-number-using-same-digits
• https://www.ideserve.co.in/learn/check-if-all-internal-nodes-have-one-child-bst
• https://www.ideserve.co.in/learn/convert-binary-tree-to-binary-search-tree
• https://www.ideserve.co.in/learn/find-number-of-binary-sequences
• https://www.ideserve.co.in/learn/leaders-in-an-array
• https://www.ideserve.co.in/learn/breadth-first-search-in-graph
• https://www.ideserve.co.in/learn/dynamic-programming-0-1-knapsack-problem
• https://www.ideserve.co.in/learn/length-of-longest-bitonic-subsequence-in-an-array
• https://www.ideserve.co.in/learn/longest-increasing-subsequence
• https://www.ideserve.co.in/learn/pancake-sorting
• https://www.ideserve.co.in/learn/check-if-identical-binary-search-trees-without-building-them-set-1
• https://www.ideserve.co.in/learn/check-if-identical-binary-search-trees-without-building-them-set-2
• https://www.ideserve.co.in/learn/count-frequencies-of-array-elements
• https://www.ideserve.co.in/learn/find-duplicates-in-an-array
• https://www.ideserve.co.in/learn/integer-array-corresponding-to-increase-decrease-sequence
• https://www.ideserve.co.in/learn/floor-ceiling-using-binary-search-tree
• https://www.ideserve.co.in/learn/generate-all-subsets-of-a-set-recursion
• https://www.ideserve.co.in/learn/increasing-subsequence-of-length-three-for-maximum-product-optimized
• https://www.ideserve.co.in/learn/increasing-subsequence-of-length-three-for-maximum-product
• https://www.ideserve.co.in/learn/re-arrange-elements-to-put-positive-negative-elements-in-alternate-order
• https://www.ideserve.co.in/learn/index-of-0-replacing-with-1-results-in-longest-continuous-1s-sequence
• https://www.ideserve.co.in/learn/index-of-0-replacing-with-1-results-in-longest-continuous-1s-sequence-linear-time
• https://www.ideserve.co.in/learn/remove-all-half-nodes-binary-tree
• https://www.ideserve.co.in/learn/length-longest-sub-array-with-elements-contiguous-sequence
• https://www.ideserve.co.in/learn/avl-tree-insertion
• https://www.ideserve.co.in/learn/check-if-a-binary-tree-is-subtree-of-another-binary-tree-space-optimized
• https://www.ideserve.co.in/learn/check-if-two-nodes-are-cousins-binary-tree
• https://www.ideserve.co.in/learn/print-nodes-of-binary-tree-without-sibling
• https://www.ideserve.co.in/learn/remove-all-nodes-which-lie-on-path-having-sum-less-than-k
• https://www.ideserve.co.in/learn/check-if-a-binary-tree-is-subtree-of-another-binary-tree-time-optimized
• https://www.ideserve.co.in/learn/check-if-n-ary-tree-is-symmetric-tree
• https://www.ideserve.co.in/learn/find-sum-of-all-left-leaves-binary-tree
• https://www.ideserve.co.in/learn/merge-sort
• https://www.ideserve.co.in/learn/mirror-of-n-ary-tree
• https://www.ideserve.co.in/learn/check-if-binary-tree-is-symmetric-tree
• https://www.ideserve.co.in/learn/depth-of-deepest-odd-level-leaf-node
• https://www.ideserve.co.in/learn/construct-binary-tree-from-parent-array
• https://www.ideserve.co.in/learn/find-height-of-binary-tree-from-parent-array
• https://www.ideserve.co.in/learn/binary-search-tree-insertion
• https://www.ideserve.co.in/learn/check-if-a-binary-tree-is-balanced
• https://www.ideserve.co.in/learn/avl-tree-deletion
• https://www.ideserve.co.in/learn/binary-search-tree-delete
• https://www.ideserve.co.in/learn/avl-tree
• https://www.ideserve.co.in/learn/longest-substring-with-non-repeating-characters
• https://www.ideserve.co.in/learn/first-non-repeating-character-in-a-string
• https://www.ideserve.co.in/learn/bubble-sort
• https://www.ideserve.co.in/learn/insertion-sort
• https://www.ideserve.co.in/learn/selection-sort
• https://www.ideserve.co.in/learn/check-balanced-parentheses-in-a-string
• https://www.ideserve.co.in/learn/check-if-a-binary-tree-is-a-binary-search-tree
• https://www.ideserve.co.in/learn/convert-a-binary-tree-to-doubly-linked-list
• https://www.ideserve.co.in/learn/nth-fibonacci-number
• https://www.ideserve.co.in/learn/rotate-an-array
• https://www.ideserve.co.in/learn/check-whether-binary-tree-is-complete-tree-or-not
• https://www.ideserve.co.in/learn/check-whether-binary-tree-is-full-binary-tree-or-not
• https://www.ideserve.co.in/learn/tower-of-hanoi-algorithm
• https://www.ideserve.co.in/learn/anagram-grouping-in-a-sequence-using-trie
• https://www.ideserve.co.in/learn/pattern-matching-using-trie
• https://www.ideserve.co.in/learn/reverse-words-in-a-string
• https://www.ideserve.co.in/learn/longest-prefix-match-using-trie
• https://www.ideserve.co.in/learn/trie-delete
• https://www.ideserve.co.in/learn/trie-insert-and-search
• https://www.ideserve.co.in/learn/print-binary-tree-vertical-order
• https://www.ideserve.co.in/learn/serialize-deserialize-binary-search-tree-using-post-order-traversal
• https://www.ideserve.co.in/learn/construct-binary-tree-from-inorder-and-postorder-traversals
• https://www.ideserve.co.in/learn/left-view-of-a-binary-tree
• https://www.ideserve.co.in/learn/serialize-deserialize-binary-search-tree
• https://www.ideserve.co.in/learn/construct-binary-tree-from-inorder-and-preorder-traversals
• https://www.ideserve.co.in/learn/bottom-view-of-a-binary-tree-using-level-order-traversal
• https://www.ideserve.co.in/learn/right-view-of-a-binary-tree
• https://www.ideserve.co.in/learn/top-view-of-a-binary-tree-using-level-order-traversal
• https://www.ideserve.co.in/learn/bottom-view-of-a-binary-tree
• https://www.ideserve.co.in/learn/top-view-of-a-binary-tree
• https://www.ideserve.co.in/learn/all-permutations-of-a-string
• https://www.ideserve.co.in/learn/check-if-two-binary-trees-are-identical
• https://www.ideserve.co.in/learn/lru-cache-implementation
• https://www.ideserve.co.in/learn/mirror-a-tree
• https://www.ideserve.co.in/learn/print-all-root-to-leaf-paths-of-a-binary-tree
• https://www.ideserve.co.in/learn/the-skyline-problem
• https://www.ideserve.co.in/learn/total-number-of-possible-binary-search-trees-with-n-keys
• https://www.ideserve.co.in/learn/trapping-rain-water-between-towers
• https://www.ideserve.co.in/learn/bellman-ford-shortest-path-algorithm
• https://www.ideserve.co.in/learn/binary-tree-level-order-traversal
• https://www.ideserve.co.in/learn/buy-and-sell-stocks-part-two
• https://www.ideserve.co.in/learn/convert-a-sorted-doubly-linked-list-to-balanced-binary-search-tree-bst
• https://www.ideserve.co.in/learn/create-a-balanced-bst-from-a-sorted-array
• https://www.ideserve.co.in/learn/dijkstra-shortest-path-algorithm
• https://www.ideserve.co.in/learn/distinct-binary-strings-of-length-n-with-no-consecutive-1s
• https://www.ideserve.co.in/learn/distribute-chocolates-problem
• https://www.ideserve.co.in/learn/find-10-letter-repeated-DNA-sequences
• https://www.ideserve.co.in/learn/find-a-peak-element-in-an-array
• https://www.ideserve.co.in/learn/find-an-element-in-a-sorted-rotated-array-without-finding-pivot
• https://www.ideserve.co.in/learn/find-an-element-in-a-sorted-rotated-array
• https://www.ideserve.co.in/learn/find-intersection-of-two-linked-lists-constant-space
• https://www.ideserve.co.in/learn/find-intersection-of-two-linked-lists
• https://www.ideserve.co.in/learn/find-majority-element-in-an-array
• https://www.ideserve.co.in/learn/find-median-of-two-sorted-arrays
• https://www.ideserve.co.in/learn/find-minimum-length-sub-array-with-sum-k
• https://www.ideserve.co.in/learn/find-pivot-in-a-sorted-rotated-array
• https://www.ideserve.co.in/learn/friend-circles-graph
• https://www.ideserve.co.in/learn/gold-mine-problem
• https://www.ideserve.co.in/learn/heavier-ball-puzzle
• https://www.ideserve.co.in/learn/how-to-recover-a-binary-search-tree-if-two-nodes-are-swapped
• https://www.ideserve.co.in/learn/inorder-successor-of-a-node-in-a-binary-tree
• https://www.ideserve.co.in/learn/inorder-traversal-of-a-binary-tree
• https://www.ideserve.co.in/learn/longest-common-subsequence
• https://www.ideserve.co.in/learn/longest-common-substring
• https://www.ideserve.co.in/learn/longest-increasing-subsequence-nlogn
• https://www.ideserve.co.in/learn/longest-palindromic-subsequence
• https://www.ideserve.co.in/learn/longest-palindromic-substring-manachers-algorithm
• https://www.ideserve.co.in/learn/longest-palindromic-substring
• https://www.ideserve.co.in/learn/lowest-common-ancestor-binary-tree
• https://www.ideserve.co.in/learn/merge-two-sorted-linked-lists
• https://www.ideserve.co.in/learn/minimum-depth-of-a-binary-tree
• https://www.ideserve.co.in/learn/minimum-stack
• https://www.ideserve.co.in/learn/palindrome-min-cut
• https://www.ideserve.co.in/learn/postorder-traversal-of-a-binary-tree
• https://www.ideserve.co.in/learn/preorder-traversal-of-a-binary-tree
• https://www.ideserve.co.in/learn/print-maximum-number-of-a-using-four-keys-of-special-keyboard
• https://www.ideserve.co.in/learn/prisoner-hat-puzzle
• https://www.ideserve.co.in/learn/reverse-a-linked-list-iterative
• https://www.ideserve.co.in/learn/reverse-a-linked-list-recursive
• https://www.ideserve.co.in/learn/reverse-every-alternate-k-nodes-of-a-linked-list
• https://www.ideserve.co.in/learn/search-a-sorted-matrix
• https://www.ideserve.co.in/learn/shortest-palindrome
• https://www.ideserve.co.in/learn/subset-sum-dynamic-programming
• https://www.ideserve.co.in/learn/toggle-bits
• https://www.ideserve.co.in/learn/topological-sorting-of-directed-acyclic-graph
• https://www.ideserve.co.in/learn/binary-search-in-a-sorted-array
• https://www.ideserve.co.in/learn/anagram-pattern-search
• https://www.ideserve.co.in/learn/longest-subset-with-consecutive-numbers
• https://www.ideserve.co.in/learn/next-higher-number
• https://www.ideserve.co.in/learn/time-and-space-complexity-of-recursive-algorithms
• https://www.youtube.com/watch?v=nbTSfrEfo6M&lc=z13nwxpgbubzfpibv04cix0y2zvsxruihic
• https://www.youtube.com/watch?v=NBcqBddFbZw&lc=z133wlf4hnykxlajw04cd1gygousux0bxsk0k
• https://www.youtube.com/watch?v=Cv0ft2dFz80&lc=z12byleiykq4g51cr22eenai3xjext2rx04
• https://www.facebook.com/IDeserve.co.in
• https://plus.google.com/+IDeserve