Algorithms Linked List with no NULLs A Linked list is a dynamic data structure which can grow or shrink on demand. It is usually implemented using NULLs, we will consider an alternative no NULL approach and use placeholder nodes.
Algorithms Comparison b/w Different Advanced Sorting algorithms (Interview preparation) We have reviewed and compared different Advanced Sorting algorithms that will help you in your Interview preparation. We have covered 5 sorting algorithms namely bucket, radix, counting, heap and shell sort.
Algorithms Minimum steps to make binary string empty by removing alternating subsequence in each step Given a string str consisting of only '0's and '1's, the task is to make the string empty by performing minimum number of operations. An operation is defined as the removal of an alternating subsequence from str without changing the order of the remaining characters.
Data Structures Splay Tree Splay trees are Self adjusting Binary Trees with additional property that recently accessed elements as kept near the top and hence, are quick to access next time.
Algorithms Find number of substrings with same first and last characters You are given a string lets say "S" , you need to find the number of all contiguous substrings (part of "S") starting and ending with the same character.
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.
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).
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.
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.
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.
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.
Algorithms Word Break Problem In this article we are going to talk about a very interesting problem: Word Break Problem. This can be solved using Dynamic Programming [O(N^2) time, O(N^2) space].
Algorithms Check whether a Singly Linked List is Palindrome or not Linked List can be palindrome if they have the same order when it traverse from forward as well as backward. This is solved using three methods: using stack, string and by reversing the list.
