ðŸŽ‰ Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io ðŸŽ‰

# deweks0's solution

## to Transpose in the JavaScript Track

Published at Apr 05 2021 · 0 comments
Instructions
Test suite
Solution

Given an input text output it transposed.

Roughly explained, the transpose of a matrix:

``````ABC
DEF
``````

is given by:

``````AD
BE
CF
``````

Rows become columns and columns become rows. See https://en.wikipedia.org/wiki/Transpose.

If the input has rows of different lengths, this is to be solved as follows:

• Pad to the left with spaces.
• Don't pad to the right.

Therefore, transposing this matrix:

``````ABC
DE
``````

results in:

``````AD
BE
C
``````

And transposing:

``````AB
DEF
``````

results in:

``````AD
BE
F
``````

In general, all characters from the input should also be present in the transposed output. That means that if a column in the input text contains only spaces on its bottom-most row(s), the corresponding output row should contain the spaces in its right-most column(s).

## Setup

Go through the setup instructions for Javascript to install the necessary dependencies:

https://exercism.io/tracks/javascript/installation

## Requirements

Please `cd` into exercise directory before running all below commands.

Install assignment dependencies:

``````\$ npm install
``````

## Making the test suite pass

Execute the tests with:

``````\$ npm test
``````

In the test suites all tests but the first have been skipped.

Once you get a test passing, you can enable the next one by changing `xtest` to `test`.

## Submitting Solutions

Once you have a solution ready, you can submit it using:

``````exercism submit transpose.js
``````

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

## Exercise Source Credits

Reddit r/dailyprogrammer challenge #270 [Easy]. https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text

### transpose.spec.js

``````import { transpose } from './transpose';

describe('Transpose', () => {
test('empty string', () => {
expect(transpose([])).toEqual([]);
});

xtest('two characters in a row', () => {
const input = ['A1'];
const expected = ['A', '1'];
expect(transpose(input)).toEqual(expected);
});

xtest('two characters in a column', () => {
const input = ['A', '1'];
const expected = ['A1'];
expect(transpose(input)).toEqual(expected);
});

xtest('simple', () => {
const input = ['ABC', '123'];
const expected = ['A1', 'B2', 'C3'];
expect(transpose(input)).toEqual(expected);
});

xtest('single line', () => {
const input = ['Single line.'];
const expected = [
'S',
'i',
'n',
'g',
'l',
'e',
' ',
'l',
'i',
'n',
'e',
'.',
];
expect(transpose(input)).toEqual(expected);
});

xtest('first line longer than second line', () => {
const input = ['The fourth line.', 'The fifth line.'];
const expected = [
'TT',
'hh',
'ee',
'  ',
'ff',
'oi',
'uf',
'rt',
'th',
'h ',
' l',
'li',
'in',
'ne',
'e.',
'.',
];
expect(transpose(input)).toEqual(expected);
});

xtest('second line longer than first line', () => {
const input = ['The first line.', 'The second line.'];
const expected = [
'TT',
'hh',
'ee',
'  ',
'fs',
'ie',
'rc',
'so',
'tn',
' d',
'l ',
'il',
'ni',
'en',
'.e',
' .',
];
expect(transpose(input)).toEqual(expected);
});

xtest('square', () => {
const input = ['HEART', 'EMBER', 'ABUSE', 'RESIN', 'TREND'];
const expected = ['HEART', 'EMBER', 'ABUSE', 'RESIN', 'TREND'];
expect(transpose(input)).toEqual(expected);
});

xtest('rectangle', () => {
const input = ['FRACTURE', 'OUTLINED', 'BLOOMING', 'SEPTETTE'];
const expected = [
'FOBS',
'RULE',
'ATOP',
'CLOT',
'TIME',
'UNIT',
'RENT',
'EDGE',
];
expect(transpose(input)).toEqual(expected);
});

xtest('triangle', () => {
const input = ['T', 'EE', 'AAA', 'SSSS', 'EEEEE', 'RRRRRR'];
const expected = [
'TEASER',
' EASER',
'  ASER',
'   SER',
'    ER',
'     R',
];
expect(transpose(input)).toEqual(expected);
});

xtest('many lines', () => {
const input = [
'Chor. Two households, both alike in dignity,',
'In fair Verona, where we lay our scene,',
'From ancient grudge break to new mutiny,',
'Where civil blood makes civil hands unclean.',
'From forth the fatal loins of these two foes',
"A pair of star-cross'd lovers take their life;",
"Doth with their death bury their parents' strife.",
"The fearful passage of their death-mark'd love,",
"And the continuance of their parents' rage,",
"Which, but their children's end, naught could remove,",
"Is now the two hours' traffic of our stage;",
'The which if you with patient ears attend,',
'What here shall miss, our toil shall strive to mend.',
];
const expected = [
'CIFWFAWDTAWITW',
'hnrhr hohnhshh',
'o oeopotedi ea',
'rfmrmash  cn t',
'.a e ie fthow ',
' ia fr weh,whh',
'Trnco miae  ie',
'w ciroitr btcr',
'oVivtfshfcuhhe',
' eeih a uote  ',
'hrnl sdtln  is',
'oot ttvh tttfh',
'un bhaeepihw a',
'saglernianeoyl',
'e,ro -trsui ol',
'h uofcu sarhu ',
'owddarrdan o m',
"lhg to'egccuwi",
'deemasdaeehris',
'sr als t  ists',
",ebk 'phool'h,",
'  reldi ffd   ',
'bweso tb  rtpo',
'oea ileutterau',
't kcnoorhhnatr',
"hl isvuyee'fi ",
' atv es iisfet',
'ayoior trr ino',
'l  lfsoh  ecti',
'ion   vedpn  l',
'erwaharrar,fas',
'   nekt te  rh',
'ismdsehphnnosa',
'ncuse ra-tau l',
' et  tormsural',
"dniuthwea'g t ",
'iennwesnr hsts',
'g,ycoi tkrttet',
"n ,l r s'a anr",
"i  ef  'dgcgdi",
't  aol   eoe,v',
'y  nei sl,u; e',
',  .sf to l   ',
'     e rv d  t',
'     ; ie    o',
'       f, r   ',
'       e  e  m',
'       .  m  e',
'          o  n',
'          v  d',
'          e  .',
'          ,',
];
expect(transpose(input)).toEqual(expected);
});
});``````
``````//
// This is only a SKELETON file for the 'Transpose' exercise. It's been provided as a
// convenience to get you started writing code faster.
//
// const getMaxLength = input => input.reduce((maxLength, { length }) => Math.max(maxLength, length), 0)

export const transpose = (arr) => {
let result = [];
let length = 0;
arr.forEach(element => {
if (element.length > length) length = element.length;
});

for (let i = 0; i < length; i++) {
let output = (arr[0][i]) ? arr[0][i] : ' ';
for (let j = 1; j < arr.length; j++) {
output += (arr[j][i]) ? arr[j][i] : ' ';
}
if (i === length - 1) output = output.trimEnd();
result.push(output);
}
return result;
};``````