- Integer Substrings: Write a function that, given two integers A and B, returns the leftmost position at which A occurs in B. The function should return -1 if A does not occur in B.
- Increment Array: Write a function which returns an array which represents number X+1.
- String Transformation: Write a function that, given a string S (containing only the letters 'A', 'B', and 'C') consisting of N characters, returns any string that can result from a sequence of transformations.
- Calculate List lenght from Array: Write a function that, given a non-empty array A consisting of N integers, returns the length of the list constructed from A.
-
Notifications
You must be signed in to change notification settings - Fork 0
1. Write a function that, given two integers A and B, returns the leftmost position at which A occurs in B. The function should return -1 if A does not occur in B. 2. Write a function which returns an array which represents number X+1. 3. Write a function that, given a string S (containing only the letters 'A', 'B', and 'C') consisting of N char…
mlskidmore/Codility-Challenges
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
1. Write a function that, given two integers A and B, returns the leftmost position at which A occurs in B. The function should return -1 if A does not occur in B. 2. Write a function which returns an array which represents number X+1. 3. Write a function that, given a string S (containing only the letters 'A', 'B', and 'C') consisting of N char…
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published