Machine Learning (ML) Elastic Net Regularization Elastic Net Regularization is a regularization technique that uses both L1 and L2 regularizations to produce most optimized output. This is one of the best regularization technique.
Software Engineering Implementation of ls command in C In this article, we have implemented the ls command in C using dirent header library. ls command is used to list the files and directories in a given location.
Machine Learning (ML) BERT and SEARCH: How BERT is used to improve searching? In this article, we have explored how BERT model can be used to improve search results in search engines like Google Search, Bing and others.
Problems on Binary Tree Finding Diameter of a Tree using DFS In this article, we will be discussing how to find the diameter of a tree or graph using Depth First Search (DFS).
Problems on Binary Tree Diameter of a Binary Tree In this problem, we are given input as the reference to the root of a binary tree. We need to find the diameter of the tree. We find the diameter using recursion and Depth First Search (DFS).
Machine Learning (ML) Introduction to Multilingual BERT (M-BERT) We explored what is Multilingual BERT (M-BERT) and see a general introduction of this NLP model.
Software Engineering Check if file exists in Python In this article, we have explored different ways to check if a file exists in Python. We have explored 6 different methods like try catch block, isfile, pathlib and much more.
Algorithms Understand Randomized Algorithms once and for all In this post, we discuss what randomized algorithms are, and have a look at the Solovay-Strassen Primality Tester to see what they are like.
Machine Learning (ML) Heaps' law in NLP for Frequency of Words Heap's Law in NLP is a relation between the number of unique words to the total number of words in a document. It is, also, known as Herdan's law.
Algorithms NP Complete Complexity In this article, we have explored the idea of NP Complete Complexity intuitively along with problems like Clique problem, Travelling Salesman Problem and more.
Algorithms Strategy to win Minesweeper Many may think Minesweeper is a random game but it is a strategy game and you can win it everytime if you know the rules involved and proven strategies to play it.
Algorithms C program to check whether brackets are Balanced in an Equation We have developed a C program to check whether brackets are Balanced in an Equation using the Stack data structure and solving it in O(N) time.
Algorithms Hospital Residents Problem We have explored Hospital Residents Problem which is an matching problem similar to Stable Room Mates problem and Gale Shapley algorithm. In this, we match applicants to programs/ jobs.
Algorithms Maximum cut problem In this article we'll be discussing on the concept of Maximum cut problem. Firstly will understand its basic concept with Introduction. Secondly, with a graph example will deep-dive into the concept.
Algorithms Find articulation point in Graph In this article we'll be discussing on how to find articulation point in Graph. Firstly we'll discuss on the Introduction to Articulation Points. Secondly, we'll understand the Articulation Points concept with a graph example. At the end will write a Pseudo code & implementation for the same.
Algorithms Number of substrings in a string divisible by 6 Given a string of integers, find the count of sub-strings of given string which are divisible by 6. This problem can be solved using Dynamic Programming in O(N) time complexity where N is the length of the string.
Software Engineering Introduction to Single Page Applications with Flask and AJAX Let us have a look at what single-page applications are and how can we create one using AJAX, with Flask as the back-end.
Algorithms Algorithm to detect and remove loop in a Linked List Given a Linked list, find out whether it contains a loop or not. If it does, then remove the loop and make the last node point to NULL.
Problems on Binary Tree Algorithm to find Level of each node from root node In this article we will be discussing on how to find the level of each node in a graph, the algorithm that we will be using to find the level of each node is breadth first search.
Software Engineering How Email Systems Are Designed? Through this article, you will get a good insight into "How Email Systems like GMail and Outlook are Designed?". The key is to understand that email is a default way of communication on the web and is not same as a instant messaging platform.
Problems on Binary Tree Counting subtrees where nodes sum to a specific value We will learn about counting the subtrees in a binary tree whose nodes sum to a given value. We will be trying different methods to solve our problem We will solve it in O(N) time complexity and O(H) space complexity where N is number of nodes and H is the height of the tree.
Algorithms Algorithm to find all bridges in a Graph In this article we'll be discussing on the algorithm to find all bridges in a Graph. Firstly we'll discuss on the Introduction to Bridges. Secondly, we'll understand the bridge concept with a graph example.
Algorithms Algorithm to check if a linked list is sorted In this article, we have explored an algorithm to check if a given Linked List is sorted or not in linear time O(N). It takes constant space O(1).
Algorithms Approximation Algorithm for Travelling Salesman Problem In this article we will briefly discuss about the Metric Travelling Salesman Problem and an approximation algorithm named 2 approximation algorithm, that uses Minimum Spanning Tree in order to obtain an approximate path.
Algorithms Check if Linked List is Empty Checking if the given Linked List is empty depends on the ways Linked List has been formed (with or without root). We have covered both approaches.
