AfterAcademy Tech
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 the structure, properties, and array implementation of heaps.
This is an interview problem asked by companies like Myntra, Visa, Oracle, Adobe, etc. The problem is to remove the duplicate nodes from the given Linked List so that only unique nodes(with unique data values) are present.
In this blog, we will discuss about the steps of problem solving during the technical interview and how to cross the first hurdle for a programmer to get into the software industry and land their dream job.
This blog discusses the concept of Exhaustive Search and Backtracking.
Binary Search Trees is one of the most important variation of binary tree and is extremely useful in practical applications. The blog discusses the operations and applications of this powerful data structure
Tree Data Structure supports various operations such as insertion, deletion and searching of elements along with few others. This blogs discussed those operations along with explaining its applications.
Given a square matrix, turn it by 90 degrees in the clockwise direction.
In this blog, we will discuss the types of linked list and basic operations that can be performed on a linked list.
Merge k sorted linked lists and return it as one sorted list.
Given a Linked List, your task is to find whether the given singly linked list is a palindrome or not. This is an interview problem asked in many companies like Amazon, Microsoft, Adobe, Flipkart and other big companies.
