Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

TypeScript Tutorial For Beginners

In this tutorial, We are going to learn about the basics of Typescript. If you are having any doubts, whether to use typescript over javascript or Do I really need it? then this article is for you. Learn the concepts behind Typescript and its necessity in today's world.

09 Apr 2020

AfterAcademy Tech

How to become Developer Student Clubs Leads?

If you want to share your knowledge with others and want to learn back from them, then you must be in some community. Developer Student Clubs is one such community by Google Developers. Learn how to become a Developer Student Clubs lead at your campus.

08 Apr 2020

AfterAcademy Tech

Heap Building and Heap Sort

Heap is a very useful data structure that every programmer should know well. The heap data structure is used in Heap Sort, Priority Queues. The understanding of heaps helps us to know about memory management. In this blog, we will discuss the various about Heap Building and Heap Sort.

07 Apr 2020

AfterAcademy Tech

Longest Increasing Subsequence - Interview Problem

You are given an array A with N elements. You need to find the longest increasing subsequence in the array.

07 Apr 2020

AfterAcademy Tech

Longest Common Prefix

Find the LCP. This is a very famous interview problem and demonstrates the use of various approaches and techniques to solve.

07 Apr 2020

AfterAcademy Tech

What is Belady’s Anomaly?

In this blog, we will learn what is Belady's anomaly and we will analyze how increasing the frame number leads to Beladys Anomaly in FIFO.

07 Apr 2020

AfterAcademy Tech

Remove Nth Node From End of List

You are given a linked list, write a program to remove the nth node from the end of the list and return the head. This problem has been previously asked in Google and Amazon and requires the understanding of the linked list to solve it.

06 Apr 2020

AfterAcademy Tech

Sort A Stack Using Another Stack

Given a stack, you have to sort it in ascending order. You can use another stack if you need auxiliary space. The problem is asked in Google, Microsoft and Amazon and requires knowledge of Stack and recursion to solve it.

06 Apr 2020

AfterAcademy Tech

Edit Distance

Write an algorithm to find the minimum number of operations required to convert string S1 into S2.

06 Apr 2020

AfterAcademy Tech

Median in a Row-wise Sorted Matrix-Interview Problem

The problem is to find the median in a row-wise sorted matrix. This is an interview problem asked in companies like Amazon. There is a further constraints on extra space. We have discussed two possible solutions.

06 Apr 2020