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.
Algorithms Find GCD of all elements in an array In this article, we have presented an algorithm to find the Greatest Common Divisor (GCD) of all elements of an array efficiently.
Software Engineering Essential components of Ruby: OOP, Data Types, Methods, Variables In this article, we have covered the essential components of Ruby such as OOP concepts like class and object, Data Types, Methods, Variables and much more.
System Design In memory Database [Explained] In memory Database is a type of Database that is stored in main memory (instead of hard disk) which makes to significantly fast (100X improvement) with some limitations.
Algorithms 132 Pattern Problem [Solved] In this article, we have explained what is 132 pattern problem and have discussed 3 different approaches to solve it in linear time O(N) where brute force approach takes O(N^3) time.
Data Structures Merkle Tree [Explained] Merkle tree is named after Ralph Merkle, it is a tree data structure where non-leaf nodes are a hash of its child nodes and leaf nodes are a hash of a block of data. This is an USPTO patented Algorithm.
Data Structures Cuckoo filter [Explained] A cuckoo filter is a probabilistic data structure that is used to test whether an element is a member of a set or not. It is similar to the Bloom filter.
Time Complexity Time & Space Complexity of Selection Sort In this article, you will learn about Time Complexity and Space Complexity of Selection Sort algorithm along with the complete mathematical analysis of the different cases.
Algorithms Check if a string is a subsequence of another string In this problem, we will see how we can check whether a string is a subsequence of another string. We have solved this in O(N) time using an efficient approach.
List of Mathematical Algorithms Equilibrium Index: Find index such that sum of left sub-array = right sub-array For a given array, we need to find an index such that sum of left sub-array = right sub-array also called the Equilibrium Index. We solve this using brute force approach O(N^2) and using prefix array in linear O(N) time.
Algorithms Finding LCM of an array of numbers Find the LCM of the given array of positive numbers. We have explored 2 approaches: one using GCD and other without using GCD.
