{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-16T00:12:35.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-16T00: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":44816,"title":"Word Distance - Average Sort","description":"Based on the method of \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44815-word-distance-sum this problem\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if \r\n\r\n str_arr = {'jazz','cab','tree'}\r\n\r\nthen \r\n\r\n d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]\r\n\r\nwhich would result in the following sorted order:\r\n\r\n str_arr_sort = {'cab','tree','jazz'}\r\n\r\nRemember that the method is case insensitive. See the test suite for examples.","description_html":"\u003cp\u003eBased on the method of \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44815-word-distance-sum\"\u003ethis problem\u003c/a\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if\u003c/p\u003e\u003cpre\u003e str_arr = {'jazz','cab','tree'}\u003c/pre\u003e\u003cp\u003ethen\u003c/p\u003e\u003cpre\u003e d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]\u003c/pre\u003e\u003cp\u003ewhich would result in the following sorted order:\u003c/p\u003e\u003cpre\u003e str_arr_sort = {'cab','tree','jazz'}\u003c/pre\u003e\u003cp\u003eRemember that the method is case insensitive. See the test suite for examples.\u003c/p\u003e","function_template":"function d = word_distance_sort(str_arr)\r\n d = 1;\r\nend","test_suite":"%%\r\nassert(isequal(word_distance_sort({'jazz','cab','tree'}),{'cab','tree','jazz'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'first','second','third'}),{'first','second','third'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'the','longest','words','supercede','some','of','the','shortest'}), ...\r\n\t{'some','longest','of','the','the','supercede','shortest','words'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'one','TWO','Three','FouR','fiVe','six','sEvEn','EiGHt','NINe','ten'}), ...\r\n\t{'one','TWO','EiGHt','FouR','NINe','Three','ten','fiVe','six','sEvEn'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'Why','is','it','that','this','does','not','work','as','expected'}), ...\r\n\t{'not','work','is','it','this','does','as','expected','that','Why'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'set','of','very','short','words','for','this','test','case'}), ...\r\n\t{'for','of','short','this','test','words','case','very','set'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'iron','zinc','carbon','molybdenum','praseodymium','silicon'}), ...\r\n\t{'iron','silicon','molybdenum','carbon','zinc','praseodymium'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'crazier','craziest','crazy'}), ...\r\n\t{'crazy','craziest','crazier'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'this','test','case','with','only','four','each','word'}), ...\r\n\t{'each','only','four','this','word','test','case','with'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'largest','smallest','sourest','sweetest'}), ...\r\n\t{'sourest','smallest','largest','sweetest'}))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":15,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":65,"created_at":"2019-01-02T15:43:24.000Z","updated_at":"2025-11-21T14:57:55.000Z","published_at":"2019-01-09T15:06:52.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\u003eBased on the method of\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/44815-word-distance-sum\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ethis problem\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if\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[ str_arr = {'jazz','cab','tree'}]]\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\u003ethen\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[ d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]]]\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\u003ewhich would result in the following sorted order:\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[ str_arr_sort = {'cab','tree','jazz'}]]\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\u003eRemember that the method is case insensitive. See the test suite for examples.\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":44816,"title":"Word Distance - Average Sort","description":"Based on the method of \u003chttps://www.mathworks.com/matlabcentral/cody/problems/44815-word-distance-sum this problem\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if \r\n\r\n str_arr = {'jazz','cab','tree'}\r\n\r\nthen \r\n\r\n d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]\r\n\r\nwhich would result in the following sorted order:\r\n\r\n str_arr_sort = {'cab','tree','jazz'}\r\n\r\nRemember that the method is case insensitive. See the test suite for examples.","description_html":"\u003cp\u003eBased on the method of \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/44815-word-distance-sum\"\u003ethis problem\u003c/a\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if\u003c/p\u003e\u003cpre\u003e str_arr = {'jazz','cab','tree'}\u003c/pre\u003e\u003cp\u003ethen\u003c/p\u003e\u003cpre\u003e d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]\u003c/pre\u003e\u003cp\u003ewhich would result in the following sorted order:\u003c/p\u003e\u003cpre\u003e str_arr_sort = {'cab','tree','jazz'}\u003c/pre\u003e\u003cp\u003eRemember that the method is case insensitive. See the test suite for examples.\u003c/p\u003e","function_template":"function d = word_distance_sort(str_arr)\r\n d = 1;\r\nend","test_suite":"%%\r\nassert(isequal(word_distance_sort({'jazz','cab','tree'}),{'cab','tree','jazz'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'first','second','third'}),{'first','second','third'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'the','longest','words','supercede','some','of','the','shortest'}), ...\r\n\t{'some','longest','of','the','the','supercede','shortest','words'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'one','TWO','Three','FouR','fiVe','six','sEvEn','EiGHt','NINe','ten'}), ...\r\n\t{'one','TWO','EiGHt','FouR','NINe','Three','ten','fiVe','six','sEvEn'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'Why','is','it','that','this','does','not','work','as','expected'}), ...\r\n\t{'not','work','is','it','this','does','as','expected','that','Why'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'set','of','very','short','words','for','this','test','case'}), ...\r\n\t{'for','of','short','this','test','words','case','very','set'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'iron','zinc','carbon','molybdenum','praseodymium','silicon'}), ...\r\n\t{'iron','silicon','molybdenum','carbon','zinc','praseodymium'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'crazier','craziest','crazy'}), ...\r\n\t{'crazy','craziest','crazier'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'this','test','case','with','only','four','each','word'}), ...\r\n\t{'each','only','four','this','word','test','case','with'}))\r\n\r\n%%\r\nassert(isequal(word_distance_sort({'largest','smallest','sourest','sweetest'}), ...\r\n\t{'sourest','smallest','largest','sweetest'}))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":26769,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":15,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":65,"created_at":"2019-01-02T15:43:24.000Z","updated_at":"2025-11-21T14:57:55.000Z","published_at":"2019-01-09T15:06:52.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\u003eBased on the method of\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/44815-word-distance-sum\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ethis problem\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e, write a function to calculate the letter distance for a set of words and then return the sorted set of words based on their distances, in ascending order. However, their distances will now be normalized by the number of characters in each word. For example, if\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[ str_arr = {'jazz','cab','tree'}]]\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\u003ethen\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[ d = [(9+25+0)/4, (2+1)/3, (2+13+0)/4] = [34/4, 3/3, 15/4] = [8.5, 1, 3.75]]]\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\u003ewhich would result in the following sorted order:\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[ str_arr_sort = {'cab','tree','jazz'}]]\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\u003eRemember that the method is case insensitive. See the test suite for examples.\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:\"ascending\"","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:\"ascending\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"ascending\"","","\"","ascending","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fd636a95dd0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fd636a95d30\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fd636a95470\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fd636a96050\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fd636a95fb0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fd636a95f10\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fd636a95e70\u003e":"tag:\"ascending\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fd636a95e70\u003e":"tag:\"ascending\""},"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:\"ascending\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"ascending\"","","\"","ascending","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fd636a95dd0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fd636a95d30\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fd636a95470\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fd636a96050\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fd636a95fb0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fd636a95f10\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fd636a95e70\u003e":"tag:\"ascending\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fd636a95e70\u003e":"tag:\"ascending\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44816,"difficulty_rating":"easy-medium"}]}}