Problem Statement Given a gray code, write a program to convert the given gray code to binary code. Example Example Explanation In this, the MSB or the Most Significant Bit of the gray code will always be equal to the MSB of the binary code which in this case is 1. For changing the other bits of the gray ...
Problem Statement We need to print the bottom view of binary tree, i.e., all the bottommost nodes from left to right in a binary tree. The 3D projection of a binary tree will have different views from different angles. In our case, we’ll print the bottom view of the binary tree. It’s better to visualize them ...
Takeaways: Recursion: Recursion is a technique of problem-solving where a function is called again and again on smaller inputs until some base case i.e. smallest input which has a trivial solution arrives and then we start calculating the solution from that point. Recursion has two parts i.e. first is the base condition and another is the ...
Problem Statement We are given an array of integers, and we need to find the next greater element of every array elements. So, we need to find and print the next greater element of every array element. Note: Refer to the Example and Example Explanation sections for more details and the Approach section to understand how to find the next greater ...
Problem Statement You are given the head of a linked list, write a program to Find middle element in linked list. When there are even number of nodes in linked list, then there would be two middle nodes, return the second middle node. Example Input-1 Output-1 Explanation Here, 3 is the middle node of the ...
A Queue is an abstract linear data structure serving as a collection of elements that are inserted (enqueue operation) and removed (dequeue operation) according to the First in First Out (FIFO) approach. Takeaways Introduction to Queue A queue is a linear sequence of items arranged in an ordered fashion. It is based on the FIFO (First In First Out) i.e.i.e. item can only be inserted at ...
Divide and Conquer is a fundamental algorithmic technique in computer science, where a problem is divided into smaller, more manageable sub-problems, solved individually, and then combined to form the final solution. Divide and conquer algorithm approach not only simplifies complex problems but also enhances computational efficiency. How Does the Divide and Conquer Algorithm Work? The divide ...
Geometric Progression (GP) is a sequence where each term results from multiplying the previous one by a constant, known as the Common Ratio. Consider folding a paper multiple times: while it’s folded 4-5 times, determining its final stack height illustrates GP principles. This progression concept offers insights into patterns formed by consistent multiplicative growth. Notation ...
Merge sort is a sorting algorithm that is trivial to apply and has a time complexity of $O(n * logn)$ for all conditions (best case, worst case and average case). This algorithm is based on the divide and conquers strategy. The sorting algorithm continuously splits a list into multiple sublists until each sublist has only ...
As developers, we should be aware of the basic computer science concept of search algorithms such as linear search and binary search. Finding a given element’s occurrence in a list is the process of searching. In this article, we will discuss the difference between linear search and Binary search. There are two types of searching algorithms What ...