Write a program in JAVA Programming langaugue. Given an array of integers, in which each elements repeats twice except one. Your task is to find that element in O(n) Time complexity and O(1) Space Complexity.

solve in C please. Implement the following two functions that get a string, and compute an array of non-emptytokens of the string containing only lower-case letters. For example:●くろまる For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"].●くろまる For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"].●くろまる For a string "abc 12EFG hi ", the list of such tokens is ["abc","hi"].●くろまる For a string " abc ", the list of such tokens is ["abc"].●くろまる For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at thetokens with lower-case letters only .1. The function count_tokens gets a string str, and returns the number ofsuch tokens.int count_tokens(const char* str);For example●くろまる count_tokens("abc EFaG hi") needs to return 2.●くろまる count_tokens("ab 12 ef hi") needs to return 3.●くろまる count_tokens("ab12ef+") needs to return 0.2. The function get_tokens gets a string str, and...

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. please do in python

in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:

Write and test a Java method mostFrequent() that returns the most frequent element in anarray of n integers.

Write the javascript and the C++ code for this language. Right answer will be given thumbs up.

Write a java program to print the number from 1 to 100 without using loop, recursion, bitset.Think about arrays and do this with array in O(1) time complexity

You are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n − 1] that is not in blacklist. Any integer that is in the mentioned range and not in blacklist should be equally likely to be returned. Optimize your algorithm such that it minimizes the number of calls to the built-in random function of your language.

For the non-recursive towers problem, we used an array of vectors to represent the towers: vector T[3]. To move the top of tower from to the top of tower to. we would write: T[to],push_front(T[from].back()) T[to].push_back(T[from].pop_back()) T[to).push_back(T[from].back()) T[tol.push_front(T[from].pop_back()) O None of the above

Implement a function in Java to find the largest and smallest elements in an array of integers, and return them in a pair. The function should have a time complexity of O(n) and a space complexity of O(1).

LeetCode Given an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest lexicographical order. If there is no answer, return the empty string. Example 1: Input: words = ["w","wo","wor","worl","wo Output: "world" Explanation: The word "world" can be buil Example 2: Input: words = ["a", "banana", "app","appl" Output: "apple" Explanation: Both "apply" and "apple" can Constraints: • 1 <= words.length <= 1000 • 1 <= words [i]. length <= 30 words [1] consists of lowercase English letters.

Given an array of integers and a positive integer k, find the maximum sum of any contiguous subarray of size k. For example, given the array [1, 2, 3, 4, 5] and k = 2, the maximum sum is 7, which is the sum of the subarray [4, 5] Please solve in C# language ..