C Programming Tutorial

C++ Tutorial

DBMS Tutorial

Digital Electronics Tutorial

Git Tutorial

Interview Questions

  Algorithm Interview Questions
  Array Interview Questions
  Dynamic Programming Interview Questions
  Graph Interview Questions
  Hashing Interview Questions
  LinkedList Interview Questions
  Matrix Interview Questions
  Queue Interview Questions
  Sorting Interview Questions
  SQL Interview Questions
  Stack Interview Questions
  String Interview Questions
  Tree Interview Questions

Java Tutorial

  Multithreading Tutorial

JavaScript Tutorial

PHP Tutorial

Python Tutorial

R Programming Tutorial

Spring Boot Tutorial

SQL Tutorial

Testing Tutorial

  Selenium Tutorial
  Types of Testing

WordPress

Latest Articles

KMP Algorithm

KMP(Knuth-Morris-Pratt) algorithm is used for pattern searching in a given string. We are given a string S and a pattern p, our goal is to determine whether or not the given pattern is present in the string. Example Input: S = “aaaab” p = “aab” Output: true Naive Approach The …

Read moreKMP Algorithm

Prim’s Algorithm

Prim’s algorithm is used to find the Minimum Spanning Tree(MST) of a connected or undirected graph. Spanning Tree of a graph is a subgraph that is also a tree and includes all the vertices. Minimum Spanning Tree is the spanning tree with a minimum edge weight sum. Example Graph Minimum …

Read morePrim’s Algorithm

Sudoku Solver

In the sudoku solver problem we have given a partially filled (9 x 9) sudoku, write a program to complete the puzzle. Sudoku must satisfy the following properties, Every number(1-9) must appear exactly once in a row and once in a column. Every number(1-9) must appear exactly once in a …

Read moreSudoku Solver