• All
• Dynamic Programming
  • Longest Increasing Subsequence
  • Change Making Problem
  • Structure Padding and Data Packing
  • Register variable
  • Integer Knapsack Problem( Duplicate items permitted)
  • 0/1 knap sack problem
  • Matrix Chain Multiplication
  • Fibonnaci Sequence
  • Stacking of boxes
• Graph Algorithms
  • Dijkstra's Algorithm
  • Prims Algorithm
  • Kruskal's Algorithm
  • Boruvka's algorithm
  • A* Search Algorithm
• Sorting Algorithm
  • Sorting a Linked List
  • HeapSort
  • Function pointer and Call back function
  • Dutch National Flag problem
  • Insertion Sort
  • Binary Insertion Sort
• Data Structures
  • Stack
  • Queue
  • Trie
  • Union-Find DataStructure
  • Implementing leftist heaps
  • Skew heaps
• Arrays and Lists
  • Singly Linked List
  • Circular Linked List
  • Doubly Linked List
  • Adjacency List
  • Skip List
  • Loop in a linked list
  • Check for pair in A[1..n] & B[1..n] with sum equal to given K
  • Check for duplicates in string
• Trees
  • Balanced Binary Tree
  • Binary Search Tree
  • Breadth Order Traversal
  • Iterative Tree Traversals
  • Understanding Tree Traversing
• String Manipulation
  • Lexicographic Comparison of Strings
• Number Theory
  • Permutations of N numbers
  • Permutation with Duplicates
  • All Possible k Combinations of n numbers
  • Roots of a Quadratic Equation
• Hashing
  • Hash Table for Strings
• Testing
  • Testing of functions
• Operating System
  • Memory segments
  • GPOS vs RTOS
  • Top 5 bugs in embedded systems
  • Program Vs Process Vs Thread
  • Reentrant procedure
  • Booting steps in linux
  • Mutex vs Semaphore
• Programming
  • Virtual Function and Virtual Table in C++
  • Singleton Pattern - Design Pattern
  • Virtual Destructor in C++
  • C++ Class Functions
  • Polymorphism C++
  • Deep Copy and Shallow Copy
  • Macro and Functions
  • P, NP-Complete, NP, and NP-Hard
  • Garbage Collection in C++ using auto_ptr
  • Working of Recursive function
  • Storage Class In C (auto and static )
  • C++ STL MAP and multiMAP
  • Virtual Functions
  • Short-Circuit Evaluation
  • Factorial of large numbers ( number with at most 100 digits in it)
  • Name Mangling in C++

25 February, 12 0

This is an implementation of a Binary tree and it supports the following functions Insertion Deletion Search Preorder traversal Inorder traversal Postorder traversal Both recursive and iterative implementation are given for the traversals. It uses a Stack.h file, stacks are ...

25 February, 12 0

The most difficult operation in a Binary Search Tree is the delete operation. So we suggest you read it carefully, for a further understanding of delete operation you can read the wiki article here #include < iostream > using namespace ...

25 February, 12 0

Breadth order traversal is a very useful tree traversal, unlike depth order traversal, all the neighbors(or children in case of a tree) are visited before any node that lies below them. Breadth order traversal is used to find the shortest ...

25 February, 12 0

Tree traversals, are very important for any interview. Almost any interview question that you get, can be solved by finding out the correct traversal to use. You can read and compare various tree traversals from here . Although the recursive ...

23 March, 13 0

#include <iostream> using namespace std; struct node{ int val; node * right, * left; }; void main() { node *root; root = NULL; void Insert(node *root,const int& val) ; void InOrderTraversal(node *root); void preOrderTraversal(node *root); void PostOrderTraversal(node *root); int arr[10] ...