{"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":51793,"title":"List the titles of Cody problems","description":"Cody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \r\nWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 135px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 408px 67.5px; transform-origin: 408px 67.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 84px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 385px 42px; text-align: left; transform-origin: 385px 42px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 379.608px 8px; transform-origin: 379.608px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eCody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 385px 21px; text-align: left; transform-origin: 385px 21px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 385px 8px; transform-origin: 385px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = CPtitle(n)\r\n  y = isCodyProblem(n);\r\nend","test_suite":"%%\r\nn = 60;\r\ny = CPtitle(n);\r\ny_correct = {'The Goldbach Conjecture'};\r\nassert(isequal(y,y_correct))\r\n\r\n%% \r\nn = 97;\r\ny = CPtitle(n);\r\nassert(isempty(y{1}))\r\n\r\n%%\r\nn = [1319 1515];\r\ny = CPtitle(n);\r\ny_correct = {'Leap years on other planets', 'Procrustean bed'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45193 45196];\r\ny = CPtitle(n);\r\ny_correct = {'Fun with permutations', 'Determine whether a given point is inside or outside a polygon'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45180 46898 47864];\r\ny = CPtitle(n);\r\ny_correct = {'All flights lead to Idaho Falls', 'Sum of all the divisors of n', 'Calculate the Surface Area of an Ellipsoid'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [44341 47673 47803];\r\ny = CPtitle(n);\r\ny_correct = {'Hexagonal numbers on a spiral matrix', 'Area under standard normal curve', 'Check if the input is a strong prime'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [42383 42415];\r\ny = CPtitle(n);\r\ny_correct = {['Combined Ages 3 - Non-symmetric, n ' char(8805) ' 3'], 'Divisible by 13'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [1215 2869];\r\ny = CPtitle(n);\r\ny_correct = {'Diophantine Equations (Inspired by Project Euler, problem 66)', 'There are 10 types of people in the world'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [44067 44068 44071];\r\ny = CPtitle(n);\r\ny_correct = {'The last non-zero digit of a factorial', 'The number of trailing zero digit of a factorial', 'Smallest n, for n! to have m trailing zero digits'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45272 45302 45339];\r\ny = CPtitle(n);\r\ny_correct = {'Pseudo-vampire number ', 'Ugly numbers - 03', 'XOR fibonacci'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 46072;\r\ny = CPtitle(n);\r\ny_correct = {'Rock Paper Scissors Lizard Spock'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [51630 51640];\r\ny = CPtitle(n);\r\ny_correct = {'Highest building', 'Similar triangles'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 1012:1015;\r\ny = CPtitle(n);\r\ny_correct = {'Determine if input is a perfect number', [], [], 'Polynomial Interpolation'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 42240:42250;\r\ny = CPtitle(n(randi(11,1,2)));\r\nassert(all(arrayfun(@(k) isempty(y{k}),1:2)))\r\n\r\n%%\r\nn = 8047+randi(8);\r\ny1 = CPtitle(n);\r\ns = y1{1};\r\nc = split(CPtitle(sum(double(s(1:13)))));\r\nassert(isequal(c{4},'Awesome'))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":1,"created_by":46909,"edited_by":46909,"edited_at":"2025-07-16T16:53:28.000Z","deleted_by":null,"deleted_at":null,"solvers_count":7,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2021-05-18T05:40:12.000Z","updated_at":"2025-07-16T16:53:28.000Z","published_at":"2021-05-18T05:44:30.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \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\u003eWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":51793,"title":"List the titles of Cody problems","description":"Cody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \r\nWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 135px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 408px 67.5px; transform-origin: 408px 67.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 84px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 385px 42px; text-align: left; transform-origin: 385px 42px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 379.608px 8px; transform-origin: 379.608px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eCody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 385px 21px; text-align: left; transform-origin: 385px 21px; white-space-collapse: preserve; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 385px 8px; transform-origin: 385px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = CPtitle(n)\r\n  y = isCodyProblem(n);\r\nend","test_suite":"%%\r\nn = 60;\r\ny = CPtitle(n);\r\ny_correct = {'The Goldbach Conjecture'};\r\nassert(isequal(y,y_correct))\r\n\r\n%% \r\nn = 97;\r\ny = CPtitle(n);\r\nassert(isempty(y{1}))\r\n\r\n%%\r\nn = [1319 1515];\r\ny = CPtitle(n);\r\ny_correct = {'Leap years on other planets', 'Procrustean bed'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45193 45196];\r\ny = CPtitle(n);\r\ny_correct = {'Fun with permutations', 'Determine whether a given point is inside or outside a polygon'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45180 46898 47864];\r\ny = CPtitle(n);\r\ny_correct = {'All flights lead to Idaho Falls', 'Sum of all the divisors of n', 'Calculate the Surface Area of an Ellipsoid'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [44341 47673 47803];\r\ny = CPtitle(n);\r\ny_correct = {'Hexagonal numbers on a spiral matrix', 'Area under standard normal curve', 'Check if the input is a strong prime'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [42383 42415];\r\ny = CPtitle(n);\r\ny_correct = {['Combined Ages 3 - Non-symmetric, n ' char(8805) ' 3'], 'Divisible by 13'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [1215 2869];\r\ny = CPtitle(n);\r\ny_correct = {'Diophantine Equations (Inspired by Project Euler, problem 66)', 'There are 10 types of people in the world'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [44067 44068 44071];\r\ny = CPtitle(n);\r\ny_correct = {'The last non-zero digit of a factorial', 'The number of trailing zero digit of a factorial', 'Smallest n, for n! to have m trailing zero digits'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [45272 45302 45339];\r\ny = CPtitle(n);\r\ny_correct = {'Pseudo-vampire number ', 'Ugly numbers - 03', 'XOR fibonacci'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 46072;\r\ny = CPtitle(n);\r\ny_correct = {'Rock Paper Scissors Lizard Spock'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = [51630 51640];\r\ny = CPtitle(n);\r\ny_correct = {'Highest building', 'Similar triangles'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 1012:1015;\r\ny = CPtitle(n);\r\ny_correct = {'Determine if input is a perfect number', [], [], 'Polynomial Interpolation'};\r\nassert(isequal(y,y_correct))\r\n\r\n%%\r\nn = 42240:42250;\r\ny = CPtitle(n(randi(11,1,2)));\r\nassert(all(arrayfun(@(k) isempty(y{k}),1:2)))\r\n\r\n%%\r\nn = 8047+randi(8);\r\ny1 = CPtitle(n);\r\ns = y1{1};\r\nc = split(CPtitle(sum(double(s(1:13)))));\r\nassert(isequal(c{4},'Awesome'))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":1,"created_by":46909,"edited_by":46909,"edited_at":"2025-07-16T16:53:28.000Z","deleted_by":null,"deleted_at":null,"solvers_count":7,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2021-05-18T05:40:12.000Z","updated_at":"2025-07-16T16:53:28.000Z","published_at":"2021-05-18T05:44:30.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eCody has several ways to list problems, but I have not yet found an easy way to list them by their numbers. Listing by date created is close, but if someone starts a problem one day and finishes it much later, the numbers will be out of order. Even when the numbers are in order, finding a particular number can take some scrolling. One can type a URL with the problem number, but waiting for the page to load and being redirected to the main problems page gets cumbersome. \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\u003eWrite a function that takes a number or vector of numbers as input and returns a cell array of the titles of the problems. If the problem does not exist, return an empty vector in place of the title. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"read\"","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:\"read\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"read\"","","\"","read","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0a10\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0970\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f24b8d0f0a0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0dd0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0d30\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0c90\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f24b8cf0b50\u003e":"tag:\"read\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0b50\u003e":"tag:\"read\""},"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:\"read\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"read\"","","\"","read","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0a10\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0970\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f24b8d0f0a0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0dd0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0d30\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f24b8cf0c90\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f24b8cf0b50\u003e":"tag:\"read\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f24b8cf0b50\u003e":"tag:\"read\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":51793,"difficulty_rating":"medium"}]}}