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…
So I cast the int number 250 to a char, and initially was confused why the corresponding ASCII didn’t appear when I did printed it, but then realised it seemed to be using UTF instead? 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…
I’ve cloned a project from Github, but I receive the error “this project is incompatible with the current edition of visual studio” when I open it. I’m using the latest 2019 updated, so I suspect Read more…
Techie Delight Coding made easy Given three sorted arrays of variable length, efficiently compute the minimum range with at-least one element from each of the arrays. For example, Input: 3 sorted arrays of variable length Read more…
Techie Delight Coding made easy Given an array of integers, find the length of longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values and the character set should be consecutive, Read more…