Machine Learning (ML) Applications of Machine Learning We have covered common ML tasks/ applications with respect to image and textual data along with the models used and examples of its use in various domains.
Software Engineering Size of struct in C/ C++ We have explained how to calculate the memory size of a struct in C and C++ Programming Language. To find the actual size, you need to understand two concepts of padding and packing. The size is not the sum of individual elements so read on.
Machine Learning (ML) Early Exit in ML models How does the addition of early exits improve the performance of the neural networks and what are the other additional advantages it provides to the model.
Algorithms Applications of XOR operation We will begin with a brief introduction of what the XOR operation is, followed by its syntax in C++ and its applications such as memory-optimized doubly linked lists, swapping, XOR ciphers, Comparing two values, Gray codes and Partiy check.
Machine Learning (ML) The ShuffleNet Series (Part 1) The breakthrough CNN architecture for object classification in mobile devices, ShuffleNet has been explained in-depth in this article. Its newer and better versions ShuffleNet V2, V2+, Large & X-Large has also been elucidated.
Software Engineering Jinja Template for Django Framework We have explored the Jinja Template. Jinja is a modern, designer-friendly templating language for python, modeled after Django templates and is widely used for execution.
Algorithms Adding 2 integers as linked lists We will represent an Integer as Singly Linked List and define an addition algorithm to add two integers as Linked Lists. This is used to add very large integers which is not stored in existing data types.
Python With statement in Python We have covered what is the With statement in Python and how to use it along with the idea of Context Manager in Python.
Graph Algorithms 100+ Graph Algorithms and Techniques [Complete List] We have listed 100+ problems on Graph data structure, Graph Algorithms, related concepts, Competitive Programming techniques and Algorithmic problems.
Natural Language Processing (NLP) Word Embedding [Complete Guide] We have explained the idea behind Word Embedding, why it is important, different Word Embedding algorithms like Embedding layers, word2Vec and other algorithms.
Algorithms Swap 2 variables [6+ techniques] We have explored about Swapping of 2 variables. We have presented different methods to do so including swapping using third variable, using arithmetic operations, XOR, macro and much more along with their pros and cons.
Time Complexity Time Complexity of Multiplication The Brute force Time Complexity of Multiplication operation is O(logM x logM) while the Theoretical limit of Time Complexity of Multiplication operation is O(logM x loglogM) for multiplying number number M x M.
Time Complexity Time Complexity of Dynamic Array We have explained Complexity Analysis of Dynamic Array along with Time and Space Complexity of different operations of Dynamic Array.
Time Complexity Time Complexity Analysis of Linked List We have presented the Time Complexity analysis of different operations in Linked List. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N * N) time. We have presented space complexity of Linked List operations as well.
Time Complexity Time Complexity Analysis of Array We have presented the Time Complexity analysis of different operations in Array. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N) time. We have presented space complexity of array operations as well.
Time Complexity Time Complexity of Addition Operation We have demonstrated the Time Complexity analysis of Addition operation. It is assumed to take constant time O(1) but it takes linear time O(N) in terms of number of bits. We have presented the space complexity along with implementation of addition using bitwise operations.
Algorithms Two Pointer Technique in Array We have explained the Two Pointer Technique in array which is used to solve a vast range of problems efficiently. Problems include Reversing an array and Find if a pair with given sum exists in a sorted array.
Software Engineering How to take string input in C? We have explained how to take string input in C Programming Language using C code examples. We have explained different cases like taking one word, multiple words, entire line and multiple lines using different functions.
Software Engineering calloc() in C / C++ We have explained the use of calloc() function in C / C++ which is used for Dynamic Memory Allocation. We have explained it with code examples with different situations.
System Design System Design of GitLab This article talks about the Gitlab system design with a simplified overview of its architecture as well as explanation on the working of the important Gitlab architecture components. The System Design of GitHub will be on similar lines.
Algorithms Block Swap Algorithm [for Array Rotation] This article discusses Block Swap Algorithm. It is used to rotate an array by any number of positions with a Time Complexity of O(N) and Space Complexity of O(1).
Machine Learning (ML) Inception V3 Model Architecture We will learn about what is Inception V3 model Architecture and its working. How it is better than its previous versions like the Inception V1 model and other Models like ResNet. What are its advantages and disadvantages?
C++ Static and extern pointers in C/ C++ Static and extern are storage classes in C which defines scope and life-time of a variable. Similar to any variables in C, we can use these keywords with pointers for different use cases.
Algorithms List of 50+ Binary Tree Problems for Coding Interviews We have listed important Problems on Binary Tree which you must practice for Coding Interviews and listed introductory and background topics on Binary Tree as well. You must bookmark this page and practice all problems listed.
Algorithms Move even number to front of array We have explained two efficient approaches to Move even number to front of array using Hoare's Partition and Lomuto Partition.
