Algorithms K-th Largest Element in Array In this article, We will discuss 4 different approaches to find the kth largest element in the given array.
trie Top K Frequent Words In this article, we will study about different approaches to solve the problem "Top K Frequent Words". This will involve the concept of Priority Queue, Trie and Bucket Sort.
Problems on Binary Tree BST to greater sum tree In this article, we will be discussing about the problem "BST to greater sum tree" in detail. This involve the concept of inorder traversal.
Problems on Binary Tree Minimum distance between two given nodes of Binary Tree In this article, we will be discussing about the problem "Minimum distance between two given nodes of a Binary Tree" in detail. This involve the concept of lowest common ancestor.
Problems on Binary Tree Connect Nodes at Same Level in Binary Tree In this article, we will be discussing about the problem "Connect Nodes at Same Level in a Binary Tree" in detail. This involve the concept of Breadth First Search (BFS) or Level Order Traversal.
Problems on Binary Tree Extreme nodes in alternate order In this article, we will be discussing about the problem "Extreme nodes in alternate order in a Binary tree" in detail. This involve the concept of Breadth First Search (BFS) and level order traversal.
Interview Problems on Array Car Pooling Problem In this article, we have explored the Car Pooling Problem in depth and presented an efficient approach to solve it using the concept of Prefix Sum.
Python Typing speed test in Python This article presents a design and implementation approach to develop a console typing speed test in Python Programming Language. We have explained the process step by step.
List of Mathematical Algorithms Brocard's problem In this article, we have explained the famous Brocard's problem and implemented solutions to find the 3 solutions to the problem.
Algorithms Weighted Median Problem Weighted Median is a measure of central tendency which is better than normal median. In this let us consider a weighted median value ‘wi’ when the elements are sorted such that the total weight of the elements to the left of wi is half of the total weight.
Problems on Binary Tree Odd even level difference in a binary tree In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.
Problems on Binary Tree Children sum parent in a Binary Tree In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.
quick sort Quick sort using stack In this article, we will study about Quick sort algorithm along with it's implementation using stack in C++. Before getting started with Quick sort using Stack we should know about stack data structure.
Algorithms Different approaches to calculate Euler's Number (e) In this article, we have explored different approaches to calculate Euler's Number (e) along with sample implementations to calculate Euler's number to different precision.
Algorithms Stack vs Linked List In this article, we will be discussing about "Stack vs Linked List" in detail.
Time Complexity Time and Space Complexity of Selection Sort on Linked List In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.
List of Mathematical Algorithms Fermat number and Pepin's test In this article, we have explored the concept of Fermat number, demonstrated C++ implementations to compute and verify fermat number and explained Pepin's test for Fermat number.
Culture Lingyu Jiang Lingyu Jiang is one of the top Competitive Programmer from China who is known for winning Silver medal at Google Code Jam 2022 and Bronze medal at Facebook Hacker Cup 2021. She is known as "jiangly" online.
String Algorithms String isomorphism In this article, we will learn about string isomorphism and algorithms to solve this problem efficiently.
Algorithms Graph and subgraph isomorphism In this article, we will learn about graph and subgraph isomorphism and the algorithms to check for graph and subgraph isomorphism.
List of Mathematical Algorithms Mersenne prime numbers When 2^n -1 is prime, it is said to be a Mersenne prime. In this article, we have explored this concept of Mersenne prime numbers in depth along with algorithms + implementations to find Mersenne prime numbers.
Algorithms Greedy Algorithm vs Dynamic programming In this article, we will discuss greedy methods vs dynamic programming. Both of them are used for optimization of a given problem. Optimization of a problem is finding the best solution from a set of solutions.
Algorithms Time and Space Complexity of Prim’s algorithm In this article, we will learn more about Prim's algorithm and analyze its complexity for different cases and implementation approaches.
Algorithms Interpolation Search [EXPLAINED] In this article, we have explained the concept of Interpolation Search and analyzed the performance of interpolation search in terms of time and space complexity.
backtracking Iterative Backtracking In this article, we will be exploring the idea of backtracking with the help of iteration (Iterative Backtracking) along with example as well. The Time and Space Complexity will be discussed at the end of the article.
