Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Topological Sorting

In this blog, we will discuss Topological sort in a Directed Acyclic Graph. We will discuss what is the Topological Sort, how can we find Topological Ordering, Illustration using a Directed Acyclic Graph, its pseudo-code, and its applications.

01 May 2020

AfterAcademy Tech

Optimal Substructure and Overlapping Subproblems

In this blog, we will understand the optimal substructure and overlapping subproblems property. We will also discuss how the problems having these two properties can be solved using Dynamic programming.

01 May 2020

AfterAcademy Tech

Merge Overlapping Intervals

You will be given a set of intervals in the form of a 2-D array, write a program to merge all the overlapping intervals, and return the array. This problem will clear the concept of intervals and Graph

01 May 2020

AfterAcademy Tech

Path Sum In Binary Tree

Given a binary tree and a sum, write a program to determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Its an easy problem based on Binary tree traversal and a famous interview question

01 May 2020

AfterAcademy Tech

Maximum Product Of Three Numbers

write a program to find three numbers whose product is maximum and output the maximum product. This is a basic mathematical problem and requires logical skill to solve.

01 May 2020

AfterAcademy Tech

Check If Two Arrays Are Equal Or Not

Given two given arrays of equal length, Check if given arrays are equal or not. This is a tricky interview problem as, at first, this looks like problem-related to combinatorics but could be solved quickly upon thinking.

01 May 2020

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