Can we Make Strings Same by Unlimited Number of Swaps?
You are given two strings s and t which both have length n. You can pick one character in s and another in t and swap them. Given you …
Category: algorithms
Split the List into Two Parts
Given a list of integers nums, return whether you can partition the list into two non-empty sublists such that every number in the left sublist is strictly less than …
Depth First Search and Breadth First Search Algorithm in Checking Sum of Children Nodes in Binary Tree
Given a binary tree root, return whether for every node in the tree other than leaves, its value is equal to the sum of its left child’s value and …
Efficient Prime Factorization Algorithm (Integer Factorization)
Given an integer n greater than 1, find all of its prime factors and return them in sorted order. You can write out a number as a product of …
Single Core CPU Scheduling Algorithm by Using a Priority Queue
You are given a two-dimensional list of integers tasks. Each element contains which represents a CPU task with id id, queued at time queue_time, that will run for duration …