Software Engineering Process of deleting an array in C++ We have explained how to delete an array or delete an element in an array in C++. We can covered the case of static and dynamic memory allocated array along with the basics of array.
Software Engineering Dynamic vs Static memory allocation in C We have compared the differences with Dynamic Memory Allocation and Static Memory Allocation in C Programming Language. We cover the basics of memory and the different types of memory allocation as well.
Algorithms Addition using Bitwise Operations In this article, we will see how to add any two positive numbers using the bitwise operators like and, xor, and left shift operators rather than using the normal addition operator (+).
TensorFlow Advanced Interview Questions on TensorFlow We have presented advanced interview questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.
Algorithms Time Complexity Bound for comparison based sorting We have explained the mathematical analysis of time complexity bound for comparison based sorting algorithm. The time complexity bound is O(N logN) but for non-comparison based sorting, the bound is O(N).
TensorFlow Questions on TensorFlow (with Answers) We have present the most insightful and MUST attempt questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.
Algorithms Karp's Minimum Mean Cycle Algorithm We have presented Karp's Minimum Mean Cycle Algorithm along with C++ Implementation. Karp's theorem and Complexity Analysis.
Software Engineering GraphQL API in Django with CRUD operations In this article, we have explored GraphQL API, using GraphQL in Django and CRUD operations for users in Django.
Culture Coding Interview New Tab "Coding Interview New Tab" is an Offline Browser Extension that displays a new one line knowledge on a Computing topic for every New Tab you open. It helps you learn something new every now and then.
Software Engineering Simple CRUD Application with Django Rest Framework Ever wondered how your favorite web applications work? like Twitter, Facebook and so on, Yes they look fabulous but what really makes them tick? Simple CRUD Application with Django Rest Framework
Algorithms Bubble Sort using Two Stacks We have explored the algorithm to perform Bubble Sorting Algorithm using Two Stacks and sort a given array.
Dynamic Programming (DP) List of 100+ Dynamic Programming Problems This is the List of 100+ Dynamic Programming Problems along with different types of DP problems such as Mathematical DP, Combination DP, String DP, Tree DP, Standard DP and Advanced DP optimizations.
Algorithms Approximate algorithms for NP problems We have covered Idea of Approximate algorithms for NP problems. NP problems are tough but Approximate algorithms are considered to be a good approach as we get a answer close to the real answer in reasonable time. We have covered the basics with examples of problems like Bin Packing.
Algorithms Shortest Unsorted Continuous Subarray We have solved the problem "Shortest Unsorted Continuous Subarray" and explained the logic behind it and what are the different methods (like Monotonic Stack) we can use to solve it efficiently.
Software Engineering Idea of Layer 4 and Layer 7 Load Balancing We have covered the idea of Layer 4 and Layer 7 Load Balancing along with advantages and disadvantages. This is an important topic in System Design and is an effective Load Balancing technique.
Algorithms Factorial of large numbers Factorial of a non-negative number n, denoted by n!, is the product of all positive numbers less than or equal to n. With the usual approach, we can compute factorial only till 20! due to size limitation of data type. We have present how to overcome this limitation.
Algorithms Generate all sub-strings of a string We have explored the approach of generating / printing all sub-strings of a given String and have provided the implementation to do so. The time complexity to generate all substring is O(N^3) time and there are O(N^2) sub-strings for a string of length N.
Culture Most Dangerous Line of Code 💀 This is the Most Dangerous Line of Code. Do not run it. It has the power to wipe out a Linux system completely and make it useless.
Algorithms Shortest Subarray with at least K as sum In this problem, we find the length of the Shortest Subarray with at least K as sum. This can be solved in O(N) time complexity. This brings in the ideas of Monotonic Queue and Sliding Window.
Time Complexity Time and Space complexity of Radix Sort In this article, we have explained the Time and Space complexity of the radix sort with Mathematical and Intuitive Analysis.
Machine Learning (ML) Idea of Pruning in Machine Learning (ML) Pruning in Machine Learning is an optimization technique for Neural Network models. We have explained how to do pruning, different types of pruning, random pruning, advantages and disadvantages of pruning.
Data Structures Basics of R Tree R-tree is an advanced height-balanced Tree Data Structure that is widely used in production for spatial problems (like geographical map operations). We have presented the need for R Tree along with the basics of R Tree
Algorithms Counting Sort vs Radix Sort vs Bucket Sort This article compares counting sort, radix sort, and bucket sort with important points that will help you make out the differences between these sorting algorithms.
Software Engineering Idea of Consistency patterns in System Design We have explained consistency pattern in System Design along with examples for different types like Eventual, Strong and Weak Consistency.
Software Engineering Cloud Design Patterns Cloud Design Pattern as defined by cloud computing experts are a general reusable solution to commonly occurring problems in cloud architecting. We have explained the different Cloud Design Patterns like Scale Up Pattern.
