Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Max Points On The Straight Line

Given N point on a 2D plane as pair of (x, y) coordinates, Write a program to find the maximum number of point which lie on the same line. This is a famous mathemtical problem and clears the concepts of problem related with XY planes.

16 Jun 2020

AfterAcademy Tech

Convert A Min Heap to Max Heap

Given array representation of min Heap, write a program to convert it to max Heap. This problem will clear the concepts of the heap and priority queue which is a very important concept of data structures.

11 Jun 2020

AfterAcademy Tech

Valid Anagram

Write a program to check whether the two strings are an anagram of each other or not. Like, "s" is an anagram of "t" if the characters of "s" can be rearranged to form "t". This simple problem will let you understand the concepts of string manipulation.

11 Jun 2020

AfterAcademy Tech

Minimum Spanning Tree

In this blog, we will learn about Minimum Spanning Tree. We will also discuss two algorithms which is used to find a minimum spanning tree.

08 Jun 2020

AfterAcademy Tech

Reverse An Array

Reverse a given array in-place. This question uses the concept of swapping.

08 Jun 2020

AfterAcademy Tech

Merge two Binary Trees - Interview Problem

This is an interview problem asked in companies like Amazon, Microsoft. The problem is to merge two binary trees. The overlapping nodes are replaced by the sum of corresponding nodes. We are discussing two ways of solving this.

06 Jun 2020

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