Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

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

AfterAcademy Tech

What are UNION, MINUS, and INTERSECT commands in DBMS?

In this blog, we will learn what are the UNION, MINUS, and INTERSECT commands in SQL. We will also see their application with examples.

06 Apr 2020

AfterAcademy Tech

What is Cross-Join in DBMS?

In this blog, we will learn how to cross-join two tables in DBMS, and what are the benefits of doing it with example.

06 Apr 2020

AfterAcademy Tech

What is the difference between logical and physical address wrt Operating System?

In this blog, we will learn about the two types of addresses that are used for memory in the operating system. Further, we will discuss the difference among these types of memories i.e. logical memory and physical memory.

30 Mar 2020

AfterAcademy Tech

What is Fragmentation and what are its types?

In this blog, we will learn about the fragmentation problem that occurs during memory allocation. We will also study the types of fragmentation i.e. internal fragmentation and external fragmentation.

30 Mar 2020

AfterAcademy Tech

First Unique Character In A String

Given a string S, write a program to find the first non-repeating character in it and return its index. The problem needs to be solved in O(n) and needs the knowledge of a hash map to solve.

30 Mar 2020

AfterAcademy Tech

Triplet With Zero Sum

Given an array arr[ ] of n integers, are there elements x, y, z in arr such that x + y + z = 0? Find all unique triplets in the array which gives the sum of zero. The problem is asked in many interviews and required do be solved in O(n^2) with constant space.

30 Mar 2020

AfterAcademy Tech

Sudoku Solver

This problem is based on the famous sudoku puzzle. A sudoku board of 9x9 is given and you are expected to fill it correctly. The problem requires knowledge of Backtracking. This is a typical backtracking problem.

30 Mar 2020

AfterAcademy Tech

Find an Element In a Bitonic Array

Given a bitonic sequence of n distinct elements, write a program to search a given element k in the bitonic sequence. Bitonic Sequence is a sequence of numbers that is first strictly increasing then after a point strictly decreasing.

23 Mar 2020