System Design Message Queues in System Design We have covered the concept of Message queues in System Design in depth along with its properties, architecture, benefits, examples, message brokers and real life applications of Message Queues.
Algorithms Count total set bits in all numbers from 1 to N We have presented an efficient approach to find the total number of set bits in all numbers from 1 to N in O(logN) time by deriving a pattern and a formula.
Algorithms Integer Factorization Algorithms We have explored in great detail some of the different factorization algorithms for Integers such as Trial Division, Pollard's rho algorithm, Dixon's algorithm and Quadratic Sieve.
System Design Scaling large systems: GitLab Production Architecture We have discussed GitLab's Production Architecture to understand how a large company like GitLab which supports millions of developers handle and scale their infrastructure.
System Design Backpressure and Exponential Back-off to handle overloaded systems We explored how overloaded networks are handled using techniques such as applying back pressure and exponential back-off. Let us first begin with the reasons for overload and congestion, after which we will learn how to mitigate it.
Software Engineering Different Normal Forms / Normalization in DBMS We have explored Normalization in Database Management System (DBMS) in depth along with different normal forms like first normal form, second normal form, boyce codd normal form and others.
System Design Different Caching Strategies in System Design We have explained different Strategies to update Cache in a System such as Cache Aside, Read Through, Write Back and much more. This is an important topic to design efficient system.
Machine Learning (ML) Single Shot Detector (SSD) + Architecture of SSD In this article, we will be discussing Single Shot Detector (SSD), an object detection model that is widely used in our day to day life. And we will also see how the SSD works and what makes the SSD better than other object detection models out there.
Machine Learning (ML) Architecture of YOLOv3 We have presented the Architecture of YOLOv3 model along with the changes in YOLOv3 compared to YOLOv1 and YOLOv2, how YOLOv3 maintains its accuracy and much more.
Software Engineering Object Oriented Programming (OOP) in Rust We have explored Object Oriented Programming (OOP) in Rust and covered topics like Object, Encapsulation, Inheritance, Polymorphism and others along with Rust code examples.
Theory of Computation Church Turing Thesis in Theory of Computation We have explain the meaning and importance of Church Turing Thesis in Theory of Computation along with its applications and limitations.
Theory of Computation Pumping Lemma Questions We have presented some Questions which can be solving using Pumping Lemma in Theory of Computation. You must try these questions to test your understanding of Pumping Lemma before your examination.
Algorithms Longest Increasing Consecutive Subsequence We have to find the Longest Increasing Consecutive Subsequence in N elements. We can solve this problem efficiently using Dynamic Programming in O(N) time.
Software Engineering Introduction to Vue Vue is a progressive JavaScript front-end framework which was developed for creating user interfaces and it could be effectively used to develop Single Page Applications (SPAs).
Software Engineering Context Switching in OS We have discussed about Context Switching, which is one of the most important and fundamental topics in Operating Systems.
Algorithms Find Peak Element in an Array We have explained the problem of finding Peak Element in an Array along with different approaches to solve it efficiently.
Data Structures Design data structure that support insert, delete and get random operations We will understand in depth the designing of a data structure that supports "insert value", "delete value" and "get random" operations where these tasks are performed in constant time O(1).
Algorithms Majority Element in an array We have discussed algorithmic techniques to find the majority element in an array. The brute force algorithm takes O(N^2) time while the most efficient algorithm can do it in O(N) time.
Data Structures "Design a Data Structure" problems We have present some must practice "Design a Data Structure" problems. These are important problems for Coding Interviews at Google and other companies. You need to modify standard data structure to form new data structures to solve this problem efficiently.
Theory of Computation Pumping Lemma in Theory of Computation Pumping Lemma in Theory of Computation is a theorem that is used to determine if a given string is in a regular language L or a Context Free Language (CFL). We have explained the theorem in depth and presented problems that can be solved using the theorem.
Theory of Computation Context free grammar (CFG) for Balanced Parentheses We have presented the Context free grammar (CFG) for properly nested parentheses or Balanced Parentheses / Expressions using all three set of brackets.
Software Engineering Inter-process communication (IPC) & IPC types in OS We have explained Inter-process communication (IPC) in Operating System, why is IPC needed and various ways to achieve IPC like using shared memory, message passing, buffering, pipes and more.
Machine Learning (ML) Dense Layer in Tensorflow We have explained Dense Layer in Tensorflow with code examples and the use of Dense Layer in Neural Networks.
Software Engineering __builtin_popcount and POPCNT We have explored about __builtin_popcount - a built-in function of GCC, which helps us to count the number of 1's(set bits) in an integer in C and C++. POPCNT is the assembly instruction used in __builtin_popcount.
Software Engineering Structure (struct) in C [Complete Guide] A structure is defined as a collection of same/different data types. All data items thus grouped logically related and can be accessed using variables.
