AfterAcademy Tech
Given an array of distinct integers A[ ], write a program to find all pairs of elements with the minimum absolute difference of any two elements.
This is an interview problem asked by companies like Amazon. This problem is based on Greedy Algorithm and is one of the very basic problem for understanding Greedy Algorithms.
It is important to know traversal techniques in a tree before solving tree problems. We have discussed the 3 primary traversals in a tree at length in this blog with both recursive and iterative implementations.
Tree is a widely-used powerful data structure that is a viable addition to a programmer’s toolkit. We shall be discussing the types and properties of trees in this blog.
Dynamic Programming is one of the most commonly used approach of problem-solving during coding interviews. We will discuss how can we approach to a problem using Dynamic Programming and also discuss the concept of Time-Memory Trade-Off.
Find two lines, which together with x-axis forms a container, such that the container contains the most water.
This is an interview problem based on the concept of dynamic programming. This question has been asked in various companies. We are dealing with solutions based on recursion, memorization and dynamic programming.
Given an array of distinct integers S, return all possible subsets. The set is not necessarily sorted and the total number of subsets of a given set of size n is equal to 2^n.
This is an interview problem asked in companies like Amazon, Facebook and Microsoft. The problem is to reverse a linked list from position m to n and print the reversed linked list.
Queue is a necessary addition in a programmer's toolkit. We will discuss the basic design structure of queue and what operations are performed on it. This blog also discusses the implementation of queue using arrays and linked lists
