Lonely Ones Binary ones (1) can get lonely if only zeros (0) surround them. Formally, we call such 1's "sparse". A number is defined as sparse if its binary representation has no two consecutive bits set. You are given an integer N and your task is to find out if it is sparse or not. Input The input contains an integer N. Output Print '1' if the number is sparse and '0' if the number is not sparse. Constraints 1 <= N <= 1018

Integer numValues is read from input. Then numValues integers are read and stored in vector weeklyRentList. Write a loop that outputs each element in weeklyRentList that is less than 100, and assigns the element with twice the element's current value. End each output with " is corrected to twice the current value' followed by a newline. Ex: If the input is 3 31 143 105, then the output is: Raw weekly rent: 31 143 105 31 is corrected to twice the current value Adjusted weekly rent: 62 143 105 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 int numValues; 7 unsigned int i; 0 vector weeklyRentList; cin >> numValues; 10 11 weeklyRentList.resize(numValues); for (i = 0; i > CS Scanned 12 13 14 17 18 cout << "Raw weekly rent: " ローロー

asap

For JAVA.

none

Calculating the Minimum Sum Path in a Triangle (LeetCode Problem)Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move toan adjacent number of the row below. More formally, if you are on index i on the current row, you maymove to either index i or index i + 1 on the next row.   public static int minSumPathMemo(int[][] triangle)This method will calculate the minimum sum path in the triangle using the top down strategy. Note thismethod MUST BE recursive and you will need to create a recursive helper method. public static int minSumPathBottomUp(int[][] triangle)This method will calculate the minimum sum path in the triangle using the bottom up strategy. Note thismethod CANNOT be recursive and you should not create any additional helper functions.   Extra Challenge: Could you do this using only O(n) extra space where n is the total number of rows in thetriangle?  This is method signature class below: package dynamic; public class MinSumPath {…

In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){   srand(17);   // define a constant ARRAYSIZE that is 20    // declare randArray    // set the 20 elements in randArray to be a random number between 0 and 99   // hint: use rand()%100   // print the 20 values return 0;}

New JAVA code can only be added in between the grey lines of code (or lines 15 to 17, as shown in image).

1. h is a homomorphism from the alphabet {a,b,c} to {0,1}. If h(a) = 01, h(b) = 0, and h(c) = 10, which of the following strings is in h¨¹ (010010)? a) baab b) baba c) bcab d) cbbc 2. Find, in the list below, a regular expression whose language is the reversal of the language of this regular expression: 10(2+3). Recall that the reversal of a language is formed by reversing all its strings, and the reversal of a string a₁a2...an is an...a2a₁. a) 01(2+3) b) (2+3)10 c) 0(2+3)1 d) (2+3)01 3. If h is the homomorphism defined by h(a) = 0 and h(b) = ε, which of the following strings is in h¹ (000)? a) abbba b) abbbabaab c) baabbbabb d) babab 4. The operation Perm(w), applied to a string w, is all strings that can be constructed by permuting the symbols of w in any order. For example, if w = 101, then Perm(w) is all strings with two 1's and one 0, i.e., Perm(w) = {101, 110,011}. If L is a regular language, then Perm(L) is the union of Perm(w) taken over all w in L. For example, if L is the…

Write a code in Java programming You are working in a company, and your new task is creating an encoding algorithm to secure a given data. Given a code, write a method called encode() that takes a String and returns a new String based on the frequency of the characters.  All the even-frequency characters should be placed before the odd-frequency characters, and finally, all characters should be sorted in increasing order. Your colleague is sick again, and he cannot finish his task. He gave you an unfinished code like the following: public static String encode(String code) { // MyFunction mf = // TODO return mf.encode(code); } Your job is to complete the implementation of the functional interface MyFunction that encode() method should use to encode the given String code. The MyFunction interface should have the following signature: interface MyFunction { String encode(String code); } Additionally, your algorithm should handle the following cases: 1. If the input String is null, the…