{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2025-12-14T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":44397,"title":"Determine whether the input is odd, even, or neither.","description":"Make a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input  is neither odd nor even. Where the input could be a number, letter or symbol.","description_html":"\u003cp\u003eMake a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input  is neither odd nor even. Where the input could be a number, letter or symbol.\u003c/p\u003e","function_template":"function n=oddornot(x);\r\n\r\nend","test_suite":"%%\r\nx = 1;\r\nn_correct = 'odd';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 12;\r\nn_correct = 'even';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 467.3;\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = -911;\r\nn_correct = 'odd';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 8230749726348;\r\nn_correct = 'even';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = pi;\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 'a';\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 'donald';\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":157578,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":52,"test_suite_updated_at":"2017-11-07T16:19:21.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2017-11-03T15:22:49.000Z","updated_at":"2026-04-01T11:19:18.000Z","published_at":"2017-11-03T15:22:49.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMake a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input is neither odd nor even. Where the input could be a number, letter or symbol.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":43056,"title":"Check capital letters","description":"Check if each first letter of a string is a capital letter.\r\nfor example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false","description_html":"\u003cp\u003eCheck if each first letter of a string is a capital letter.\r\nfor example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false\u003c/p\u003e","function_template":"function y = checkCap(x)\r\n  y = false;\r\nend","test_suite":"%%\r\nx = 'This Is Ok';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'This Is not Ok';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'this Is Not Ok';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'Hello there';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'Hello There!';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'ThiS senTence haS problemS';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'This Sentence Does Not';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'One last One';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":1,"created_by":94929,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":44,"test_suite_updated_at":"2016-10-19T11:47:01.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-10-05T13:40:35.000Z","updated_at":"2026-04-02T12:58:27.000Z","published_at":"2016-10-05T13:40:35.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCheck if each first letter of a string is a capital letter. for example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":44852,"title":"Mean number of letters per word (Easy)","description":"Given a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\r\n\r\nYou may make the following assumptions:\r\n\r\n1. All characters in the array are either letters or spaces.\r\n\r\n2. There are no redundant spaces.\r\n\r\n3. Except for spaces, there is no punctuation in the sentence.\r\n\r\n4. There will always be at least two words in the sentence.\r\n\r\nExample:\r\n\r\n  c = 'The quick brown fox jumps over the lazy dog';\r\n  \r\n  a = 3.889;\r\n\r\nExample:\r\n\r\n  c = 'Another one bites the dust';\r\n  \r\n  a = 4.400;\r\n\r\nThe next problem in this series is \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard Problem 44853\u003e.","description_html":"\u003cp\u003eGiven a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/p\u003e\u003cp\u003eYou may make the following assumptions:\u003c/p\u003e\u003cp\u003e1. All characters in the array are either letters or spaces.\u003c/p\u003e\u003cp\u003e2. There are no redundant spaces.\u003c/p\u003e\u003cp\u003e3. Except for spaces, there is no punctuation in the sentence.\u003c/p\u003e\u003cp\u003e4. There will always be at least two words in the sentence.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'The quick brown fox jumps over the lazy dog';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 3.889;\r\n\u003c/pre\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'Another one bites the dust';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 4.400;\r\n\u003c/pre\u003e\u003cp\u003eThe next problem in this series is \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard\"\u003eProblem 44853\u003c/a\u003e.\u003c/p\u003e","function_template":"function a = your_fcn_name(c)\r\n    a = 0;\r\nend","test_suite":"%%\r\nfiletext = fileread('your_fcn_name.m');\r\nassert(isempty(strfind(filetext,'eval')))\r\nassert(isempty(strfind(filetext,'echo')))\r\nassert(isempty(strfind(filetext,'switch')))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Hello world'),5.000))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('The quick brown fox jumps over the lazy dog'),3.889))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Another one bites the dust'),4.400))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Antidisestablishmentarianism is the longest nonscientific word in the English language'),7.700))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('I ate pudding'),3.667))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('I hate pudding'),4.000))","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":15521,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":36,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":65,"created_at":"2019-02-16T20:34:25.000Z","updated_at":"2026-03-24T12:02:15.000Z","published_at":"2019-02-16T21:25:09.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou may make the following assumptions:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. All characters in the array are either letters or spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There are no redundant spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. Except for spaces, there is no punctuation in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. There will always be at least two words in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'The quick brown fox jumps over the lazy dog';\\n\\na = 3.889;]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'Another one bites the dust';\\n\\na = 4.400;]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe next problem in this series is\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eProblem 44853\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":44853,"title":"Mean number of letters per word (Hard)","description":"The previous problem in this series is \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy 44852\u003e.\r\n\r\nGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\r\n\r\nYou may make the following assumptions:\r\n\r\n1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\r\n\r\n2. There may be redundant spaces in the sentence.\r\n\r\n3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\r\n\r\n4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\r\n\r\nExample:\r\n\r\n  c = 'The quick brown fox jumps over the lazy dog';\r\n  \r\n  a = 3.889;\r\n  g = 3.792\r\n\r\nExample:\r\n\r\n  c = 'Another one bites the dust';\r\n  \r\n  a = 4.400;\r\n  g = 4.169","description_html":"\u003cp\u003eThe previous problem in this series is \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy\"\u003e44852\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/p\u003e\u003cp\u003eYou may make the following assumptions:\u003c/p\u003e\u003cp\u003e1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\u003c/p\u003e\u003cp\u003e2. There may be redundant spaces in the sentence.\u003c/p\u003e\u003cp\u003e3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\u003c/p\u003e\u003cp\u003e4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'The quick brown fox jumps over the lazy dog';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 3.889;\r\ng = 3.792\r\n\u003c/pre\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'Another one bites the dust';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 4.400;\r\ng = 4.169\r\n\u003c/pre\u003e","function_template":"function [a,g] = your_fcn_name(c)\r\n    a = 0;\r\n    g = 0;\r\nend","test_suite":"%%\r\nfiletext = fileread('your_fcn_name.m');\r\nassert(isempty(strfind(filetext,'eval')))\r\nassert(isempty(strfind(filetext,'echo')))\r\nassert(isempty(strfind(filetext,'switch')))\r\n\r\n%%\r\n[a,g] = your_fcn_name('');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' ');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' ,\u0026 ');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name([]);\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name('23');\r\nassert(isequal(a,0.000))\r\nassert(isequal(g,0.000))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' The quick, brown fox jumps over the lazy dog.');\r\nassert(isequal(a,3.889))\r\nassert(isequal(g,3.792))\r\n\r\n%%\r\n[a,g] = your_fcn_name('...another 1 bites the dust...');\r\nassert(isequal(a,3.800))\r\nassert(isequal(g,0.000))\r\n\r\n%%\r\n[a,g] = your_fcn_name('Is ''antidisestablishmentarianism'' the longest (nonscientific) word in the English language ?');\r\nassert(isequal(a,7.700))\r\nassert(isequal(g,5.386))\r\n\r\n%%\r\n[a,g] = your_fcn_name('I ate pudding :-)');\r\nassert(isequal(a,3.667))\r\nassert(isequal(g,2.759))\r\n\r\n%%\r\n[a,g] = your_fcn_name('I hate pudding!');\r\nassert(isequal(a,4.000))\r\nassert(isequal(g,3.037))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":15521,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":13,"test_suite_updated_at":"2019-02-16T21:25:35.000Z","rescore_all_solutions":false,"group_id":65,"created_at":"2019-02-16T21:17:39.000Z","updated_at":"2019-05-02T15:18:33.000Z","published_at":"2019-02-16T21:25:35.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe previous problem in this series is\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e44852\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou may make the following assumptions:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There may be redundant spaces in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'The quick brown fox jumps over the lazy dog';\\n\\na = 3.889;\\ng = 3.792]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'Another one bites the dust';\\n\\na = 4.400;\\ng = 4.169]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":44397,"title":"Determine whether the input is odd, even, or neither.","description":"Make a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input  is neither odd nor even. Where the input could be a number, letter or symbol.","description_html":"\u003cp\u003eMake a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input  is neither odd nor even. Where the input could be a number, letter or symbol.\u003c/p\u003e","function_template":"function n=oddornot(x);\r\n\r\nend","test_suite":"%%\r\nx = 1;\r\nn_correct = 'odd';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 12;\r\nn_correct = 'even';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 467.3;\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = -911;\r\nn_correct = 'odd';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 8230749726348;\r\nn_correct = 'even';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = pi;\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 'a';\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n%%\r\nx = 'donald';\r\nn_correct = 'error';\r\nassert(isequal(oddornot(x),n_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":157578,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":52,"test_suite_updated_at":"2017-11-07T16:19:21.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2017-11-03T15:22:49.000Z","updated_at":"2026-04-01T11:19:18.000Z","published_at":"2017-11-03T15:22:49.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMake a function that returns ‘odd’ if the input is odd, ‘even’ if the input if even or ‘error’ if the input is neither odd nor even. Where the input could be a number, letter or symbol.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":43056,"title":"Check capital letters","description":"Check if each first letter of a string is a capital letter.\r\nfor example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false","description_html":"\u003cp\u003eCheck if each first letter of a string is a capital letter.\r\nfor example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false\u003c/p\u003e","function_template":"function y = checkCap(x)\r\n  y = false;\r\nend","test_suite":"%%\r\nx = 'This Is Ok';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'This Is not Ok';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'this Is Not Ok';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'Hello there';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'Hello There!';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'ThiS senTence haS problemS';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'This Sentence Does Not';\r\ny_correct = true;\r\nassert(isequal(checkCap(x),y_correct))\r\n\r\n%%\r\nx = 'One last One';\r\ny_correct = false;\r\nassert(isequal(checkCap(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":1,"created_by":94929,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":44,"test_suite_updated_at":"2016-10-19T11:47:01.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2016-10-05T13:40:35.000Z","updated_at":"2026-04-02T12:58:27.000Z","published_at":"2016-10-05T13:40:35.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCheck if each first letter of a string is a capital letter. for example: 'This Is Ok' gives a true answer and 'This Is not Ok' gives false\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":44852,"title":"Mean number of letters per word (Easy)","description":"Given a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\r\n\r\nYou may make the following assumptions:\r\n\r\n1. All characters in the array are either letters or spaces.\r\n\r\n2. There are no redundant spaces.\r\n\r\n3. Except for spaces, there is no punctuation in the sentence.\r\n\r\n4. There will always be at least two words in the sentence.\r\n\r\nExample:\r\n\r\n  c = 'The quick brown fox jumps over the lazy dog';\r\n  \r\n  a = 3.889;\r\n\r\nExample:\r\n\r\n  c = 'Another one bites the dust';\r\n  \r\n  a = 4.400;\r\n\r\nThe next problem in this series is \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard Problem 44853\u003e.","description_html":"\u003cp\u003eGiven a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/p\u003e\u003cp\u003eYou may make the following assumptions:\u003c/p\u003e\u003cp\u003e1. All characters in the array are either letters or spaces.\u003c/p\u003e\u003cp\u003e2. There are no redundant spaces.\u003c/p\u003e\u003cp\u003e3. Except for spaces, there is no punctuation in the sentence.\u003c/p\u003e\u003cp\u003e4. There will always be at least two words in the sentence.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'The quick brown fox jumps over the lazy dog';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 3.889;\r\n\u003c/pre\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'Another one bites the dust';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 4.400;\r\n\u003c/pre\u003e\u003cp\u003eThe next problem in this series is \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard\"\u003eProblem 44853\u003c/a\u003e.\u003c/p\u003e","function_template":"function a = your_fcn_name(c)\r\n    a = 0;\r\nend","test_suite":"%%\r\nfiletext = fileread('your_fcn_name.m');\r\nassert(isempty(strfind(filetext,'eval')))\r\nassert(isempty(strfind(filetext,'echo')))\r\nassert(isempty(strfind(filetext,'switch')))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Hello world'),5.000))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('The quick brown fox jumps over the lazy dog'),3.889))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Another one bites the dust'),4.400))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('Antidisestablishmentarianism is the longest nonscientific word in the English language'),7.700))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('I ate pudding'),3.667))\r\n\r\n%%\r\nassert(isequal(your_fcn_name('I hate pudding'),4.000))","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":15521,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":36,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":65,"created_at":"2019-02-16T20:34:25.000Z","updated_at":"2026-03-24T12:02:15.000Z","published_at":"2019-02-16T21:25:09.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a character array, s, representing a sentence, return a, the arithmetic mean of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou may make the following assumptions:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. All characters in the array are either letters or spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There are no redundant spaces.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. Except for spaces, there is no punctuation in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. There will always be at least two words in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'The quick brown fox jumps over the lazy dog';\\n\\na = 3.889;]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'Another one bites the dust';\\n\\na = 4.400;]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe next problem in this series is\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/44853-mean-number-of-letters-per-word-hard\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eProblem 44853\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":44853,"title":"Mean number of letters per word (Hard)","description":"The previous problem in this series is \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy 44852\u003e.\r\n\r\nGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\r\n\r\nYou may make the following assumptions:\r\n\r\n1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\r\n\r\n2. There may be redundant spaces in the sentence.\r\n\r\n3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\r\n\r\n4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\r\n\r\nExample:\r\n\r\n  c = 'The quick brown fox jumps over the lazy dog';\r\n  \r\n  a = 3.889;\r\n  g = 3.792\r\n\r\nExample:\r\n\r\n  c = 'Another one bites the dust';\r\n  \r\n  a = 4.400;\r\n  g = 4.169","description_html":"\u003cp\u003eThe previous problem in this series is \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy\"\u003e44852\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/p\u003e\u003cp\u003eYou may make the following assumptions:\u003c/p\u003e\u003cp\u003e1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\u003c/p\u003e\u003cp\u003e2. There may be redundant spaces in the sentence.\u003c/p\u003e\u003cp\u003e3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\u003c/p\u003e\u003cp\u003e4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'The quick brown fox jumps over the lazy dog';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 3.889;\r\ng = 3.792\r\n\u003c/pre\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ec = 'Another one bites the dust';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ea = 4.400;\r\ng = 4.169\r\n\u003c/pre\u003e","function_template":"function [a,g] = your_fcn_name(c)\r\n    a = 0;\r\n    g = 0;\r\nend","test_suite":"%%\r\nfiletext = fileread('your_fcn_name.m');\r\nassert(isempty(strfind(filetext,'eval')))\r\nassert(isempty(strfind(filetext,'echo')))\r\nassert(isempty(strfind(filetext,'switch')))\r\n\r\n%%\r\n[a,g] = your_fcn_name('');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' ');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' ,\u0026 ');\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name([]);\r\nassert(isempty(a))\r\nassert(isempty(g))\r\n\r\n%%\r\n[a,g] = your_fcn_name('23');\r\nassert(isequal(a,0.000))\r\nassert(isequal(g,0.000))\r\n\r\n%%\r\n[a,g] = your_fcn_name(' The quick, brown fox jumps over the lazy dog.');\r\nassert(isequal(a,3.889))\r\nassert(isequal(g,3.792))\r\n\r\n%%\r\n[a,g] = your_fcn_name('...another 1 bites the dust...');\r\nassert(isequal(a,3.800))\r\nassert(isequal(g,0.000))\r\n\r\n%%\r\n[a,g] = your_fcn_name('Is ''antidisestablishmentarianism'' the longest (nonscientific) word in the English language ?');\r\nassert(isequal(a,7.700))\r\nassert(isequal(g,5.386))\r\n\r\n%%\r\n[a,g] = your_fcn_name('I ate pudding :-)');\r\nassert(isequal(a,3.667))\r\nassert(isequal(g,2.759))\r\n\r\n%%\r\n[a,g] = your_fcn_name('I hate pudding!');\r\nassert(isequal(a,4.000))\r\nassert(isequal(g,3.037))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":15521,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":13,"test_suite_updated_at":"2019-02-16T21:25:35.000Z","rescore_all_solutions":false,"group_id":65,"created_at":"2019-02-16T21:17:39.000Z","updated_at":"2019-05-02T15:18:33.000Z","published_at":"2019-02-16T21:25:35.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe previous problem in this series is\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/44852-mean-number-of-letters-per-word-easy\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e44852\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a character array, s, representing a sentence, return a and g, the arithmetic and geometric means, respectively, of the number of letters per word in the given sentence. Round your answer to three decimal digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou may make the following assumptions:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1. Not all characters in the array are either letters or spaces. There may also be numeric characters, as well as punctuation.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2. There may be redundant spaces in the sentence.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3. Punctuation does not count as a letter and cannot constitute a word in itself. Numbers also do not count as letters, but can constitute a word.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e4. There can be any number of characters and/or words in the sentence, including zero. When there are zero words in the sentence, return empty matrices for a and g.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'The quick brown fox jumps over the lazy dog';\\n\\na = 3.889;\\ng = 3.792]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[c = 'Another one bites the dust';\\n\\na = 4.400;\\ng = 4.169]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"characters\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"characters\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"characters\"","","\"","characters","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f102b55db78\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f102b55dad8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f102b55d218\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f102b55ddf8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f102b55dd58\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f102b55dcb8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f102b55dc18\u003e":"tag:\"characters\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f102b55dc18\u003e":"tag:\"characters\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"search","password":"J3bGPZzQ7asjJcCk","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"characters\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"characters\"","","\"","characters","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f102b55db78\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f102b55dad8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f102b55d218\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f102b55ddf8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f102b55dd58\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f102b55dcb8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f102b55dc18\u003e":"tag:\"characters\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f102b55dc18\u003e":"tag:\"characters\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44397,"difficulty_rating":"easy"},{"id":43056,"difficulty_rating":"easy"},{"id":44852,"difficulty_rating":"easy"},{"id":44853,"difficulty_rating":"medium"}]}}