Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Minimum Absolute Difference in a BST-Interview Problem

This is an interview problem asked in Google technical interview. Given a BST(Binary Search Tree) with non-negative values, write a program to find the minimum absolute difference between values of any two nodes.

06 Jun 2020

AfterAcademy Tech

Find the Closest Palindrome

Given an integer k, write a program to find the closest integer (not including itself), which is a palindrome.

06 Jun 2020

AfterAcademy Tech

Sliding Window Maximum

You are given an integer array arr of size n. Assume a sliding window of size k starting from index 0. In each iteration, the sliding window moves to the right by one position till n-k. Write a program to return an array representing the maximum number in all sliding windows.

02 Jun 2020

AfterAcademy Tech

Applications of Hash Table

Hashing is a way to store data into some data structure (generally Hash Table is used) in such a way that the basic operations on that data i.e. the insertion, deletion, and searching can be performed in O(1) time. It is one of the important concepts that every programmer and developer should know. In this blog, we will know some of the applications on Hash Table.

02 Jun 2020

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

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

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

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

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

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