IDeserve

As a part of simplifying the process of learning algorithms, we have created a free learning platform which is centered around an idea that visualization of algorithms is one of the most effective ways to learn them.
www.ideserve.co.in - A smart way of learning various Programming Interview topics like Dynamic Programming, Trees, Stack, Queues, Arrays, Linked List, Bit Manipulation, Recursion, Graphs and many more.

This platform uses visualization techniques for explaining algorithms which involve:
a. Animated explanations through videos.
b. Code visualization section where you can step through the code and understand how at each step the current memory state, objects and stack frames are changing. Requesting to please checkout www.ideserve.co.in/learn/buy-and-sell-stock-part-one
c. Detailed explanations using visual media. Requesting to please checkout www.ideserve.co.in/learn/heap-sort

If you like the platform, please help us to spread the word.

Next Higher Number

Next Higher Number
Longest Substring With M Unique Characters

Longest Substring With M Unique Characters
Anagram Pattern Search

Anagram Pattern Search
Largest Subset With Consecutive Numbers

Largest Subset With Consecutive Numbers
Serialize and Deserialize a Binary Tree

Serialize and Deserialize a Binary Tree
Largest Node on the Right for Each Node in a Linked List

Largest Node on the Right for Each Node in a Linked List
Multiply all fields except its position in an array

Multiply all fields except its position in an array
Adaptive Huffman Coding - Part 2

Adaptive Huffman Coding - Part 2
Find the missing number in duplicate array

Find the missing number in duplicate array
Segregate Even And Odd Nodes in a Linked List

Segregate Even And Odd Nodes in a Linked List
First non repeating character in a string

First non repeating character in a string
Convert Excel Sheet Row Numbers to labels and reverse

Convert Excel Sheet Row Numbers to labels and reverse
Shortest Range in K sorted lists

Shortest Range in K sorted lists
Implement a fair coin given an unfair coin

Implement a fair coin given an unfair coin
Adaptive Huffman Coding Tree Example

Adaptive Huffman Coding Tree Example
Huffman Coding

Huffman Coding
Serialize and Deserialize a Binary Search Tree in O(n) time

Serialize and Deserialize a Binary Search Tree in O(n) time
Find the element that appears once in an array

Find the element that appears once in an array
Building Bridges Dynamic Programming

Building Bridges Dynamic Programming
Serialize and Deserialize a Binary Search Tree

Serialize and Deserialize a Binary Search Tree
Find the number which occurs odd number of times

Find the number which occurs odd number of times
Trie Insert and Search

Trie Insert and Search
Maximum element from each subarray of size k

Maximum element from each subarray of size k
Check if binary tree is balanced

Check if binary tree is balanced
Converting Binary Tree to Binary Search Tree without changing spatial structure

Converting Binary Tree to Binary Search Tree without changing spatial structure
Square root of a number

Square root of a number
Check if Binary Tree is Symmetric or Not

Check if Binary Tree is Symmetric or Not
Populate next right pointers in a binary tree

Populate next right pointers in a binary tree
Count frequencies of array elements in range 1 to n

Count frequencies of array elements in range 1 to n
Spiral level order traversal of a binary tree

Spiral level order traversal of a binary tree