You just need to worry about two simple rules : If we send the contestant that takes the least amount of time to swim first, we are reducing the finish time between contestants. What if two contestants have the same swim time? In this case, the contestants who have a higher total running + cycling … Read more
There isn’t any preventive measure in your code that enables the code not to count same chracter in the feature steps. Here I just modified your code to make it work correctly. But you can compare it with other version I provided to prevent double counting. public class Main { public static void solution(String s) … Read more
You must create a different random number for each thread (more details) so try this code in your main method: for (int i = 0; i < 10; i++) { int temp = i; threadArray[i] = new Thread(() => simThread(temp)); Console.WriteLine(“[He Thong] PID ” + i.ToString() + ” duoc khoi tao”); threadArray[i].Start(); Thread.Sleep(20); } and … Read more
There is “Post-Quantum Cryptography” published by Daniel J. Bernstein. The book is more of a general overview and doesn’t go that far into details. It contains sections about lattice based, hash based and code based cryptography. Shor’s algorithm as well as discrete logarithm aren’t handled in depth, but there is a general overview. I think … Read more
Making a void toBST function in C which takes 2 arguments : Tree* root and an array and adds all tree nodes to an array – order does not matter solved Making a void toBST function in C which takes 2 arguments : Tree* root and an array and adds all tree nodes to an … Read more
Here is a very naive way without regex. public class NotElegant { public static void main(String[] args){ String text = “doctors found many cancer related chest problems in japan during second world war.”; String term = “cancer problems”; System.out.println(getWordsNearEachOther(text,term,3)); } public static String getWordsNearEachOther(String text, String term, int distance){ String word1= term.split(” “)[0]; String word2= … Read more
f(N) is the sum of all integers which are less or equals to N. f(N) = N + f(N-1) = N + N-1 + N-2 + … + 2 + 1 = N*(N+1) / 2 0 solved Figuring out the complexity of the code
In .NET you could do use the AddMonths method: DateTime date = new DateTime(2013, 5, 19); DateTime newDate = date.AddMonths(14); As far as parsing a date from a string using a specified format you could use the TryParseExact method: string dateStr = “19/05/2013”; DateTime date; if (DateTime.TryParseExact(dateStr, “dd/MM/yyyy”, CultureInfo.InvariantCulture, DateTimeStyles.None, out date)) { // successfully … Read more
Depth First Search or DFS as it is more generally called is a graph/tree traversing algorithm. How It Works Consider a graph such as given below Now let’s dig deep into how these numbers are coming up. We start with the starting node and mark it as visited then we add it to the top … Read more
For the first method, it is n*n = n^2. Since there are two loops, for each loop O(n) is n since you are going through each item in an array. Second one is a constant o(1). 1 solved How to calculate Big-O? [closed]
Sample code is something like this: String str1 = “java;python;javascript;programming;Hello;World;Hello”; String str2 = “java;python;javascript;programming;Hello;World;Hello”; List<String> list = new ArrayList<String>(); list.addAll(Arrays.asList(str1.split(“;”))); list.addAll(Arrays.asList(str2.split(“;”))); for (String word : list) System.out.println(word + ” –> ” + Collections.frequency(list,word)); 1 solved Frequency distribution of words [duplicate]
Your question is of mathematics nature – combinations and permutations. You are actually asking the number of possible permutation for string length 7. The formula is factorial(numOfchar). In this case 7! = 7x6x5x4x3x2x1 = 5040. public static void main(String[] args) { String str = “ABCDEFH”; System.out.println(“Number of permutations for ” + str + ” is … Read more
You could use regular expression to do this. Although this pattern is very naively implemented, it is a start. I’ve used Tuple instead of Vector, but you can easily change that yourself. static readonly Regex VectorRegex = new Regex(@”a:(?<A>[0-9]+\.[0-9]+);b:(?<B>[0-9]+\.[0-9]+);c:(?<C>[0-9]+\.[0-9]+)”, RegexOptions.Compiled); static Tuple<double, double, double> ParseVector(string input) { var m = VectorRegex.Match(input); if (m.Success) { double … Read more
Initially C++ present in the tags… Test can be on cpp.sh #include <iostream> #include <vector> int main() { std::string algorithm_sorting (“1101001011”); std::vector <std::string> video = {“a1″,”a2″,”a3″,”a4”}; std::vector <std::string> picture = {“b1″,”b2″,”b3″,”b4”}; std::vector <std::string> result; size_t v = 0, p = 0; for(auto&x:algorithm_sorting) { if(x==’1′) { if(v < video.size()) result.push_back(video[v]); v++; } else { if( p … Read more
Introduction Sorting algorithms are a fundamental part of computer science and are used to organize data in a specific order. In this article, we will discuss a particular sorting algorithm known as the [Solved] algorithm and how it can be used to sort the binary sequence 1101001011. We will look at the steps involved in … Read more