AfterAcademy Tech
In this blog, we will learn Breadth First Search that is used for Graph Traversal i.e. the Breadth First Search is used to traverse each and every node of a graph. So, let's learn together.
In this blog, we will learn Depth First Search that is used for Graph Traversal i.e. the Depth First Search is used to traverse each and every node of a graph. So, let's learn together.
In this blog, we will discuss about the linear data structure called Linked Lists. We will discuss its properties, advantages, and disadvantages. So, let's get started
Divide and Conquer and Dynamic Programming are two most used problem-solving skills in Data Structures. In this blog, we will see the similarities and difference between Dynamic Programming and Divide-and-Conquer approaches.
This is a mathematical problem asked in interviews of Google like companies. For solving such problems you need to have some math skills and also some idea of algorithms like Euclid's GCD algorithm.
This is a famous interview problem based on dynamic Programming. This question has been asked in big companies like Amazon. Here we need to find the path between the given source and destination that gives the minimum cost.
This is an interview problem asked in companies like Google, Microsoft, Amazon. The problem is to remove duplicates from a sorted array or list.
Array and Linked List are the two most used data structures. It's really important to understand and compare the advantages and disadvantages of both array and linked list. In this blog, we will compare these two linear data structures. So let's get started.
Calculate the value of x^n.
In this blog, we will see the difference between a binary search tree and a hash table. We will see which data structure should be used when to solve our problems.
