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.
Software Engineering ER Diagram / Entity Relationship Model We have covered Entity Relationship Model in depth along with basics like entity, attributes, notations and much more. We have present an example of Entity Relationship Model for Job Portal database.
Algorithms Two Sum Problem in Binary Search Tree We have solved the Two Sum Problem in Binary Search Tree using three different approaches involving Depth First Search, Inorder Traversal and Augmented Binary Search Tree.
Software Engineering Software Development Lifecycles (SDLC) We have covered the basics of Software Development Lifecycles along with the different types like Waterfall Model. We have covered advantages and different stages of SDLC.
Algorithms Longest Common Suffix Problem In this article, we will see how we can find the longest common suffix (i.e ending) that all the strings given to us have. We shall start with the brute-force approach for two strings. Following this, we will implement the Trie data structure to solve the problem for more than two strings.
Algorithms Lempel Ziv Welch compression and decompression In this article, we will learn about the Lempel Ziv Welch compression and decompression algorithm, a famous compression technique that is widely used in Unix systems and GIF format files
Machine Learning (ML) SSD MobileNetV1 architecture We have dived deep into what is MobileNet, what makes it special amongst other convolution neural network architectures, Single-Shot multibox Detection (SSD) how MobileNet V1 SSD came into being and its architecture.
Algorithms Lomuto Partition Scheme We have explained the Lomuto partition scheme, which is used in the famous Quicksort algorithm. It is an algorithm to partition an array into two parts based on a given condition.
Natural Language Processing (NLP) Why SpaCy over NLTK? We listed 10 aspects where spaCy shines better than NLTK. It also includes information when NLTK outsmarts spaCy.
Algorithms Multiplication using bitwise operations We have explained how to compute Multiplication using Bitwise Operations. We can solve this using left shift, right shift and negation bitwise operations.
