• 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++

18 April, 13 3

INTRODUCTION A is the most popular choice for pathfinding, because it’s fairly flexible and can be used in a wide range of contexts. A is like other graph-searching algorithms in that it can potentially search a huge area of the ...

27 March, 13 0

Skew heaps, just as leftiest heaps are advantageous in implementing the melding operation of two heaps, its complexity is log n. #include<iostream> using namespace std; class node{ public: int key; node *rc; node *lc; node *parent; node(){ key=0; rc=NULL; lc=NULL; ...

26 March, 13 0

Leftist Heap working code in C++ #include<iostream> using namespace std; class node{ public: int key; int rank; node *rc; node *lc; node *parent; node(){ key=0; rc=NULL; lc=NULL; parent=NULL; rank=cal_rank(rc); } int cal_rank(node *root){ node *temp; temp=root; int count=0; while(temp!=NULL){ temp=temp->rc; ...

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] ...

9 February, 13 0

Hi Everyone, As we know C++ is an object oriented language. One of the object oriented feature is polymorphism, and it is implemented using function overloading, operator overloading and virtual function. In this tutorial we will be talking about name ...

6 February, 13 0

Boruvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct. The algorithm begins by first examining each vertex and adding the cheapest edge from that vertex to another in ...

23 January, 13 2

Problem Statement: You are given a set of n types of rectangular 3-D boxes, where the ith box has height h(i), width w(i) and depth d(i) (all real numbers). You want to create a stack of boxes which is as ...

21 January, 13 6

The Fibonacci Sequence is defined as a0 = 0, a1 = 1, and ai = ai - 1 + ai - 2 for all . The first few terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21... Since ...

21 January, 13 1

Solution 1: Use two loops to check for duplicates. Complexity: O(n^2) Solution 2: We can use hash the characters and check if an element already exists. Complexity: O(n) Space complexity: O(256 characters) What about minimizing the space used above by ...

16 January, 13 0

The article is an extension to the tutorial on insertion sort. http://learn.hackerearth.com/tutorial/sorting-algorithm/60/insertion-sort/ Combining binary search with insertion sort - Binary insertion sort Can we bring down the complexity of insertion sort to (N log N)? Observe that the cards in ...