Hi all,I posted a question on Stackoverflow and I’m struggling to find an answer.https://stackoverflow.com/q/65508292/4700011Anyone here reckon they could have a bash at it?Thanks in advance. I’m a bit confused: Which is your code, the sender Read more…
Given a string and a positive integer k, find all distinct substrings of a given string of any length containing exactly k distinct characters. For example, A simple solution is to generate all substrings of Read more…
A triangulation of a convex polygon results in a set of non-intersecting diagonals between non-adjacent vertices, which completely partition the interior of the convex hull of the polygon into triangles. The minimum weight triangulation (MWT) Read more…
I’m definitely not the first person to think of this, but I like it in a cheating kind of way. Is the typeof(subtract) == typeof(const_true) comparison optimized away by the compiler? If not, I can Read more…
Given a list containing future price predictions of two different stocks for the next n-days, find the maximum profit that can be earned by selling the stocks with a constraint that the second stock can Read more…
Given a sorted integer array, find the k closest elements to x in the array where k and x are given positive integers. The integer x may or may not be present in the input Read more…
Suppose you are given n red and n blue water jugs, all of different shapes and sizes. All red jugs hold different amounts of water, as do the blue ones. Moreover, there is a blue Read more…
Given an m-ary tree, write an efficient algorithm to convert the tree to its mirror. An m-ary tree (aka k-ary tree) is a tree in which each node has no more than m children. Each Read more…
Given an array of integers, trim it such that its maximum element becomes less than twice the minimum, return the minimum number of removals required for the conversion. For example, The idea is straightforward and Read more…
Given an undirected graph, check whether it has an Eulerian path or not. In other words, check if it is possible to construct a path that visits each edge exactly once. An Eulerian trail is Read more…