Overview In this article, we are going to learn about Logarithms in programming. Before getting started with the topic, let us get a short overview of what is Logarithms. Logarithms: In mathematics, the inverse of an exponential function is called the logarithmic function. In simple terms, the logarithm is the exponent or power of any ...
Problem Statement Given a singly linked list, use the merge sort algorithm to sort the list in the ascending order of their node’s values. Example Input Output Example Explanation The nodes in the input are not arranged in any particular order, while they are arranged in ascending order of their value in the output. Constraints ...
Problem Statement Given two linked lists which are sorted in increasing order. Merge both lists into a single linked list which is also sorted in increasing order. Example Input : Output: Explanation As we can see that if we merge both lists and arrange them in increasing order, it will become 1->2->3->4->4->6->7->8->9. Constraints $1 <= ...
Problem Statement Given an integer k and an array of size n consisting of unique integers. Find the kth largest element in this array. Examples Input : 1 Output : 1 Input : 1 Output: 2 Explanation Constraints All the elements of the array are unique Approach – 1 : Sorting In this approach, we ...
Overview The hamiltonian graph is the graph having a Hamiltonian path in it i.e. a path that visits each and every vertex of the graph exactly once, such graphs are very important to study because of their wide applications in real-world problems. Hamiltonian graphs are used for finding optimal paths, Computer Graphics, and many more ...
Problem Statement A linked list of length n is provided. Every node also has a random pointer that could refer to any node in the list or to null. The list should be built as a deep copy (A copy of an object that does not share the same references as the source object from which ...
Problem Statement Given a binary tree $A$ containing $n$ nodes, consider diagonals (lines with a slope of $-1$) passing between the nodes and print all the diagonal elements in the binary tree belonging to the same line. Note: The diagonals with a slope of $-45\text{ degree}$ angle, will be like a $\backslash$. This question has ...
In a Binary Search Tree, the Inorder Successor of a given node is defined as the node with the smallest value greater than the value of the given node. It can also be defined as the node next to the current node in the Inorder Traversal of the tree, as inorder traversal of BST returns the nodes in ...
Problem Statement There is n number of people standing in a circle. Numbering starts from 1 to n and is in the fixed clockwise direction. In each step, we are supposed to eliminate a person which is at the $k^{th}$ position from the current position such that only one man remains at the end who ...
The Inversion count in an array indicates the number of element pairs (i, j) where i < j and A[i] > A[j], serving as a measure of the array’s unsortedness. Understanding Inversion count in an Array is essential for analyzing sorting algorithms’ efficiency and optimizing them, making count inversion a key concept in algorithm design ...