CareerCup

How Do I Manage Different Display Resolutions?

What is the most ideal approach to get my application found?

It will gain you more knowledge intensify your soft skills, grow your network and work ethics, what is it

What application adaptation techniques should I pick?

What amount of time would it take for application to create?

What dialects are versatile applications customized in?

Does your application thought take care of any genuine issue?

What is an activity in android?

Generate random max index

Given an array of integers, randomly return an index of the maximum value seen by far.

e.g.
Given [11,30,2,30,30,30,6,2,62, 62]

Having iterated up to the at element index 5 (where the last 30 is), randomly give an index among [1, 3, 4, 5] which are indices of 30 - the max value by far. Each index should have a ¼ chance to get picked.

Having iterated through the entire array, randomly give an index between 8 and 9 which are indices of the max value 62.

Given a word of length n, and n six-sided dice with a character in each side, find out if this word is constructible by the set of given dice

[[2, NULL, 2, NULL], 
 [2, NULL, 2, NULL], 
 [NULL, NULL, NULL, NULL], 
 [NULL, NULL, NULL, NULL]]

What does the array look like after the corrected function has run?

":=" denotes the substitution, and "=" is the equal comparator.

========
Initial state of an array "a":

[[4, 2, 4, 2],
[4, NULL, 4, 2],
[2, NULL, 8, 2],
[16, NULL, 4, NULL]]

========
Main function:

FUNCTION foo()
   FOR y := 0 to 3
       FOR x := 0 to 3
           IF a[x+1][y] != NULL
               IF a[x+1][y] = a[x][y]
                   a[x][y] := a[x][y]*2
                   a[x+1][y] := NULL
               END IF
               IF a[x][y] = NULL
                   a[x][y] := a[x+1][y]
                   a[x+1][y] := NULL
               END IF
           END IF
       END FOR
  END FOR
END FUNCTION

What is the issue with the above code, and how would you fix it?

How can I tell what version of Microsoft Office 365 that I am using?

How do I export and import Company records?

I cannot allocate to a project in a Payroll Cheque Run ?

How to connect your Office 365 to Sage 50 ?

when you try to activate your Sage ID ?

I forgot my Sage Drive password, how do I reset it?

What is Sage Drive?

The Connection Manager could not start the database engine In Sage ?

The company file is on the server or another computer.?

0x80040702 "Failed to load dll: Reg 32" when installing Sage ?

How to Disable Kodak Printer Ink Monitor ?

How do I clean the printhead on my Kodak ESP c310?

How do I calibrate my Kodak printer?

How do I reset my Xerox WorkCentre 7835?

Given two strings, A and B, of equal length, find whether it is possible to cut both strings at a common point such that the first part of A and the second part of B form a palindrome.

Extension1. How would you change your solution if the strings could be cut at any point (not just a common point)?

Extension2. Multiple cuts in the strings (substrings to form a palindrome)? Form a palindrome using a substring from both strings. What is its time complexity?

You need to test a time converter that converts minutes to seconds, hours, days, weeks, months, years. What kind of test cases would you recommend? We enter only minutes, and the site automatically translates them into seconds, hours, days, weeks, months, years. This is how it looks:

[0]minutes
----------------
[0] seconds
[0] hours
[0] days
[0] weeks
[0] months
[0] years
Values change dynamically, when input data changes - minutes

/*
## Setup

The flow of a dispute is as follows:
- A charge is created by an end customer.
- Stripe receives a dispute record from the bank.
- The business responds with evidence.
- If no second dispute is received within 30 days after evidence submission, the dispute is won. If a second dispute is received, the dispute is lost.

Charge
(Maybe) Dispute Record
(Maybe) Evidence submission
(Maybe) Second Dispute Record

The raw tables generated from the API look like:

```
Charges
+---------------+-----------+
| charge_id | varchar |
| created | timestamp |
| amount | int |
| seller_id | varchar |
| customer_id | varchar |
+---------------|-----------+

Dispute Records
+----------------+-----------+
| dispute_id | varchar |
| created | timestamp |
| charge_id | varchar |
+----------------|-----------+

Evidence Submission
+-------------------+-----------+
| evidence_id | varchar |
| created | timestamp |
| charge_id | varchar |
+-------------------|-----------+
```
*/

/*

1. Can you design a unified dispute table that would allow us to compute things like the win rate, dispute rate, evidence submission rate etc?

*/

A happy number is defined by the following process. Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers.
Input:
Your program should read lines of text from standard input. Each line contains a single positive integer, N.
Output:
If the number is a happy number, print 1 to standard output. Otherwise, print 0.