Algorithm Understanding Dijkstra's Algorithm Finding shortest path between two vertices has many applications be it in the field of navigation, networking or any other field. In this post we are going to discuss about

Algorithm Understanding Floyd-Warshall Algorithm Finding the shortest path in a weighted graph is a difficult task, but finding shortest path from every vertex to every other vertex is a daunting task. In this post

Data Structure Understanding AVL Tree In computer science, AVL Tree, named after its Soviet inventors Georgy Adelson-Velsky and Evgenii Landis, is a self-balancing binary search tree (BST). In this post we will be looking about

Data Structure Understanding Trie Data Structure Trie, also known as Digital Tree or Prefix Tree, is a kind of tree data structure used to store a dynamic set where the keys are usually strings. Tries are

Algorithm Understanding Breadth First Search Graphs are useful in a lot of practical scenarios like in fields of networking, game theory and social media among many others. Often situations involving graphs involves traversal of the

Algorithm Understanding Depth First Search Graphs are useful in a lot of practical scenarios like in fields of networking, game theory and social media among many others. Often situations involving graphs involves traversal of the

Algorithm Understanding Articulation Points and Bridges Graph is at the base of many applications, namely networking, navigation system, recommender system etc. However, in most cases, for a graph to be stable for the given application should

Algorithm Understanding Kadane's Algorithm Array is almost, in some way, in every application of programming and computer science in general. With array being so important in practical application any procedure on array becomes significant.

C Gentle Introduction to C : Array Welcome to the ninth part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this post,

Algorithm Understanding Manacher's Algorithm Palindromes are one of the most beautiful strings in the world but finding the longest palindromic substring is one of the most computationally daunting task. In this post I am

C Gentle Introduction to C : Recursion Welcome to the eight part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this post,

Competitive Programming Getting Started with Competitive Programming There are thousands of answers to this question and honestly none of them are wrong. I guess one should stop looking for more answers and start following one of them

C Gentle Introduction to C : extern Keyword Welcome to the seventh part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this part,

C Gentle Introduction to C : void Pointer Welcome to the sixth part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this part

C Gentle Introduction to C : Pointers Welcome to the fifth part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this part

C Gentle Introduction to C : Call by Value and Reference Welcome to the fourth part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this part

C Gentle Introduction to C : main() Function Welcome to the third part of the Gentle Introduction to C series. As said before this series aims to provide you with a brief introduction to C language. In this

C Gentle Introduction to C : Function Welcome to the second part of the Gentle Introduction to C series. As said before this series aims to provide you a brief introduction to C language. In this part

C Gentle Introduction to C : Header Files Welcome to the first part of the Gentle Introduction to C series. This series will aim to give you a brief introduction to C language. In this part we will

Algorithm Understanding KMP Algorithm Pattern searching is a classic question which refers to the act of searching for the occurrences of a smaller string in a bigger string (in terms of length). The KMP