{"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":42803,"title":"Britney unfolded","description":"You have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\r\n\r\nYou then unfold the strip of paper and count how many fold marks it bears.\r\n\r\nGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f.\r\nNote that strips of paper only come in integer lengths.\r\n\r\nAssume t and L are given in the same units.\r\n\r\nExample:\r\n\r\nn = 3\r\n\r\nt = 0.15\r\n\r\nL = 7\r\n\r\nf = 7","description_html":"\u003cp\u003eYou have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\u003c/p\u003e\u003cp\u003eYou then unfold the strip of paper and count how many fold marks it bears.\u003c/p\u003e\u003cp\u003eGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f.\r\nNote that strips of paper only come in integer lengths.\u003c/p\u003e\u003cp\u003eAssume t and L are given in the same units.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003en = 3\u003c/p\u003e\u003cp\u003et = 0.15\u003c/p\u003e\u003cp\u003eL = 7\u003c/p\u003e\u003cp\u003ef = 7\u003c/p\u003e","function_template":"function [L,f] = Britney_Unfolded(n,t)\r\n  [L,f] = size(n*t);\r\nend","test_suite":"%%\r\nn = 3;\r\nt = 0.15;\r\nL_correct = 7;\r\nf_correct = 7;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 6;\r\nt = 0.02;\r\nL_correct = 45;\r\nf_correct = 63;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 7;\r\nt = 0.05;\r\nL_correct = 439;\r\nf_correct = 127;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 10;\r\nt = 0.29;\r\nL_correct = 159686;\r\nf_correct = 1023;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n\r\n%%\r\nn = 12;\r\nt = 0.06;\r\nL_correct = 527458;\r\nf_correct = 4095;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))","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":15,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-04-16T19:56:02.000Z","updated_at":"2019-01-19T09:02:33.000Z","published_at":"2016-04-16T19:56:16.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\u003eYou have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou then unfold the strip of paper and count how many fold marks it bears.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f. Note that strips of paper only come in integer lengths.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAssume t and L are given in the same units.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003en = 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003et = 0.15\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eL = 7\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ef = 7\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":42803,"title":"Britney unfolded","description":"You have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\r\n\r\nYou then unfold the strip of paper and count how many fold marks it bears.\r\n\r\nGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f.\r\nNote that strips of paper only come in integer lengths.\r\n\r\nAssume t and L are given in the same units.\r\n\r\nExample:\r\n\r\nn = 3\r\n\r\nt = 0.15\r\n\r\nL = 7\r\n\r\nf = 7","description_html":"\u003cp\u003eYou have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\u003c/p\u003e\u003cp\u003eYou then unfold the strip of paper and count how many fold marks it bears.\u003c/p\u003e\u003cp\u003eGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f.\r\nNote that strips of paper only come in integer lengths.\u003c/p\u003e\u003cp\u003eAssume t and L are given in the same units.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003en = 3\u003c/p\u003e\u003cp\u003et = 0.15\u003c/p\u003e\u003cp\u003eL = 7\u003c/p\u003e\u003cp\u003ef = 7\u003c/p\u003e","function_template":"function [L,f] = Britney_Unfolded(n,t)\r\n  [L,f] = size(n*t);\r\nend","test_suite":"%%\r\nn = 3;\r\nt = 0.15;\r\nL_correct = 7;\r\nf_correct = 7;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 6;\r\nt = 0.02;\r\nL_correct = 45;\r\nf_correct = 63;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 7;\r\nt = 0.05;\r\nL_correct = 439;\r\nf_correct = 127;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n%%\r\nn = 10;\r\nt = 0.29;\r\nL_correct = 159686;\r\nf_correct = 1023;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))\r\n\r\n\r\n%%\r\nn = 12;\r\nt = 0.06;\r\nL_correct = 527458;\r\nf_correct = 4095;\r\n[L,f] = Britney_Unfolded(n,t)\r\nassert(isequal([L,f],[L_correct,f_correct]))","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":15,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2016-04-16T19:56:02.000Z","updated_at":"2019-01-19T09:02:33.000Z","published_at":"2016-04-16T19:56:16.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\u003eYou have a long, narrow strip of paper. You are going to fold this strip of paper length-wise in half, than fold the folded strip length-wise in half again, and repeat this process until it is no longer possible to do so.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou then unfold the strip of paper and count how many fold marks it bears.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the number of folds, n, and the thickness of the paper, t, return the minimum length, L, the strip of paper must be to accommodate n folds, as well as the number of fold marks, f. Note that strips of paper only come in integer lengths.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAssume t and L are given in the same units.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003en = 3\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003et = 0.15\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eL = 7\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ef = 7\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:\"google it\"","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:\"google it\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"google it\"","","\"","google it","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8538\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8498\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc7bd8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc87b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8718\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8678\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6cb0dc85d8\u003e":"tag:\"google it\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc85d8\u003e":"tag:\"google it\""},"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:\"google it\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"google it\"","","\"","google it","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8538\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8498\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc7bd8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc87b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8718\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f6cb0dc8678\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f6cb0dc85d8\u003e":"tag:\"google it\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f6cb0dc85d8\u003e":"tag:\"google it\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":42803,"difficulty_rating":"easy-medium"}]}}