Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Priority Queues

Priority Queues are similar to queues where we insert an element from the back and remove an element from the front, but with one difference that the logical order of elements in the priority queue depends on the priority of the elements. In this blog, we will discuss the priority queues, its properties, its various implementations, and its applications. We will also analyze and compare the various implementations of the Priority Queue.

18 Feb 2020

AfterAcademy Tech

Introduction to Heaps in Data Structures

Heap is a very useful data structure that every programmer should know well. The heap data structure is used in Heap Sort, Priority Queues. The understanding of heaps helps us to know about memory management. In this blog, we will discuss the structure, properties, and array implementation of heaps.

18 Feb 2020

AfterAcademy Tech

Remove Duplicates From a Sorted Linked List-Interview Problem

This is an interview problem asked by companies like Myntra, Visa, Oracle, Adobe, etc. The problem is to remove the duplicate nodes from the given Linked List so that only unique nodes(with unique data values) are present.

18 Feb 2020

AfterAcademy Tech

Steps Of Problem Solving During Technical Interview

In this blog, we will discuss about the steps of problem solving during the technical interview and how to cross the first hurdle for a programmer to get into the software industry and land their dream job.

11 Feb 2020

AfterAcademy Tech

Which model is better, OSI or TCP/IP?

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

AfterAcademy Tech

What is Backtracking?

This blog discusses the concept of Exhaustive Search and Backtracking.

11 Feb 2020

AfterAcademy Tech

Binary Search Tree: Introduction, Operations and Applications

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

11 Feb 2020

AfterAcademy Tech

What are the operations implemented in tree and what are its applications?

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.

11 Feb 2020

AfterAcademy Tech

Rotate Matrix

Given a square matrix, turn it by 90 degrees in the clockwise direction.

11 Feb 2020

AfterAcademy Tech

Types of Linked List and Operation on Linked List

In this blog, we will discuss the types of linked list and basic operations that can be performed on a linked list.

10 Feb 2020