C++ Different ways to initialize List in C++ STL In this article, we have explained Different ways to initialize List in C++ STL including Initializing list with elements of another list, using a vector or array and much more.
Python Different ways to terminate a program in Python In this article, we are going to explore different ways in which we can terminate and exit a python program.
JavaScript Capturing and Bubbling in JavaScript (Event Listeners) In this article, we will discuss about the concept of capturing and bubbling in JavaScript (Event Listeners) in depth with code demonstration.
Algorithms Shortest distance between a Line and Point in 3D plane In this article, we have presented two algorithms to find the Shortest distance between a Line and Point in 3D plane. This involves idea of Projection and Parallelogram.
JavaScript Asynchronous programming in JavaScript In this article, we have explored Asynchronous programming in JavaScript including ideas like callback, promises, async, await, loop and much more.
Algorithms Absolute value of Integer using Bitwise Operations In this article, we have explained two approaches to find the Absolute value of Integer using Bitwise Operations namely Right shift, OR and XOR operations.
Machine Learning (ML) U-Net architecture In this article, we have explained U-Net architecture along with other key ideas like Downsampling and Upsampling path with features and applications of U-Net.
Algorithms Furthest Pair of Points (+ Rotating Calipers Method) In this article, we have explained how to solve the problem of Furthest Pair of Points using Rotating Calipers Method. We have presented the naive approach as well.
Compiler Design Different Code Optimizations in Compiler Design In this article, we have listed and explained Different Code Optimizations in Compiler Design such as Peephole optimization, loop unrolling, Loop-invariant code motion and much more.
Algorithms Parallel Bubble Sort In this article, we have explored how to implement Bubble Sort in parallel on multiple threads / cores. We have presented two approaches: one is slower than the sequential approach but the other approach is significantly faster than all other approaches for large input.
Algorithms Average Height of Random Binary Search Tree In this post, we discuss the average height of a Random Binary Search Tree (BST) (that is 4.31107 ln(N) - 1.9531 lnln(N) + O(1)) by discussing various lemmas and their proofs. We omit full proofs and discuss the essential key points for easier understanding.
Time Complexity Time and Space Complexity of Hash Table operations This article covers Time and Space Complexity of Hash Table (also known as Hash Map) operations for different operations like search, insert and delete for two variants of Hash Table that is Open and Closed Addressing.
Algorithms Delaunay Triangulation In this article, we discuss Delaunay Triangulation, its relation to Voronoi diagrams and algorithms to compute Delaunay Triangulation. This is an important topic in Computational Geometry.
Algorithms Create a Heap from Array of N integers In this post, we discuss the heap data structure and how to create a min and max heap from N given integers in form of an Array. Similarly, inserting elements one by one take O(N logN) time but the optimal approach takes O(N) time.
Algorithms Goldbach's Conjecture In this article, we shall be looking at the intriguing Goldbach's Conjecture, one of the best known unsolved problems in mathematics. Later on, in the article, we shall find the Goldbach pairs of all numbers that range from 1000 to 2000.
Machine Learning (ML) Linear Activation Function In this article, we have explored Linear Activation Function which is one of the simplest Activation function that can be used Neural Networks.
Algorithms Average height of Random Binary Tree In this article, we have explored an insightful approach/ algorithm to find the average height of Random Binary Tree which is of the order O(N^0.5). This will strengthen our understanding of binary trees and their applications.
Machine Learning (ML) Filter and Channel Pruning In this article, we will cover the idea of Pruning which is an important optimization technique for CNN models. It reduces the size of models as well as the Inference time. We dive into two main types of Pruning that is Channel Pruning and Filter Pruning.
Algorithms Average height of nodes in a Binary Tree In this article, we have explored an insightful approach/ algorithm to find the average height of nodes in the given Binary Tree. This will strengthen our understanding of binary trees and their applications.
Machine Learning (ML) Bellman's Optimality Equation In this article, we will be walking through the concept behind Bellman's Optimality equation, and how it is used in the case of Reinforcement Learning.
Algorithms Fermat’s Last Theorem In this article, we will be talking about Fermat's Last Theorem , also called as Fermat's Great theorem. Stated by Pierre de Fermat in around 1637 in a margin of his copy of Arithmetica. A Nightmare for Mathematicians to prove.
CSS Height and Width in CSS In this article, we have explored Height and Width in CSS in depth along with examples of how to use it in webpages and setting max-width and max-height.
Python Ways to pause a Python Program In this article, we have explored different techniques to pause the execution of a Python Program for a specific time. There are 9 such techniques including os.pause, asyncio and much more.
Algorithms Closest Pair of Points In this article, we have explored different algorithms using which we can find the Closest Pair of Points in a given set of N points efficiently in O(N logN) time. This involves the idea of Divide and Conquer.
Time Complexity Time & Space Complexity of AVL Tree operations In this article, we will dive into the Time & Space Complexity and Complexity analysis of various AVL Tree operations like searching, inserting and deleting for different cases like Worst, Best and Average Case.
