public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string

JAVA Coding Problem Holi is celebrated in India as a festival of colours and your friend Khan from India has gifted you X packets of colours. Now you are planning to make a beautiful rangoli, to make it you need to map all colours pairwise distinct, so that they look attractive. To do so, you can mix the colours zero or more times: Pick any two random colours. Let's denote their weight by t and u. Mix the colour with second colour. After the process, the value of the first colour remains t, but the weight of the second colour changes to t+ u. Now you have to develop the code to find the minimum number of mixing operations you needs to perform to make a beautiful Rangoli. Sample Test Case Scenario: 1 3 321 Output:

please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1

nbm.m//,//

Broken Cabins Problem Statement: There is an Office consisting of m cabins enumerated from 1 to m. Each cabin is 1 meter long. Sadly, some cabins are broken and need to be repaired. You have an infinitely long repair tape. You want to cut some pieces from the tape and use them to cover all of the broken cabins. To be precise, a piece of tape of integer length t placed at some positions will cover segments 5,5+1-sit-1. You are allowed to cover non-broken cabins, it is also possible that some pieces of tape will overlap. Time is money, so you want to cut at most k continuous pieces of tape to cover all the broken cabins. What is the minimum total length of these pieces? Input Format The first line contains three integers n,m and k(1sns10°, namsloº, Isksn) - the number of broken cabins, the length of the stick and the maximum number of pieces you can use The second line contains n integers bl,b2,bn (Isbism) - the positions of the broken cabins. These integers are given in increasing…

CODE USING C++ 4. Survival of the Biggest by CodeChum Admin Looping a number and taking away each digit of it is so much fun, but I wanted to try out a much more complex task: getting the largest digit among them all.   Think you can handle the job?     Instructions: Input a random positive integer. Using the same concept as the previous problem, figure out how to separate the digits of a number and determine which of the digits is the largest one, using a while loop. Afterwards, print the largest digit. Tip: Create another variable that will hold the largest digit and overwrite its initial value whenever another digit is larger than the value it is currently storing. Input A line containing an integer. 214 Output A line containing an integer. 4

can you do it in python, thank you.

Python:Write a program that prompts you to type an integer value and indicates whether the number is: Positive torqueOdd positiveNegative torqueNegative oddFor this exercise, consider the value 0 as a positive pair.

Loops summary: for vs. while We have now seen that Python has two different loop constructs: the for loop and the while loop. The while loop is more powerful than the for loop, since it can be used in situations where the number of iterations isn't known in advance. For example, the following while loop answers the question: "If a population of bacteria increases in size by 21% every minute, how long does it take for the population size to double?" minutes = 0 population = 1000 growth_rate = 0.21 while population < 2000: population *= (1 + growth_rate) minutes += 1 print (f"{minutes} minutes required.") print (f"Population = {int(population)}") This would not be well suited to a for loop - we are trying to find out how many times the loop will run, and a for loop expects to know how many times it will run before it starts. In contrast, the for loop is a special case of the more general while loop, meaning that any program written with for loops can be rewritten to use while loops.…