AfterAcademy Tech
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.
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.
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.
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.
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.
Coding interview preparation plan and the topics that you should cover before your interview. It will help you to get a basic plan structure that you should manage and keep your schedule accordingly.
This is an interview problem asked in companies like Microsoft, Amazon, Adobe, Flipkart, etc. Here, we need to implement Queue data structure using another data structure Stack. This problem is meant for testing the data structure knowledge.
In this blog, we will get to know everything about GSoC i.e. how to apply, when to apply, what are the benefits of GSoC, etc.
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 various operations that are done on heaps.
Given n non-negative integers representing an elevation map where the width of each bar is 1. Write a program to compute how much water it is able to trap after raining.