Algorithms k-th Largest Element in a stream In this article, we will discuss the problem Kth largest Element in a stream, and understand the different methods that can be used to solve the problem efficiently.
Algorithms Shuffle an array [2 approaches] We have explored two approaches to shuffle an array. The first approach uses an auxiliary array while the second approach is in-place and is known as Fisher Yates Algorithm.
Software Engineering 2D list in C++ STL (Defining and Sorting) In this article, we will begin with a brief recap of what lists are, followed by an introduction to 2-dimensional lists (2D list), where we shall explore creating and defining 2D lists in C++ STL and sorting them.
Data Structures Array Interview Questions [MCQ with answers] This is the list of Interview Questions based on Array Data Structure. You must practice these Multiple Choice Questions. This will help you master Array Coding Questions for Interviews at companies like Google and Microsoft.
Algorithms Brian Kernighan's Algorithm In this article, we will learn what are set bits and how to count them. And we will also learn about Brian Kernighan's algorithm a famous algorithm to find the number of set bits in a number.
Algorithms Number of sub-strings with each character occurring even times This article discusses different algorithmic approach which we can use to find number of sub-strings with each character in it occurring even number times for a given string.
Machine Learning (ML) Basics of Gradient descent + Stochastic Gradient descent We have explained the Basics of Gradient descent and Stochastic Gradient descent along with a simple implementation for SGD using Linear Regression.
System Design System Design of a Firewall We have explored the System Design of a Firewall along with the basics of Firewall and a sample Firewall Design in a real system.
Software Engineering Best Coding Practices Coding best practices are a set of informal rules that the software development community employs to help improve software quality. We have explained several such practices.
Algorithms Boyer Moore majority vote algorithm [Majority Element] Boyer Moore voting algorithm is used to find the majority element among the given sequence of elements which occurs more than N/2 times, in linear time complexity and constant space complexity.
Culture Is perfect timing the key to a successful startup? For a startup, timing is EVERYTHING. If you're too early to the game, no one will know who you are or what you do. But if you're too late, you'll be playing catch up, and breaking through the noise will be hard.
Algorithms Division using Bitwise Operations We will see how to divide a number using the bitwise operator >> rather than using the regular division operator / or the multiplication operator * or the modulo operator %.
Software Engineering Image properties and styling in CSS We have explored some properties that can be used to style images such as width, height, border, object-fit and much more. These properties will come in handy as we design our websites.
Algorithms Recursive Backtracking Backtracking is one of the many algorithmic techniques that can be used to solve various problems. In this article, we will exploring the idea of backtracking with the help of recursion (Recursive Backtracking) along with examples as well.
Algorithms Comparison using bitwise operations We have explored the idea of making comparisons (equal, larger, smaller) through bitwise operations along with the basic idea of bitwise operations and their examples.
Culture Age of All Programming Languages This article lists the age of All Programming Languages along with interesting points. Programming Languages did not start when you think like Python is older than Java. It all started from 1949.
System Design Application layer with Microservices and Service Discovery This article elaborates the working of service discovery of microservices in the application layer along with the complete idea of Application layer with Microservices and Service Discovery.
Algorithms Number of distinct substrings of length K We have explained the approach to find the Number of distinct substrings of length K using Rolling hash technique, hash table and brute force approach.
Algorithms Number of rectangles from a given set of points We have discussed how to find the number of rectangles (parallel to the axes) possible from a given set of coordinate points.
Software Engineering Introduction to OpenGL We have introduced and explored the world of OpenGL and some topics that are related to it like what is OpenGL?, What is GLEW?, What is GLFW?, Shaders in OpenGL, Rendering Pipeline, Stages of Rendering Pipeline and Advantages of OpenGL.
Algorithms Subtraction using bitwise operations We are going to take a look at how can we subtract two numbers without using arithmetic operation. We will only use bitwise operations to perform subtraction.
Machine Learning (ML) Dilated Convolution [explained] Dilated convolution, is also known as Atrous Convolution or convolution with holes. The idea behind dilated convolution is to "inflate" the kernel which in turn skips some of the points. We can see the difference in the general formula and some visualization.
Culture Makoto Soejima (rng_58) Makoto Soejima is a Competitive Programmer from Japan. He is also known as rng_58. He works at AtCoder. His Competitive Programming career started in 1999 and lasted till 2020. He is one of the 4 people ever to have won both Google Code Jam and Facebook Hacker Cup.
Algorithms Shortest Path using Topological Sort We have explained the algorithm to find the shortest path in a Directed Acyclic Graph using Topological Sort.
Approximation Algorithm Probabilistic / Approximate Counting [Complete Overview] We have introduced and explored the idea of Probabilistic algorithms in depth with the different algorithms like Morris Algorithm, HyperLogLog, LogLog and others in this domain.
