{"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":1249,"title":"first step for Huffman Coding (easy)","description":"Given a string, you must sort the characters by occurrence (from lowest to highest).\r\n\r\nThis step is necessary to generate a Huffman tree. ( \u003chttp://en.wikipedia.org/wiki/Huffman_coding\u003e )\r\n\r\nAll characters must be taken into account. Capitals are not taken into account.\r\n\r\nIf two characters appear the same number of times, the order does not matter.\r\n\r\n\r\nYou will return two arrays:\r\n\r\nthe first comprising the characters sorted.\r\nthe second comprising the number of occurrence of characters of the first array.\r\n\r\n\r\n\r\nExample : \r\n\r\ninput : \r\n\r\n    input = 'aAabbC';\r\n\r\noutput : \r\n\r\n_characters :_ \r\n\r\n  cha =\r\n  \r\n  c\r\n  b\r\n  a\r\n  \r\n\r\n_occurence :_\r\n\r\n  occ =\r\n  \r\n       1\r\n       2\r\n       3\r\n","description_html":"\u003cp\u003eGiven a string, you must sort the characters by occurrence (from lowest to highest).\u003c/p\u003e\u003cp\u003eThis step is necessary to generate a Huffman tree. ( \u003ca href=\"http://en.wikipedia.org/wiki/Huffman_coding\"\u003ehttp://en.wikipedia.org/wiki/Huffman_coding\u003c/a\u003e )\u003c/p\u003e\u003cp\u003eAll characters must be taken into account. Capitals are not taken into account.\u003c/p\u003e\u003cp\u003eIf two characters appear the same number of times, the order does not matter.\u003c/p\u003e\u003cp\u003eYou will return two arrays:\u003c/p\u003e\u003cp\u003ethe first comprising the characters sorted.\r\nthe second comprising the number of occurrence of characters of the first array.\u003c/p\u003e\u003cp\u003eExample :\u003c/p\u003e\u003cp\u003einput :\u003c/p\u003e\u003cpre\u003e    input = 'aAabbC';\u003c/pre\u003e\u003cp\u003eoutput :\u003c/p\u003e\u003cp\u003e\u003ci\u003echaracters :\u003c/i\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003echa =\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ec\r\nb\r\na\r\n\u003c/pre\u003e\u003cp\u003e\u003ci\u003eoccurence :\u003c/i\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eocc =\r\n\u003c/pre\u003e\u003cpre\u003e       1\r\n       2\r\n       3\u003c/pre\u003e","function_template":"function [cha occ] = sortHuffman(input)\r\n\r\n  cha=input;\r\n  occ = 0;\r\n\r\nend","test_suite":"%%\r\ninput = 'CoDy';\r\n[cha occ] = sortHuffman(input);\r\ncha_control = ['c';'d';'o';'y'];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));\r\n\r\n\r\n%%\r\ninput = 'abcd abc ab a';\r\n[cha occ] = sortHuffman(input);\r\ncha_control = ['d';'c';' ';'b';'a'];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));\r\n\r\n\r\n%%\r\ninput = 'La regression PLS (Partial Least Squares regression) est une technique d analyse et de prediction relativement recente. Elle a ete concue pour faire face aux problemes resultants de l insuffisance de l utilisation de la regression lineaire classique, qui trouve ses limites des lors que l on cherche a modeliser des relations entre des variables pour lesquelles il y a peu d individus, ou beaucoup de variables explicatives en comparaison au nombre d individus (le nombre de variables explicatives pouvant exceder tres largement le nombre d individus), ou encore lorsque les variables explicatives sont fortement correlees entre elles.';\r\n\r\n[cha occ] = sortHuffman(input);\r\n\r\ncha_control =['(';')';'.';'y';',';'h';'g';'f';'x';'q';'b';'m';'p';'v';'c';'d';'u';'o';'t';'n';'a';'l';'r';'i';'s';'e';' '];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8073,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":41,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-02-05T14:26:46.000Z","updated_at":"2026-03-16T13:53:37.000Z","published_at":"2013-02-05T14:26:46.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 string, you must sort the characters by occurrence (from lowest to highest).\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\u003eThis step is necessary to generate a Huffman tree. (\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=\\\"http://en.wikipedia.org/wiki/Huffman_coding\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://en.wikipedia.org/wiki/Huffman_coding\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\u003eAll characters must be taken into account. Capitals are not taken into account.\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\u003eIf two characters appear the same number of times, the order does not matter.\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 will return two arrays:\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 first comprising the characters sorted. the second comprising the number of occurrence of characters of the first array.\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=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput :\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[    input = 'aAabbC';]]\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\u003eoutput :\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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003echaracters :\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[cha =\\n\\nc\\nb\\na]]\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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eoccurence :\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[occ =\\n\\n       1\\n       2\\n       3]]\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":1249,"title":"first step for Huffman Coding (easy)","description":"Given a string, you must sort the characters by occurrence (from lowest to highest).\r\n\r\nThis step is necessary to generate a Huffman tree. ( \u003chttp://en.wikipedia.org/wiki/Huffman_coding\u003e )\r\n\r\nAll characters must be taken into account. Capitals are not taken into account.\r\n\r\nIf two characters appear the same number of times, the order does not matter.\r\n\r\n\r\nYou will return two arrays:\r\n\r\nthe first comprising the characters sorted.\r\nthe second comprising the number of occurrence of characters of the first array.\r\n\r\n\r\n\r\nExample : \r\n\r\ninput : \r\n\r\n    input = 'aAabbC';\r\n\r\noutput : \r\n\r\n_characters :_ \r\n\r\n  cha =\r\n  \r\n  c\r\n  b\r\n  a\r\n  \r\n\r\n_occurence :_\r\n\r\n  occ =\r\n  \r\n       1\r\n       2\r\n       3\r\n","description_html":"\u003cp\u003eGiven a string, you must sort the characters by occurrence (from lowest to highest).\u003c/p\u003e\u003cp\u003eThis step is necessary to generate a Huffman tree. ( \u003ca href=\"http://en.wikipedia.org/wiki/Huffman_coding\"\u003ehttp://en.wikipedia.org/wiki/Huffman_coding\u003c/a\u003e )\u003c/p\u003e\u003cp\u003eAll characters must be taken into account. Capitals are not taken into account.\u003c/p\u003e\u003cp\u003eIf two characters appear the same number of times, the order does not matter.\u003c/p\u003e\u003cp\u003eYou will return two arrays:\u003c/p\u003e\u003cp\u003ethe first comprising the characters sorted.\r\nthe second comprising the number of occurrence of characters of the first array.\u003c/p\u003e\u003cp\u003eExample :\u003c/p\u003e\u003cp\u003einput :\u003c/p\u003e\u003cpre\u003e    input = 'aAabbC';\u003c/pre\u003e\u003cp\u003eoutput :\u003c/p\u003e\u003cp\u003e\u003ci\u003echaracters :\u003c/i\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003echa =\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003ec\r\nb\r\na\r\n\u003c/pre\u003e\u003cp\u003e\u003ci\u003eoccurence :\u003c/i\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eocc =\r\n\u003c/pre\u003e\u003cpre\u003e       1\r\n       2\r\n       3\u003c/pre\u003e","function_template":"function [cha occ] = sortHuffman(input)\r\n\r\n  cha=input;\r\n  occ = 0;\r\n\r\nend","test_suite":"%%\r\ninput = 'CoDy';\r\n[cha occ] = sortHuffman(input);\r\ncha_control = ['c';'d';'o';'y'];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));\r\n\r\n\r\n%%\r\ninput = 'abcd abc ab a';\r\n[cha occ] = sortHuffman(input);\r\ncha_control = ['d';'c';' ';'b';'a'];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));\r\n\r\n\r\n%%\r\ninput = 'La regression PLS (Partial Least Squares regression) est une technique d analyse et de prediction relativement recente. Elle a ete concue pour faire face aux problemes resultants de l insuffisance de l utilisation de la regression lineaire classique, qui trouve ses limites des lors que l on cherche a modeliser des relations entre des variables pour lesquelles il y a peu d individus, ou beaucoup de variables explicatives en comparaison au nombre d individus (le nombre de variables explicatives pouvant exceder tres largement le nombre d individus), ou encore lorsque les variables explicatives sont fortement correlees entre elles.';\r\n\r\n[cha occ] = sortHuffman(input);\r\n\r\ncha_control =['(';')';'.';'y';',';'h';'g';'f';'x';'q';'b';'m';'p';'v';'c';'d';'u';'o';'t';'n';'a';'l';'r';'i';'s';'e';' '];\r\n\r\nassert(isequal(size(cha),size(cha_control)));\r\nassert(isequal(sum(lower(input)),sum(occ.*(cha+0))));\r\nassert(all(sort(occ)==occ));","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":8073,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":41,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-02-05T14:26:46.000Z","updated_at":"2026-03-16T13:53:37.000Z","published_at":"2013-02-05T14:26:46.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 string, you must sort the characters by occurrence (from lowest to highest).\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\u003eThis step is necessary to generate a Huffman tree. (\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=\\\"http://en.wikipedia.org/wiki/Huffman_coding\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://en.wikipedia.org/wiki/Huffman_coding\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\u003eAll characters must be taken into account. Capitals are not taken into account.\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\u003eIf two characters appear the same number of times, the order does not matter.\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 will return two arrays:\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 first comprising the characters sorted. the second comprising the number of occurrence of characters of the first array.\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=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003einput :\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[    input = 'aAabbC';]]\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\u003eoutput :\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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003echaracters :\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[cha =\\n\\nc\\nb\\na]]\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:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eoccurence :\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[occ =\\n\\n       1\\n       2\\n       3]]\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:\"huffman\"","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:\"huffman\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"huffman\"","","\"","huffman","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b97e8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac1e2b9748\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b8e88\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b9a68\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac1e2b99c8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac1e2b9928\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac1e2b9888\u003e":"tag:\"huffman\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b9888\u003e":"tag:\"huffman\""},"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:\"huffman\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"huffman\"","","\"","huffman","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b97e8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac1e2b9748\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b8e88\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b9a68\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac1e2b99c8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac1e2b9928\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac1e2b9888\u003e":"tag:\"huffman\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac1e2b9888\u003e":"tag:\"huffman\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1249,"difficulty_rating":"easy-medium"}]}}