Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

Search in a 2-D Matrix

You are given a matrix arr of m x n size. Write a program to searches for a value k in arr. This arr has the following properties: - Integers in each row are sorted from left to right. - The first value of each row is greater than the last value of previous row. This is a basic optimization problem that will clear the concept of searching.

18 Jul 2020

AfterAcademy Tech

Binary Search

Given a sorted integer array arr[] of n elements and a target value k, write a program to search k in arr[]. The famous binary search algorithm is easy to implement and the best optimization technique for performing searching operations

18 Jul 2020

AfterAcademy Tech

Combination Sum

Given an array of integers arr[] and a target number k, write a program to find all unique combinations in arr[] such that the sum of all integers in the combination is equal to k. This famous backtracking problem has previously been asked in Adobe, Amazon, Facebook.

18 Jul 2020

AfterAcademy Tech

Generate Parentheses

Given n pairs of parentheses, write a program to generate all combinations of balanced parentheses. You have to return a string array containing all possible cases.

18 Jul 2020

AfterAcademy Tech

Max Product Subarray

You are given an array arr[] with n elements. Write a program to find the contiguous subarray which has the largest product. It's a typical optimization problem.

18 Jul 2020

AfterAcademy Tech

Maximal Square

You are given a 2D binary matrix arr[][] filled with 0's and 1's. The array contains a square of 1's. So, you need to find that square and return its area. The problem is a great example for practicing dynamic programming for technical interviews.

18 Jul 2020

AfterAcademy Tech

Interleaving Strings

Given three strings S1, S2 and S3, write a program which checks whether S3 is an interleaving of S1 and S2. The problem is a typical dynamic programming problem.

18 Jul 2020

AfterAcademy Tech

Minimum Number Of Jumps To Reach End

Given an array of non-negative integers arr[] of length n, where each element represents the max number of steps that can be made forward from that element. You are initially positioned at the first index of the array. Write a program to return the minimum number of jumps to reach the last index of the array.

18 Jul 2020

AfterAcademy Tech

Partition Equal Subset Sum

Given a non-empty array of positive integers arr[ ]. Write a program to find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

18 Jul 2020

AfterAcademy Tech

Recover Binary Search Tree-Interview Problem

Given a Binary Search Tree such that two of the nodes of this tree have been swapped by mistake. You need to write a program that will recover this BST while also maintaining its original structure

16 Jun 2020