AfterAcademy Tech
In this blog, we have described the similarities and dissimilarities between the OSI and TCP/IP models. We've also tried to tell which model is better for which scenario.
11 Feb 2020
This blog discusses the concept of Exhaustive Search and Backtracking.
Binary Search Trees is one of the most important variation of binary tree and is extremely useful in practical applications. The blog discusses the operations and applications of this powerful data structure
Tree Data Structure supports various operations such as insertion, deletion and searching of elements along with few others. This blogs discussed those operations along with explaining its applications.
Given a square matrix, turn it by 90 degrees in the clockwise direction.
In this blog, we will discuss the types of linked list and basic operations that can be performed on a linked list.
Merge k sorted linked lists and return it as one sorted list.
Given a Linked List, your task is to find whether the given singly linked list is a palindrome or not. This is an interview problem asked in many companies like Amazon, Microsoft, Adobe, Flipkart and other big companies.
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.
