Binary Tree. Operations on Binary Tree. Construct a Binary Tree from a given Preorder and Inorder traversal. The Binary Lifting Technique. Convert a generic tree n-ary tree to binary tree. Iterative Postorder Traversal of Binary tree. Iterative Postorder Traversal of a binary tree Part Iterative Preorder Traversal of Binary tree. Iterative Inorder Traversal of Binary tree.
Morris Traversal for Inorder. Print all Prime Levels of a Binary Tree. Bottom-left to upward-right Traversal in a Binary Tree. Check if given inorder and preorder traversals are valid for any Binary Tree without building the tree. Inorder Successor of Binary Tree.
Right View of a Binary Tree. Left View of a Binary Tree in Java. Diameter of Binary Tree. Construct a Binary Tree from a given Postorder and Inorder traversal. Maximum average of subtree values in a given Binary Tree. Count Number of Nodes. How to count the number of nodes in a complete binary tree. Count nodes having the highest value in the path from the root to itself in a Binary Tree. Check if a binary tree contains node values are in strictly increasing and decreasing order at even and odd levels.
Print all K-sum levels in a Binary Tree. Check if binary tree contains a balanced BST of size k. Count pairs of leaf nodes in a Binary Tree which are at most K distance apart.
Smallest subtree with all the deepest nodes. Find K smallest leaf nodes from a given Binary Tree. How to remove subtrees containing zeroes in a binary tree. Check whether every node of the binary tree has a value K on itself or its any immediate neighbours. Maximum Absolute difference between any two levels of binary Tree. An Introduction to Binary Trees. Types of Binary trees. N-Ary Trees. Binary Search Tree. Operations on Binary Search Tree. Insertion in Binary Search Tree.
Insert a node in Binary Search Tree Iteratively. Construct BST from the given pre-order traversal. Construct a BST from given postorder traversal using Stack.
Finding inorder predecessor of a node in a Binary Search Tree. Range Sum of BST. Print all the even nodes of a Binary Search Tree. Node with the maximum value in a Binary Search Tree. Sum and the Product of minimum and maximum elements of a Binary Search Tree. Count pairs violating BST property. Count of Smaller Numbers After Self. Traverse a BST in a min-max manner. Check if a triplet with given sum exists in BST. Find the preorder successor of all the nodes in a BST. Number of pairs with a given sum in a Binary Search Tree.
Print all pairs from two BSTs whose sum is greater than the given value. Find the minimum absolute difference in two different BST. Remove BST nodes having a value in the given range. Find the maximum count of duplicate nodes in a Binary Search Tree. Introduction to Binary Search tree. Difference between binary tree and binary search tree. AVL Tree. Operations on AVL Tree. Deletion in AVL Tree. Introduction to Graphs. Graph Representation. Implementation of Graph in Java. Implementation of Graph in Python.
Graph Theory. Construct a Graph from the size of components of each node. Properties of Graph. Implement Water Supply System. Clone of an undirected graph. General Problems. Course Schedule. Print all paths from a given source to a destination. Operations on Graph. Shortest Path. Dijkstra's Algorithm. Shortest path in a directed acyclic graph. Shortest path in an unweighted graph. Detect cycles in a directed graph.
How to detect cycles in an undirected graph. Minimum cost to connect all cities. Water Connection Problem. Kruskal's Algorithm. Dynamic Programming. How to solve a dynamic programming problem? Memoization vs Tabulation. Count Number of subsets with given Sum. Subset Sum Problem. Unbounded Knapsack. Target Sum. LCS and Variations. Longest Common Subsequence. Longest Palindromic Subsequence.
Minimum insertion to convert the string to a palindrome. Longest Repeating Subsequence. Shortest Common Supersequence. Distinct subsequences. Expression Matching. Regular Expression Matching. Wildcard Matching. Stock Variations. Best time to buy and sell stock. Best time to buy and sell stock II. Best time to buy and sell stock with cooldown.
Wine Selling. Maximum Product Subarray. Maximum Area of the Square Submatrix. Longest Valid Parenthesis. Minimum sum path in a matrix. Maximum Profit In Job Scheduling. Number of unique good subsequences. Kingdom War. Longest Increasing Subsequence Part 1.
Longest Increasing Subsequence Part 2. Interleaving Strings. Longest Palindromic Substring. Minimum Score Triangulation of Polygon. Super Ugly Numbers. Cherry Pickup. Tiling Problem. Building Bridges. Coin Change Combination Problem. Scramble String. Greedy Algorithms.
Standard Greedy Problems. Huffman Encoding. Gas Station. Merge Intervals. Maximum Disjoint Intervals. Maximum number of overlapping intervals. Shortest Unsorted Continuous Subarray. Queue Reconstruction by Height. Find maximum meetings in one room. Minimize Cash Flow among a given set of friends who have borrowed money from each other. Advanced Greedy Problems. Minimum Number of Arrows to Burst Balloons. Introduction and Implementation.
Introduction and implementation of Trie. Dictionaries using Tries. Advantages of Trie Data Structure. Pattern Searching using Trie. Competitive Programming. Recursion and Backtracking. Valid Sudoku. Power Set. Sort a given Array by swapping only pairs with GCD as 1. Divide and Conquer. Introduction to the Divide and Conquer Algorithm. Fast Fourier Transform for polynomial multiplication. Fibonacci numbers. Check if a number is a palindrome or not without using any extra space.
M-coloring Problem. Print all possible permutations of a given array without duplicates. Sorting Based Problems. Maximum Gap. Maximum Sum Path. Maximum Divisors in a Range. Find all indices of a given element in the sorted form of the given array. Sort all even numbers in the Array without changing the order of odd elements.
Bit manipulation. Hamming Distance. Total Hamming Distance. Ugly Numbers 2. Find Elements. Minimum X xor A. Lucky Alive Person in a Circle. Gray Code. Count Number of Set Bits in an Integer. Divide Two Integers. Basic String Problems. String Hashing.
Lexicographically largest String after removal of K characters. Advanced String Algorithms. Prefix function - Knuth-Morris-Pratt Algorithm. Manacher's Algorithm. Number Theory. Prime Numbers. Sieve of Eratosthenes with Linear time complexity. Primality Tests. Integer Factorization. Count Number of Valid Parentheses. Catalan Numbers. Number of ways you can always stay either above or below the main diagonal.
Binomial Coefficients. Common Problems. Finding Power of Factorial Divisor. Count Prime in Ranges. Chinese remainder theorem. Euclidean Algorithm. Multiplicative Inverse. Factorial Modulo. Binary Exponentiation. Basic Greedy Problems. Find the smallest range containing at least 1 element from given N ranges. Optimization Problems. Maximize the frequency of an element by at most one increment or decrement of all array elements.
DP with Arrays. Travelling Salesman Problem Part 1. House robber. DP with Strings. Restore IP Addresses. Decode ways. Counting Based. Number of ways of Triangulation. DP with Trees. DP with bitmasking. Digit DP. Count numbers from a given range whose product of digits is K. Range Query. Segment Tree. Range minimum query. Fenwick Tree. Find the closest greater value for every element in the array. Red-Black Tree. Introduction To Red-Black Trees. Insertion In Red-Black Trees.
Fair Candy Swap. Minimum Spanning Tree. Introduction and Properties of Minimum Spanning Tree. Travelling Salesman Problem Part 2. DP and Graph. Bellman Ford Algorithm. Bipartite Graph. Floyd Warshall Algorithm. Longest Common Prefix Matching. Computational Geometry. Inclusion-Exclusion Principle. Check if two line segments intersect.
Cycle and cord. Disjoint Set. Permutation Swaps. Game Theory. Game of Nim. Stone Game 2. The Alpha-Beta Pruning Algorithm. The Divisor Game. Machine Learning. What is Machine Learning. How does Machine Learning work? Updated Mar 13, Java. Star 6. Updated Dec 25, Java. Star 4. Updated Aug 24, Java. Star 2. Updated Jun 30, Java. Updated Aug 4, Java. Star 1. Updated Mar 11, Java. A Java implementation of Deadlock Detection. Updated Jun 25, Java. Star 0. Updated Jun 16, Java.
Memory Management. Disk Management. Disk Scheduling. Operating System Quizes. Table of Contents. Improve Article. Save Article. Like Article. Previous Introduction of Deadlock in Operating System. Next Deadlock Detection And Recovery.
0コメント