How to Find the Most Common Word in a String with a Banned List?
Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at …
How to Construct Minimum Spanning Tree using Kruskal or Breadth First Search Algorithm?
There are N cities numbered from 1 to N. You are given connections, where each connections = represents the cost to connect city1 and city2 together. (A connection is …
Two Pointer and Sliding Window Algorithm to Find K-Length Substrings With No Repeated Characters
Given a string S, return the number of substrings of length K with no repeated characters. Example 1: Input: S = “havefunonleetcode”, K = 5 Output: 6 Explanation: There …
How to Get the Maximum Level Sum of a Binary Tree using Breadth First Search Algorithm?
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level X …
Compute the Minimum Costs to Connect the Sticks using Priority Queue or Heap
August 25, 2019
algorithms, c / c++, data structure, java, programming languages, python
No Comments
You have some sticks with positive integer lengths. You can connect any two sticks of lengths X and Y into one stick by paying a cost of X + …
Single-Row Keyboard Algorithms to Estimate the Finger Moving Time
There is a special keyboard with all keys in a single row. Given a string keyboard of length 26 indicating the layout of the keyboard (indexed from 0 to …