Algorithms Set Partition Problem (Same sum) Set Partition Problem: determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is same. The time complexity of solving this using Dynamic Programming takes O(N x SUM) time.
Software Engineering Linked List implementation in C language We have designed and implemented Linked List in C Programming Language. We have create a Node structure in C and implemented all Linked List operations in C.
Software Engineering Linked List Implementation in Java We learn how to implement and design Linked List in Java using Object Oriented Programming (OOP) concepts. We have provided the complete Java implementation of Linked List.
Algorithms Wildcard Pattern Matching (Dynamic Programming) In the Wildcard Pattern Matching problem, we find if a pattern matches a given input string. We will be using a Dynamic Programming approach with the time complexity of O(m * n), here m and n represent length of string and pattern respectively.
Machine Learning (ML) Filtering spam using Naive Bayes Naive Bayes is a Bayes Theorem-based probabilistic algorithm used in data analytics for email spam filtering. In this article, we have explored the step to filter spam using Naive Bayes in depth.
Algorithms Binary Search in a Linked List You are given a sorted singly linked list and a key (element to be searched), find the key in the linked list using binary search algorithm. The challenge is to find the middle element as Linked List does not support random access.
Software Engineering Capitalize letters in Python In this article, we have covered how to capitalize the first letter using capitalize() in Python, convert the entire string to upper-case, convert the entire string to lower-case and capitalize first letter of each word.
Machine Learning (ML) Disadvantages of GANs || Am I real or a Trained Model to write? We have explored the problems with GANs in this article and have divided them into two major parts: General Problems with GANs and Technical Disadvantages of GANs.
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).
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 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.
