{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.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-04-06T00: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":42894,"title":"Find longest run","description":"Write a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\r\n\r\nExamples:\r\n\r\n1. |longest_run([1 1 0 1])| should output |[2 1]|,\r\nsince the longest consecutive run is 11, which starts at index 1\r\n\r\n2. |longest_run([1 1 0 1 0 0 0 0 1 1 1])| should ouptut |[4 5]|,\r\nsince the longest consecutive run is 0000, which starts at index 5\r\n\r\n3. |longest_run([1 0])| should ouptut |[1 1]|,\r\nsince the _first_ longest consecutive run is 1, which starts at index 1","description_html":"\u003cp\u003eWrite a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cp\u003e1. \u003ctt\u003elongest_run([1 1 0 1])\u003c/tt\u003e should output \u003ctt\u003e[2 1]\u003c/tt\u003e,\r\nsince the longest consecutive run is 11, which starts at index 1\u003c/p\u003e\u003cp\u003e2. \u003ctt\u003elongest_run([1 1 0 1 0 0 0 0 1 1 1])\u003c/tt\u003e should ouptut \u003ctt\u003e[4 5]\u003c/tt\u003e,\r\nsince the longest consecutive run is 0000, which starts at index 5\u003c/p\u003e\u003cp\u003e3. \u003ctt\u003elongest_run([1 0])\u003c/tt\u003e should ouptut \u003ctt\u003e[1 1]\u003c/tt\u003e,\r\nsince the \u003ci\u003efirst\u003c/i\u003e longest consecutive run is 1, which starts at index 1\u003c/p\u003e","function_template":"function [run_length, start_index] = longest_run(binary_array)\r\n%longest_run Finds longest consecutive runs of zeros or ones\r\n%   run_length is the length of the longest run of zeros or ones\r\n%   start_index is the index where the run begins\r\n\r\n    run_length = 1;\r\n    start_index = 1;\r\nend","test_suite":"%%\r\nbinary_array = [1 1 0 1];\r\nexpected_length = 2;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 1 0 1 0 0 0 0 1 1 1];\r\nexpected_length = 4;\r\nexpected_index = 5;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 0];\r\nexpected_length = 1;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1];\r\nexpected_length = 1;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 1 1 1 1 1];\r\nexpected_length = 6;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));","published":true,"deleted":false,"likes_count":4,"comments_count":0,"created_by":26948,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":88,"test_suite_updated_at":"2016-06-29T20:27:09.000Z","rescore_all_solutions":false,"group_id":43,"created_at":"2016-06-29T18:38:46.000Z","updated_at":"2026-01-12T14:18:11.000Z","published_at":"2016-06-29T20:27: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\u003eWrite a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\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\u003eExamples:\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 1 0 1])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should output\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[2 1]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the longest consecutive run is 11, which starts at index 1\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 1 0 1 0 0 0 0 1 1 1])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should ouptut\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[4 5]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the longest consecutive run is 0000, which starts at index 5\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 0])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should ouptut\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[1 1]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003efirst\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e longest consecutive run is 1, which starts at index 1\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":42894,"title":"Find longest run","description":"Write a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\r\n\r\nExamples:\r\n\r\n1. |longest_run([1 1 0 1])| should output |[2 1]|,\r\nsince the longest consecutive run is 11, which starts at index 1\r\n\r\n2. |longest_run([1 1 0 1 0 0 0 0 1 1 1])| should ouptut |[4 5]|,\r\nsince the longest consecutive run is 0000, which starts at index 5\r\n\r\n3. |longest_run([1 0])| should ouptut |[1 1]|,\r\nsince the _first_ longest consecutive run is 1, which starts at index 1","description_html":"\u003cp\u003eWrite a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cp\u003e1. \u003ctt\u003elongest_run([1 1 0 1])\u003c/tt\u003e should output \u003ctt\u003e[2 1]\u003c/tt\u003e,\r\nsince the longest consecutive run is 11, which starts at index 1\u003c/p\u003e\u003cp\u003e2. \u003ctt\u003elongest_run([1 1 0 1 0 0 0 0 1 1 1])\u003c/tt\u003e should ouptut \u003ctt\u003e[4 5]\u003c/tt\u003e,\r\nsince the longest consecutive run is 0000, which starts at index 5\u003c/p\u003e\u003cp\u003e3. \u003ctt\u003elongest_run([1 0])\u003c/tt\u003e should ouptut \u003ctt\u003e[1 1]\u003c/tt\u003e,\r\nsince the \u003ci\u003efirst\u003c/i\u003e longest consecutive run is 1, which starts at index 1\u003c/p\u003e","function_template":"function [run_length, start_index] = longest_run(binary_array)\r\n%longest_run Finds longest consecutive runs of zeros or ones\r\n%   run_length is the length of the longest run of zeros or ones\r\n%   start_index is the index where the run begins\r\n\r\n    run_length = 1;\r\n    start_index = 1;\r\nend","test_suite":"%%\r\nbinary_array = [1 1 0 1];\r\nexpected_length = 2;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 1 0 1 0 0 0 0 1 1 1];\r\nexpected_length = 4;\r\nexpected_index = 5;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 0];\r\nexpected_length = 1;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1];\r\nexpected_length = 1;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));\r\n%%\r\nbinary_array = [1 1 1 1 1 1];\r\nexpected_length = 6;\r\nexpected_index = 1;\r\n[actual_length actual_index] = longest_run(binary_array);\r\nassert(isequal(expected_length, actual_length));\r\nassert(isequal(expected_index, actual_index));","published":true,"deleted":false,"likes_count":4,"comments_count":0,"created_by":26948,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":88,"test_suite_updated_at":"2016-06-29T20:27:09.000Z","rescore_all_solutions":false,"group_id":43,"created_at":"2016-06-29T18:38:46.000Z","updated_at":"2026-01-12T14:18:11.000Z","published_at":"2016-06-29T20:27: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\u003eWrite a function longest_run that takes as input an array of 0's and 1's and outputs the length and index of the longest consecutive run of either 0's or 1's. If there are multiple runs of the same length, it should output the first occurence.\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\u003eExamples:\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 1 0 1])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should output\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[2 1]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the longest consecutive run is 11, which starts at index 1\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 1 0 1 0 0 0 0 1 1 1])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should ouptut\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[4 5]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the longest consecutive run is 0000, which starts at index 5\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.\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003elongest_run([1 0])\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e should ouptut\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003e[1 1]\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e, since the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003efirst\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e longest consecutive run is 1, which starts at index 1\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:\"run\"","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:\"run\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"run\"","","\"","run","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f17e04c47e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f17e04c4740\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f17e04c3de0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f17e04c4a60\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f17e04c49c0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f17e04c4920\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f17e04c4880\u003e":"tag:\"run\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f17e04c4880\u003e":"tag:\"run\""},"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":"cody-search","password":"78X075ddcV44","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:\"run\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"run\"","","\"","run","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f17e04c47e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f17e04c4740\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f17e04c3de0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f17e04c4a60\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f17e04c49c0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f17e04c4920\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f17e04c4880\u003e":"tag:\"run\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f17e04c4880\u003e":"tag:\"run\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":42894,"difficulty_rating":"medium"}]}}