Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Dijkstra’s Algorithm

In this blog, we will discuss Dijkstra's Algorithm. We will discuss what is the Dijkstra's Algorithm, how can we find the shortest path from source to other vertices using Dijkstra's Algorithm in Graph, Illustration using an example, its pseudo-code.

01 May 2020

AfterAcademy Tech

Min Stack Problem

This is an interview problem asked in companies like Amazon, Microsoft, Yahoo and Adobe. The problem is to design a stack that will support push(), pop(), top() and getMin() operation in constant time. We will be discussing two different ways to approach this problem.

01 May 2020

AfterAcademy Tech

Search For A Range In Sorted Array

Given a sorted array A[] with possibly duplicate elements, write a program to find indexes of first and last occurrences of an element k in the given array. This question will clear your concept of Binary Search

01 May 2020

AfterAcademy Tech

What is a Thread in OS and what are the differences between a Process and a Thread?

In this blog, we will learn about threads and its two types i.e. user-level thread and kernel-level thread. We will also see what are the advantages of using threads in the OS. Finally, we will learn about the difference between process and thread

01 May 2020

AfterAcademy Tech

What is the concept of Multithreading in OS and what are its benefits?

In this blog, we will learn about various multithreading models like one-to-one, many-to-one, and many-to-many. We will compare these models and analyze which one is the best. Further, we will also see the benefits of multithreading.

01 May 2020

AfterAcademy Tech

What is the difference between SQL and SQL server?

In this blog, we will learn about the various differences between SQL and SQL server based on some points.

01 May 2020

AfterAcademy Tech

Inversion Count in an Array-Interview Problem

Given an array of integers A[ ], if i < j and A[i] > A[j] then the pair (i, j) is called the inversion of an array A[ ]. You need to write a program to find the total counts of inversion in an array A[ ]. The inversion count of an array suggests how close the array is from being sorted. This problem has been asked in Amazon and Google's interview.

01 May 2020

AfterAcademy Tech

Migrating from Promise chains to Async/Await

Introduces Async/Await and compare it with Promises. We shall discuss migrating your from Promise Chains to Async/Await .

30 Apr 2020

AfterAcademy Tech

What is Load Balancing? How does it work?

In this blog, we will learn the concept of Load Balancing. We will see why load balancing is important while we scale our product and how can we reduce the load on a particular server.

29 Apr 2020

AfterAcademy Tech

Create React Isomorphic App like a Pro

Developing a modern web app is challenging, mostly because of the choice paralysis. It hit me too when I started with web development a few years back. In this blog, I have discussed my experiences with React.

28 Apr 2020