{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-06T00:09: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-05-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":1892,"title":"LIFO Validation","description":"Write a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\r\n\r\nWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory.  Write a function that determines whether LIFO restrictions were obeyed or not.  \r\n\r\nIn the input data you will be guaranteed that In(i)\u003cOut(i) for all i, but multiple items may enter or leave inventory at the same time.\r\n\r\nFor example:\r\n\r\nIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\r\n\r\nIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\r\n\r\nIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.","description_html":"\u003cp\u003eWrite a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\u003c/p\u003e\u003cp\u003eWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory.  Write a function that determines whether LIFO restrictions were obeyed or not.\u003c/p\u003e\u003cp\u003eIn the input data you will be guaranteed that In(i)\u0026lt;Out(i) for all i, but multiple items may enter or leave inventory at the same time.\u003c/p\u003e\u003cp\u003eFor example:\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.\u003c/p\u003e","function_template":"function [ TF ] = isLIFO( In, Out)\r\n\r\n  TF=true;\r\n\r\nend\r\n","test_suite":"1\r\n%%\r\nassert(isequal(true,isLIFO([1;2],[4;3])));\r\n2\r\n%%\r\nassert(isequal(false,isLIFO([1;2],[3;4])));\r\n3\r\n%%\r\nfor i=1:100\r\n    In = randi(20,100,1);\r\n    Out = randi(20,100,1);\r\n    valid = In\u003cOut;\r\n    In=In(valid);\r\n    Out=Out(valid);\r\n    TF=true;\r\n    for k=1:numel(In)-1\r\n        for l=k+1:numel(In)\r\n            if (In(k)\u003cIn(l)) \u0026\u0026 (Out(k) \u003c Out(l))\r\n                TF = false;\r\n            end\r\n        end\r\n    end\r\n    assert(isequal(TF,isLIFO(In,Out)));\r\nend\r\n4\r\n%%\r\nassert(isequal(true,isLIFO([1;2],[3;3])));\r\n5\r\n%%\r\nassert(isequal(true,isLIFO([2;2],[4;3])));\r\n6\r\n%%\r\nassert(isequal(true,isLIFO([2;2],[7;6])));\r\n7\r\n%%\r\nassert(isequal(false,isLIFO([2;1],[4;3])));","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":4567,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":14,"test_suite_updated_at":"2014-12-20T01:05:51.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2013-09-25T22:55:35.000Z","updated_at":"2025-06-08T10:22:38.000Z","published_at":"2013-09-25T22:55:35.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\u003eWrite a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\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\u003eWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory. Write a function that determines whether LIFO restrictions were obeyed or not.\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\u003eIn the input data you will be guaranteed that In(i)\u0026lt;Out(i) for all i, but multiple items may enter or leave inventory at the same time.\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\u003eFor example:\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\u003eIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\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\u003eIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\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\u003eIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.\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":1892,"title":"LIFO Validation","description":"Write a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\r\n\r\nWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory.  Write a function that determines whether LIFO restrictions were obeyed or not.  \r\n\r\nIn the input data you will be guaranteed that In(i)\u003cOut(i) for all i, but multiple items may enter or leave inventory at the same time.\r\n\r\nFor example:\r\n\r\nIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\r\n\r\nIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\r\n\r\nIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.","description_html":"\u003cp\u003eWrite a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\u003c/p\u003e\u003cp\u003eWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory.  Write a function that determines whether LIFO restrictions were obeyed or not.\u003c/p\u003e\u003cp\u003eIn the input data you will be guaranteed that In(i)\u0026lt;Out(i) for all i, but multiple items may enter or leave inventory at the same time.\u003c/p\u003e\u003cp\u003eFor example:\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\u003c/p\u003e\u003cp\u003eIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.\u003c/p\u003e","function_template":"function [ TF ] = isLIFO( In, Out)\r\n\r\n  TF=true;\r\n\r\nend\r\n","test_suite":"1\r\n%%\r\nassert(isequal(true,isLIFO([1;2],[4;3])));\r\n2\r\n%%\r\nassert(isequal(false,isLIFO([1;2],[3;4])));\r\n3\r\n%%\r\nfor i=1:100\r\n    In = randi(20,100,1);\r\n    Out = randi(20,100,1);\r\n    valid = In\u003cOut;\r\n    In=In(valid);\r\n    Out=Out(valid);\r\n    TF=true;\r\n    for k=1:numel(In)-1\r\n        for l=k+1:numel(In)\r\n            if (In(k)\u003cIn(l)) \u0026\u0026 (Out(k) \u003c Out(l))\r\n                TF = false;\r\n            end\r\n        end\r\n    end\r\n    assert(isequal(TF,isLIFO(In,Out)));\r\nend\r\n4\r\n%%\r\nassert(isequal(true,isLIFO([1;2],[3;3])));\r\n5\r\n%%\r\nassert(isequal(true,isLIFO([2;2],[4;3])));\r\n6\r\n%%\r\nassert(isequal(true,isLIFO([2;2],[7;6])));\r\n7\r\n%%\r\nassert(isequal(false,isLIFO([2;1],[4;3])));","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":4567,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":14,"test_suite_updated_at":"2014-12-20T01:05:51.000Z","rescore_all_solutions":true,"group_id":1,"created_at":"2013-09-25T22:55:35.000Z","updated_at":"2025-06-08T10:22:38.000Z","published_at":"2013-09-25T22:55:35.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\u003eWrite a function to check whether a LIFO (Last In First Out) restriction on inventory is violated.\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\u003eWe have two input vectors In and Out, such that In(i) represents the time at which item i entered inventory and Out(i) represents the time at which item i left inventory. Write a function that determines whether LIFO restrictions were obeyed or not.\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\u003eIn the input data you will be guaranteed that In(i)\u0026lt;Out(i) for all i, but multiple items may enter or leave inventory at the same time.\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\u003eFor example:\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\u003eIn = [1;2] , Out = [3;4] violates LIFO because item 1 enters inventory first and also leaves first.\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\u003eIn = [1;2] , Out = [4;3] does not violate LIFO because item 1 enters inventory first and leaves last.\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\u003eIn = [1;2] , Out = [3;3] does not violate LIFO because the items leave at the same time.\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:\"lifo\"","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:\"lifo\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"lifo\"","","\"","lifo","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f433faebe18\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f433faebd78\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f433faeabf8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f433faec6d8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f433faec318\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f433faebf58\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f433faebeb8\u003e":"tag:\"lifo\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f433faebeb8\u003e":"tag:\"lifo\""},"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:\"lifo\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"lifo\"","","\"","lifo","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f433faebe18\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f433faebd78\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f433faeabf8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f433faec6d8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f433faec318\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f433faebf58\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f433faebeb8\u003e":"tag:\"lifo\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f433faebeb8\u003e":"tag:\"lifo\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1892,"difficulty_rating":"easy-medium"}]}}