{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.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":"2026-05-26T00: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":2523,"title":"longest common substring : Skipped character version","description":"Two strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\r\n\r\nExample:\r\n\r\n  str1 = 'abcdefghi';\r\n  str2 = 'zazbzczd';\r\n  \r\n  output = 'abcd'","description_html":"\u003cp\u003eTwo strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003estr1 = 'abcdefghi';\r\nstr2 = 'zazbzczd';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eoutput = 'abcd'\r\n\u003c/pre\u003e","function_template":"function y = skipped(str1,str2)\r\n  y = x;\r\nend","test_suite":"%%\r\nstr1 = 'abcdefghi';\r\nstr2 = 'zazbzczd';\r\ny_correct = 'abcd';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n%%\r\nstr1 = 'abcdefghi';\r\nstr2 = 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz';\r\ny_correct = '';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n\r\n%%\r\nstr1 = 'catcatcat';\r\nstr2 = 'catcatcat';\r\ny_correct = str1;\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'an example of a string';\r\nstr2 = 'the example z a s t r i i i n ssss';\r\ny_correct = ' example  a strin';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'a string with many characters';\r\nstr2 = 'zzz zzz zzz zzz zzz';\r\ny_correct = '    ';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'lets!not!use!spaces';\r\nstr2 = 'z!zzzzzzzzZZZzZzZ!zzzzz!zzzzzzzzz!!!!!!!!!zzz';\r\ny_correct = '!!!';\r\nassert(isequal(skipped(str1,str2),y_correct))","published":true,"deleted":false,"likes_count":0,"comments_count":4,"created_by":17203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":54,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":32,"created_at":"2014-08-20T10:44:21.000Z","updated_at":"2026-05-24T16:37:01.000Z","published_at":"2014-08-20T10:44:21.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\u003eTwo strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\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[str1 = 'abcdefghi';\\nstr2 = 'zazbzczd';\\n\\noutput = 'abcd']]\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":{"problems":[{"id":2523,"title":"longest common substring : Skipped character version","description":"Two strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\r\n\r\nExample:\r\n\r\n  str1 = 'abcdefghi';\r\n  str2 = 'zazbzczd';\r\n  \r\n  output = 'abcd'","description_html":"\u003cp\u003eTwo strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003estr1 = 'abcdefghi';\r\nstr2 = 'zazbzczd';\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eoutput = 'abcd'\r\n\u003c/pre\u003e","function_template":"function y = skipped(str1,str2)\r\n  y = x;\r\nend","test_suite":"%%\r\nstr1 = 'abcdefghi';\r\nstr2 = 'zazbzczd';\r\ny_correct = 'abcd';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n%%\r\nstr1 = 'abcdefghi';\r\nstr2 = 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz';\r\ny_correct = '';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n\r\n%%\r\nstr1 = 'catcatcat';\r\nstr2 = 'catcatcat';\r\ny_correct = str1;\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'an example of a string';\r\nstr2 = 'the example z a s t r i i i n ssss';\r\ny_correct = ' example  a strin';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'a string with many characters';\r\nstr2 = 'zzz zzz zzz zzz zzz';\r\ny_correct = '    ';\r\nassert(isequal(skipped(str1,str2),y_correct))\r\n\r\n\r\n%%\r\nstr1 = 'lets!not!use!spaces';\r\nstr2 = 'z!zzzzzzzzZZZzZzZ!zzzzz!zzzzzzzzz!!!!!!!!!zzz';\r\ny_correct = '!!!';\r\nassert(isequal(skipped(str1,str2),y_correct))","published":true,"deleted":false,"likes_count":0,"comments_count":4,"created_by":17203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":54,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":32,"created_at":"2014-08-20T10:44:21.000Z","updated_at":"2026-05-24T16:37:01.000Z","published_at":"2014-08-20T10:44:21.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\u003eTwo strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.\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[str1 = 'abcdefghi';\\nstr2 = 'zazbzczd';\\n\\noutput = 'abcd']]\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\"}]}"}],"errors":[],"facets":[[{"value":"Algorithm I","count":1,"selected":false},{"value":"Strings III","count":1,"selected":false}],[{"value":"hard","count":1,"selected":false}]],"term":"tag:\"substring matching\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}