CareerCup

Given a string "2-4a0r7-4k", there are two dashes which we can split into 3 groups of length 1, 5, 2.

If we want each group to be length 4, then we get "24A0-R74k"

Given a String A and an int K, return a correctly formatted string.

IF A is "2-4A0r7-4k" and B is 4, string is "24A0-R74K"
IF K is 3, string is "24-A0R-74K" as the first grp could be shorter.

CAREERCUP is a boad game hat contains m x n on a board. The objective of the CAREERCUP game is to reach the bottom of he board (bottom right corner) from the top of the board (top left corner) while moving one grid at a ime in either the down, right or diagonally downwrd directions.

Write a method called CareerSolution that takes in two integers representing m and n, and returns the total number of ways a player can complete the game.

PS: Was later asked to optimize the solution.

int CareerSolution(int m, int n) {

}

Let's say I have a word "I love chicken", I can break the number of characters in each word, like so: [1] [4] [7]
[1,4] [4,7], [1,4,7].

Now let's say I have a max = 5. The phrases with equal or fever than 5 characters are "[I], [love], and [I, love]. The longest phrase is [I,love], which contains 2 words.

Complete the Length function given. It has 2 parameters:

1) An array of integers, named array
2) A maximum number, named max.

int Careercup( int [] array, int max) {
}

Example test case 1:

[3,1,2,3]
4

Output expected : 2

-

find consecutive integers in a list that give you the biggest sum

Like for -2 5 -1 7 -3 it would be 5 -1 7

Write the function READ, which is passed two double pointers pointing to the head pointers of two linked lists.

One list will hold even integers, the other one will hold odd integers. READ reads a series of integers. It separates adds odd integers to the first list, and even ones to the second, all in sorted order.

Given a string containing only 0 and 1's, write a function that reverses and returns the two complements of the string.

Implement a Qsort similar to the build in one in C, but use an insertion sort instead

void GoogleSort(void *ptr, int number, int SIZE, int (*functionp)(const void *, const void *)) {

}

-

int main() {
int google = ??

if ( google == -google)
return 1;

return 0;
}

There are two answers, the first being zero. What's the second value?

Given a number (200), compare it to four variables (E.G A,B,C,D) and return true if they are all equal to the given number.

Do this in the most efficient way, and if possible without if statements.

Write a method that takes in a positive integer, return the number of 2s between 0 and the input number.

If the input value given is 13, it should return 2 as the number 2 and 12 are between 0 and 13.

If the input value given is 21, it should return 3 as the number 2,12 and 20 are between 0 and 21.

Implement an algorithm that takes a adjacency list and produces a topological sort of the vertices.

INPUT:

1 2
1 3
1 4
3 5
2 5
4 5

Returns:
1 2 3 4 5

write a method that takes in 2 int arrays of any size and returns an array that calculates the sum of both.

for example, [1,2,3] and [2,3,4] will return [3,5,7]

Or [1,2,3] and [2,3,5,5] will return [2,4,7,8]

however, if it's like [9,9,2] and [0,1,3] you need to carry the sum so it returns as [1,0,0,5]

** SINGLE DIGIT ONLY