AfterAcademy Tech
This is a problem of converting roman numerals into corresponding integer values. This problem is asked by Amazon, Microsoft, Facebook in their interviews.
16 Jan 2020
You have a sorted and rotated array where elements are sorted and rotated circularly. Write a program to find the minimum element in the array.
In this blog, we will learn about the concept of hashing in programming. We will learn about Direct Address Table, Hash Table, Hash Function, a collision in Hash table. So, let's get started.
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.
In this blog, we will learn about the types of network based on design, that are Peer-to-Peer, and Server-Based networks. We will also see the applications, advantages, and disadvantages of using these networks.
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.
In this blog, we will learn what are unique keys and what is the need for unique keys. We will also discuss various points on which the unique key differ from a primary key.