Algorithms Time and Space Complexity of Bucket Sort We have explained the Time and Space Complexity analysis of Bucket Sort along with its algorithm, space complexity and time complexity for worst case, average case and best case.
Algorithms Array vs Linked List [Differences Explained] This article explain the differences between Array and Linked List (Array vs Linked List) in depth along with key points that will help you in deciding which one to use for a specific problem.
Algorithms Number of expressions that evaluate to value K In this problem, we have to form expressions using + and - and find the number of expressions that evaluate to K. This can be solved efficiently using Dynamic Programming and is an extension of Count Subset Problem.
Algorithms Bit Array [Explained with example] Bit Array is a data structures that compactly stores Boolean values or bits in the form of an array. The bits can be 0 or 1 only. Each bit in the bit array is independent.
Software Engineering Idea of zero copy [with example] The concept of copying data from one peripheral to another peripheral by kernel, without switching back to user-process is termed as zero copy. In this article, we have explained the concept with code examples.
Software Engineering Passing a vector to a function in C++ In this article, we have covered how to pass a vector to a function as function argument in C++ with variants like 1D vector, 2D vector, 3D vector, global vector and global vector by value. We have also, covered how to return a vector from a function.
Algorithms Time and Space complexity of Bubble Sort In this article, we have explored the time and space complexity of Bubble Sort. We have covered the mathematical complexity analysis and different cases like worst case, best case, average case, space complexity and comparison with other sorting algorithms.
Algorithms Insert element at bottom of Stack [Explained] In this article, we have explained how to insert an element at the bottom of Stack using standard stack operations like push and pop. We have covered two approaches: iterative and recursive.
Algorithms Median in stream of running integers [Explained 3 Algorithms] Given that integers are being read from a data stream, we need to find the median of all the elements read so far starting from the first integer till the last integer. This is called the Median in Running stream of Integers.
System Design Data Partitioning in System Design [Explained] Data partitioning in simple terms is a method of distributing data across multiple tables, systems or sites to improve query processing performance and make the data more manageable. We have explored Data Partitioning in System Design in depth.
String Algorithms Number of palindromic substrings in a string A string is a palindrome when it reads the same backward as forward and a substring is a contiguous sequence of characters within the string. We have discussed multiple approaches to find the number of palindromic substrings in a given string.
Algorithms Least frequent element in an array Given an array of N elements, our task is to find the least frequent element present in it. In this article, we are going to talk about 3 methods to solve this problem along with their implementation.
Java What Java Programmers Should Learn In 2021? Insanely growing demand for programmers comes with more and more competition in the field, and that ends up in "survival of the fittest". Even if you're a talented Java programmer already, there is always room for improvement.
Algorithms Minimum Comparisons to find Second Largest Element In this article, we have demonstrated the mathematical analysis to find out the minimum number of Comparisons to find the second largest or the second smallest element.
Machine Learning (ML) One Shot Learning in ML In this article, we have explained the idea of One Shot Learning in Machine Learning (ML) and where and how it is used along with the limitation of One Shot Learning.
Software Engineering Abstraction in C++ [Explained] In this article, we have explained Abstraction in C++ in depth with different types of abstraction and C++ code examples.
Algorithms Xiaolin Wu's Line Drawing Algorithm Xiaolin Wu's Line Drawing Algorithm is a recognized Line Drawing Algorithm in Computer Graphics which is used to produce Anti-aliased lines. In this article, we have explored this in depth.
Algorithms Make String Stable [using Stack] Given a string with opening and closing braces, our problem is to find the minimum number of operations to make the string stable. This can be solved efficiently using Stack.
Machine Learning (ML) SqueezeNet Model [with Architecture] Squeezenet is a CNN architecture which has 50 times less parameters than AlexNet but still maintains AlexNet level accuracy. We also showcased the architecture of the model along with the implementation on the ImageNet dataset.
Software Engineering qsort: Sorting using stdlib.h in C [Explained with examples] In this article, we have explained how to use qsort that is Sorting using stdlib.h in C. We have presented the use-case using code examples.
Algorithms Convert a binary tree into its mirror tree Given a binary tree, we have to write an algorithm to convert the binary tree to its mirror tree. A mirror tree is another binary tree with left and right children of all non-leaf nodes interchanged.
Algorithms Applications of Topological Sort [Explained] In this article, we have covered various Applications of Topological Sort in depth. Topological Sort of a directed graph is a linear ordering of its vertices.
Software Engineering Functions in Python [Explained with examples] In this article, we have explored everything about functions in Python along with different types of functions that are available with Python code examples.
Algorithms Time & Space Complexity of Counting Sort In this article, we have explained the time complexity of Counting Sort for Average case, Worst case and Best case and also, covered the space complexity using Mathematical analysis.
Culture How I became an Author while being a student? This article captures how I became a technical Author in a couple of months while being a student. I wanted to become an Author for a long time but did not have the idea of how to accomplish it.
