Logo
PublicationTech InterviewYouTubeSay Hello

Publication

Popular Tags
  • #JAVASCRIPT
  • #ANDROID
  • #NODEJS
  • #BACKEND
  • #MACHINE_LEARNING
AfterAcademy Tech
Matrix Chain Multiplication

AfterAcademy Tech

Matrix Chain Multiplication

Given a chain <M1, M2...Mn> of n two-dimensional matrices, write a program to fully parenthesize the product M1×M2×⋯×Mn in a way that minimizes the number of multiplications. It's a famous dynamic programming problem.

02 Jun 2020

AfterAcademy Tech
Longest Arithmetic Progression

AfterAcademy Tech

Longest Arithmetic Progression

The problem requires knowledge of dynamic programming and Arithmetic progression. Given a set of integers in an array A[] of size n, write a program to find the length of the longest arithmetic subsequence in A.

02 Jun 2020

AfterAcademy Tech

AfterAcademy Tech

Gas Station Problem

There are N gas stations along a circular route, where the amount of gas at station i is arr[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). At the beginning of the journey, the tank is empty at one of the gas stations. Return the minimum starting gas station's index if you can travel around the circuit once, otherwise return -1.

02 Jun 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

All Nodes Distance K in Binary Tree

Find all nodes at a distance k from a target node. This problem requires the knowledge of tree data structure. Recursion and tree traversals would be the base of the solution for this problem.

02 Jun 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

What is a Phantom deadlock?

In this blog, we will learn about a specific deadlock, i.e., Phantom deadlock, and will also see some examples of its occurrence.

02 Jun 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

What is Banker’s algorithm?

In this blog, we will see one of the deadlock avoidance methods i.e. Banker's Algorithm. In this algorithm, we will discuss that if we are given the number of resources available and the number of resources required by the process then we can tell that if the system will go in deadlock or not. We will understand this concept with the help of an example.

02 Jun 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

Getting started with Express.js

In this tutorial, we are going to learn about Express.js, why it is used, what all features it offers, and how it is used in the development environment. This tutorial will provide you with the most basic and important knowledge that is required in order to use Express in web application servers.

28 May 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

From JavaScript to TypeScript

In this tutorial, we are going to learn about some of the features that TypeScript provides which may or may not be present in JavaScript and are important to know if you are migrating from JavaScript to TypeScript.

15 May 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

NPM vs Yarn

npm and Yarn are two very popular and highly used package managers and we discuss on the comparisons between the two in this blog

11 May 2020
Thumbnail

AfterAcademy Tech

AfterAcademy Tech

Binary Tree Zig Zag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes' values. (i.e, from left to right, then right to left for the next level and alternate between). The problem is a typical Interview problem based on Tree Traversal

04 May 2020
Thumbnail

  • 1
  • …
  • 6
  • 7
  • 8
  • …
  • 33

Popular Tags
  • #JAVASCRIPT
  • #ANDROID
  • #NODEJS
  • #BACKEND
  • #MACHINE_LEARNING
CONNECT WITH US

© Copyright 2025 AfterAcademy
Privacy Policy
Terms And Conditions
Cookie Policy
This website uses cookies to ensure you
get the best experience on our website.
Read More