{"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":45400,"title":"Fault in our Stars - 01","description":"Create a ladder pattern with n-steps and b-width.\r\n\r\nFor example,\r\n\r\n For n=2, b=5 -- the ladder would look like -\r\n \r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n","description_html":"\u003cp\u003eCreate a ladder pattern with n-steps and b-width.\u003c/p\u003e\u003cp\u003eFor example,\u003c/p\u003e\u003cpre\u003e For n=2, b=5 -- the ladder would look like -\u003c/pre\u003e\u003cpre\u003e    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\u003c/pre\u003e","function_template":"function y = ladder_mat(n,b)","test_suite":"%%\r\ny=[ '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'];\r\nassert(isequal(ladder_mat(2,5),y))\r\n\r\n%%\r\ny=[ '*             *'\r\n    '*             *'\r\n    '***************'\r\n    '*             *'\r\n    '*             *'];\r\nassert(isequal(ladder_mat(1,15),y))\r\n\r\n%%\r\ny=[ '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n];\r\nassert(isequal(ladder_mat(5,4),y))\r\n\r\n%%\r\ny=[ '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'];\r\nassert(isequal(ladder_mat(6,6),y))\r\n%%\r\ny=[ '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *']\r\nassert(isequal(ladder_mat(3,3),y))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":363598,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":19,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2020-03-30T00:55:22.000Z","updated_at":"2026-01-29T13:54:49.000Z","published_at":"2020-03-30T00:55:22.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\u003eCreate a ladder pattern with n-steps and b-width.\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\u003eFor example,\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[ For n=2, b=5 -- the ladder would look like -\\n\\n    '*   *'\\n    '*   *'\\n    '*****'\\n    '*   *'\\n    '*   *'\\n    '*****'\\n    '*   *'\\n    '*   *']]\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\"}]}"},{"id":453,"title":"resistor ladder","description":"* You have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter. \r\n* Create a ladder as follows. \r\n* Connect negative terminal of the battery to ground. \r\n* Connect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors. \r\n* Connect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\r\n* Connect the last end of the last resistor to the voltmeter and measure the reading with reference to ground. \r\n* Please give the general solution. The test suite may change.   ","description_html":"\u003cul\u003e\u003cli\u003eYou have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter.\u003c/li\u003e\u003cli\u003eCreate a ladder as follows.\u003c/li\u003e\u003cli\u003eConnect negative terminal of the battery to ground.\u003c/li\u003e\u003cli\u003eConnect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors.\u003c/li\u003e\u003cli\u003eConnect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\u003c/li\u003e\u003cli\u003eConnect the last end of the last resistor to the voltmeter and measure the reading with reference to ground.\u003c/li\u003e\u003cli\u003ePlease give the general solution. The test suite may change.\u003c/li\u003e\u003c/ul\u003e","function_template":"function reading = ladder(N,R,V)\r\n  reading=V/N/R;\r\nend","test_suite":"%%\r\nN=3; R=100; V=12;\r\nreading_correct = 6;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\nN=3; R=100; V=120;\r\nreading_correct = 60;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\nN=5; R=100; V=100;\r\nreading_correct = 20;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":166,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":34,"test_suite_updated_at":"2012-03-24T05:41:51.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-03-06T03:06:51.000Z","updated_at":"2025-05-16T15:09:44.000Z","published_at":"2012-03-06T03:10:07.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=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCreate a ladder as follows.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect negative terminal of the battery to ground.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect the last end of the last resistor to the voltmeter and measure the reading with reference to ground.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePlease give the general solution. The test suite may change.\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\"}]}"},{"id":45463,"title":"Word Ladder","description":"Given a set of words, and two other words - start and destination,\r\n\r\nFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set. \r\n\r\nAll the words are of the same length.\r\nThe starting word is not in the set but destination word would be.\r\n\r\nFor example, \r\n\r\n Start = 'COLD'\r\n Destination = 'WARM'\r\n set ={ CORD CARD DART FORT WARM FARM WARD}\r\n\r\n COLD → CORD → CARD → WARD → WARM","description_html":"\u003cp\u003eGiven a set of words, and two other words - start and destination,\u003c/p\u003e\u003cp\u003eFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set.\u003c/p\u003e\u003cp\u003eAll the words are of the same length.\r\nThe starting word is not in the set but destination word would be.\u003c/p\u003e\u003cp\u003eFor example,\u003c/p\u003e\u003cpre\u003e Start = 'COLD'\r\n Destination = 'WARM'\r\n set ={ CORD CARD DART FORT WARM FARM WARD}\u003c/pre\u003e\u003cpre\u003e COLD → CORD → CARD → WARD → WARM\u003c/pre\u003e","function_template":"function out2 = word_lad_2(ary,st,des)","test_suite":"%%\r\nary={ 'CORD', 'CARD', 'DART', 'FORT', 'WARM', 'FARM', 'WARD'}\r\nst='COLD'\r\ndes='WARM'\r\ny_correct = {'CORD','CARD','WARD','WARM'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'pan','can','fan','pat','mat','fat','lot','opt','apt','act','ape','put','aut'}\r\nst='man'\r\ndes='ape'\r\ny_correct = {'pan'\t'pat'\t'put'\t'aut'\t'apt'\t'ape'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'leg','hot','dot','dog','lot','log','cog','hog','zog','fog'}\r\nst='hit'\r\ndes='fog'\r\ny_correct = {'hot','hog','fog'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'safer', 'rifer','upper','rifre', 'rider','tider' ,'cider','coder','loder', 'cooer', 'cooey', 'gooey', 'goosy' , 'goose' ,'loose','nosey','doose'}\r\nst='refer'\r\ndes='loose'\r\ny_correct = {'rifer'\t'rider'\t'cider'\t'coder'\t'cooer'\t'cooey'\t'gooey'\t'goosy'\t'goose'\t'loose'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":4,"created_by":363598,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2020-04-16T07:12:17.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2020-04-16T07:11:43.000Z","updated_at":"2026-02-10T01:03:52.000Z","published_at":"2020-04-16T07:12:17.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 set of words, and two other words - start and destination,\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\u003eFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set.\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 the words are of the same length. The starting word is not in the set but destination word would be.\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\u003eFor example,\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[ Start = 'COLD'\\n Destination = 'WARM'\\n set ={ CORD CARD DART FORT WARM FARM WARD}\\n\\n COLD → CORD → CARD → WARD → WARM]]\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":45400,"title":"Fault in our Stars - 01","description":"Create a ladder pattern with n-steps and b-width.\r\n\r\nFor example,\r\n\r\n For n=2, b=5 -- the ladder would look like -\r\n \r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n","description_html":"\u003cp\u003eCreate a ladder pattern with n-steps and b-width.\u003c/p\u003e\u003cp\u003eFor example,\u003c/p\u003e\u003cpre\u003e For n=2, b=5 -- the ladder would look like -\u003c/pre\u003e\u003cpre\u003e    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\u003c/pre\u003e","function_template":"function y = ladder_mat(n,b)","test_suite":"%%\r\ny=[ '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'\r\n    '*****'\r\n    '*   *'\r\n    '*   *'];\r\nassert(isequal(ladder_mat(2,5),y))\r\n\r\n%%\r\ny=[ '*             *'\r\n    '*             *'\r\n    '***************'\r\n    '*             *'\r\n    '*             *'];\r\nassert(isequal(ladder_mat(1,15),y))\r\n\r\n%%\r\ny=[ '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n    '****'\r\n    '*  *'\r\n    '*  *'\r\n];\r\nassert(isequal(ladder_mat(5,4),y))\r\n\r\n%%\r\ny=[ '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'\r\n    '******'\r\n    '*    *'\r\n    '*    *'];\r\nassert(isequal(ladder_mat(6,6),y))\r\n%%\r\ny=[ '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *'\r\n    '***'\r\n    '* *'\r\n    '* *']\r\nassert(isequal(ladder_mat(3,3),y))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":363598,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":19,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2020-03-30T00:55:22.000Z","updated_at":"2026-01-29T13:54:49.000Z","published_at":"2020-03-30T00:55:22.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\u003eCreate a ladder pattern with n-steps and b-width.\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\u003eFor example,\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[ For n=2, b=5 -- the ladder would look like -\\n\\n    '*   *'\\n    '*   *'\\n    '*****'\\n    '*   *'\\n    '*   *'\\n    '*****'\\n    '*   *'\\n    '*   *']]\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\"}]}"},{"id":453,"title":"resistor ladder","description":"* You have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter. \r\n* Create a ladder as follows. \r\n* Connect negative terminal of the battery to ground. \r\n* Connect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors. \r\n* Connect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\r\n* Connect the last end of the last resistor to the voltmeter and measure the reading with reference to ground. \r\n* Please give the general solution. The test suite may change.   ","description_html":"\u003cul\u003e\u003cli\u003eYou have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter.\u003c/li\u003e\u003cli\u003eCreate a ladder as follows.\u003c/li\u003e\u003cli\u003eConnect negative terminal of the battery to ground.\u003c/li\u003e\u003cli\u003eConnect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors.\u003c/li\u003e\u003cli\u003eConnect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\u003c/li\u003e\u003cli\u003eConnect the last end of the last resistor to the voltmeter and measure the reading with reference to ground.\u003c/li\u003e\u003cli\u003ePlease give the general solution. The test suite may change.\u003c/li\u003e\u003c/ul\u003e","function_template":"function reading = ladder(N,R,V)\r\n  reading=V/N/R;\r\nend","test_suite":"%%\r\nN=3; R=100; V=12;\r\nreading_correct = 6;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\nN=3; R=100; V=120;\r\nreading_correct = 60;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\nN=5; R=100; V=100;\r\nreading_correct = 20;\r\nreading = ladder(N,R,V);\r\nassert(abs(reading-reading_correct)\u003c1000*eps)\r\n%%\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":166,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":34,"test_suite_updated_at":"2012-03-24T05:41:51.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-03-06T03:06:51.000Z","updated_at":"2025-05-16T15:09:44.000Z","published_at":"2012-03-06T03:10:07.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=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou have a bunch (an odd number N) of identical resistors (each R ohms), a good battery (V volts), and a high impedance voltmeter.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCreate a ladder as follows.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect negative terminal of the battery to ground.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect positive terminal of the battery to one resistor. Connect other end of this resistor to two resistors.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect other end of the second resistor to ground. Connect other end of the third resistor to two resistors and keep building similarly as long as possible.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConnect the last end of the last resistor to the voltmeter and measure the reading with reference to ground.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ePlease give the general solution. The test suite may change.\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\"}]}"},{"id":45463,"title":"Word Ladder","description":"Given a set of words, and two other words - start and destination,\r\n\r\nFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set. \r\n\r\nAll the words are of the same length.\r\nThe starting word is not in the set but destination word would be.\r\n\r\nFor example, \r\n\r\n Start = 'COLD'\r\n Destination = 'WARM'\r\n set ={ CORD CARD DART FORT WARM FARM WARD}\r\n\r\n COLD → CORD → CARD → WARD → WARM","description_html":"\u003cp\u003eGiven a set of words, and two other words - start and destination,\u003c/p\u003e\u003cp\u003eFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set.\u003c/p\u003e\u003cp\u003eAll the words are of the same length.\r\nThe starting word is not in the set but destination word would be.\u003c/p\u003e\u003cp\u003eFor example,\u003c/p\u003e\u003cpre\u003e Start = 'COLD'\r\n Destination = 'WARM'\r\n set ={ CORD CARD DART FORT WARM FARM WARD}\u003c/pre\u003e\u003cpre\u003e COLD → CORD → CARD → WARD → WARM\u003c/pre\u003e","function_template":"function out2 = word_lad_2(ary,st,des)","test_suite":"%%\r\nary={ 'CORD', 'CARD', 'DART', 'FORT', 'WARM', 'FARM', 'WARD'}\r\nst='COLD'\r\ndes='WARM'\r\ny_correct = {'CORD','CARD','WARD','WARM'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'pan','can','fan','pat','mat','fat','lot','opt','apt','act','ape','put','aut'}\r\nst='man'\r\ndes='ape'\r\ny_correct = {'pan'\t'pat'\t'put'\t'aut'\t'apt'\t'ape'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'leg','hot','dot','dog','lot','log','cog','hog','zog','fog'}\r\nst='hit'\r\ndes='fog'\r\ny_correct = {'hot','hog','fog'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n%%\r\nary={'safer', 'rifer','upper','rifre', 'rider','tider' ,'cider','coder','loder', 'cooer', 'cooey', 'gooey', 'goosy' , 'goose' ,'loose','nosey','doose'}\r\nst='refer'\r\ndes='loose'\r\ny_correct = {'rifer'\t'rider'\t'cider'\t'coder'\t'cooer'\t'cooey'\t'gooey'\t'goosy'\t'goose'\t'loose'};\r\nassert(isequal(word_lad_2(ary,st,des),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":4,"created_by":363598,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2020-04-16T07:12:17.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2020-04-16T07:11:43.000Z","updated_at":"2026-02-10T01:03:52.000Z","published_at":"2020-04-16T07:12:17.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 set of words, and two other words - start and destination,\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\u003eFind the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set.\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 the words are of the same length. The starting word is not in the set but destination word would be.\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\u003eFor example,\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[ Start = 'COLD'\\n Destination = 'WARM'\\n set ={ CORD CARD DART FORT WARM FARM WARD}\\n\\n COLD → CORD → CARD → WARD → WARM]]\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:\"ladder\"","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:\"ladder\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"ladder\"","","\"","ladder","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f73612b5648\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f73612b55a8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f73612b4ce8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f73612b58c8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f73612b5828\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f73612b5788\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f73612b56e8\u003e":"tag:\"ladder\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f73612b56e8\u003e":"tag:\"ladder\""},"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:\"ladder\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"ladder\"","","\"","ladder","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f73612b5648\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f73612b55a8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f73612b4ce8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f73612b58c8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f73612b5828\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f73612b5788\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f73612b56e8\u003e":"tag:\"ladder\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f73612b56e8\u003e":"tag:\"ladder\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":45400,"difficulty_rating":"easy-medium"},{"id":453,"difficulty_rating":"easy-medium"},{"id":45463,"difficulty_rating":"medium"}]}}