{"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":44350,"title":"Breaking Out of the Matrix","description":"Do you want to take the Red Pill, or the Blue Pill?\r\n\r\nIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\r\n\r\nIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows.  Increment only one column (or one row) at a time.  Do not go C columns down at each step.\r\n\r\nFor example, R=2 and C=3, and M is as follows:\r\n\r\n M=[1 4 7 10\r\n    2 5 8 11\r\n    3 6 9 12]\r\n\r\nThis means that your output should be a 2x3x4 matrix:\r\n\r\n X(:,:,1) =\r\n     1     4     7\r\n     2     5     8\r\n X(:,:,2) =\r\n     2     5     8\r\n     3     6     9\r\n X(:,:,3) =\r\n     4     7    10\r\n     5     8    11\r\n X(:,:,4) =\r\n     5     8    11\r\n     6     9    12\r\n\r\nYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\r\n","description_html":"\u003cp\u003eDo you want to take the Red Pill, or the Blue Pill?\u003c/p\u003e\u003cp\u003eIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\u003c/p\u003e\u003cp\u003eIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows.  Increment only one column (or one row) at a time.  Do not go C columns down at each step.\u003c/p\u003e\u003cp\u003eFor example, R=2 and C=3, and M is as follows:\u003c/p\u003e\u003cpre\u003e M=[1 4 7 10\r\n    2 5 8 11\r\n    3 6 9 12]\u003c/pre\u003e\u003cp\u003eThis means that your output should be a 2x3x4 matrix:\u003c/p\u003e\u003cpre\u003e X(:,:,1) =\r\n     1     4     7\r\n     2     5     8\r\n X(:,:,2) =\r\n     2     5     8\r\n     3     6     9\r\n X(:,:,3) =\r\n     4     7    10\r\n     5     8    11\r\n X(:,:,4) =\r\n     5     8    11\r\n     6     9    12\u003c/pre\u003e\u003cp\u003eYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\u003c/p\u003e","function_template":"function y = BreakTheMatrix(M,R,C)\r\n  y = x;\r\nend","test_suite":"%%\r\nM=[1 4 7 10;\r\n2 5 8 11;\r\n3 6 9 12];\r\nR=2;C=3;\r\nX(:,:,1) =[1 4 7 ; 2 5 8];\r\nX(:,:,2) =[2 5 8 ; 3 6 9];\r\nX(:,:,3) =[4 7 10 ; 5 8 11];\r\nX(:,:,4) =[5 8 11 ; 6 9 12];\r\nassert(isequal(BreakTheMatrix(M,R,C),X))\r\n%%\r\nx=1:ceil(35+25*rand());r=1;c=1;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(all(arrayfun(@(y) (M(:,:,y)==y),1:numel(x))))\r\n%%\r\nx=eye(7);r=2;c=2;\r\nM=BreakTheMatrix(x,r,c);\r\nids=[1 8 15 22 29 36];\r\nurs=ids(1:5)+1;\r\nlls=urs+5;\r\nz=setxor(1:size(M,3),[ids urs lls]);\r\na1=arrayfun(@(a) isequal(M(:,:,a),eye(2)),ids);\r\na2=arrayfun(@(a) isequal(M(:,:,a),[0 1 ; 0 0]),urs);\r\na3=arrayfun(@(a) isequal(M(:,:,a),[0 0 ; 1 0]),lls);\r\na4=arrayfun(@(a) isequal(M(:,:,a),zeros(2)),z);\r\nassert(all([a1 a2 a3 a4]))\r\n%%\r\nu=ceil(10*rand())+4;\r\nx=magic(u);r=u;c=u;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(isequal(M,x))\r\n%%\r\ntemp=ceil(8*rand)+3;\r\nx=ones(temp);r=2;c=2;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(size(M,3)==(temp-1)^2);\r\nassert(all(arrayfun(@(a) isequal(M(:,:,a),ones(2)),1:size(M,3))))\r\n%%\r\nx=eye(7);r=7;c=7;\r\nassert(isequal(x,BreakTheMatrix(x,r,c)))","published":true,"deleted":false,"likes_count":9,"comments_count":14,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":379,"test_suite_updated_at":"2017-10-31T19:02:59.000Z","rescore_all_solutions":false,"group_id":34,"created_at":"2017-09-28T14:36:19.000Z","updated_at":"2026-03-31T15:14:35.000Z","published_at":"2017-10-16T01:45:08.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\u003eDo you want to take the Red Pill, or the Blue Pill?\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\u003eIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\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\u003eIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows. Increment only one column (or one row) at a time. Do not go C columns down at each step.\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, R=2 and C=3, and M is as follows:\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[ M=[1 4 7 10\\n    2 5 8 11\\n    3 6 9 12]]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis means that your output should be a 2x3x4 matrix:\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[ X(:,:,1) =\\n     1     4     7\\n     2     5     8\\n X(:,:,2) =\\n     2     5     8\\n     3     6     9\\n X(:,:,3) =\\n     4     7    10\\n     5     8    11\\n X(:,:,4) =\\n     5     8    11\\n     6     9    12]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\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":44350,"title":"Breaking Out of the Matrix","description":"Do you want to take the Red Pill, or the Blue Pill?\r\n\r\nIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\r\n\r\nIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows.  Increment only one column (or one row) at a time.  Do not go C columns down at each step.\r\n\r\nFor example, R=2 and C=3, and M is as follows:\r\n\r\n M=[1 4 7 10\r\n    2 5 8 11\r\n    3 6 9 12]\r\n\r\nThis means that your output should be a 2x3x4 matrix:\r\n\r\n X(:,:,1) =\r\n     1     4     7\r\n     2     5     8\r\n X(:,:,2) =\r\n     2     5     8\r\n     3     6     9\r\n X(:,:,3) =\r\n     4     7    10\r\n     5     8    11\r\n X(:,:,4) =\r\n     5     8    11\r\n     6     9    12\r\n\r\nYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\r\n","description_html":"\u003cp\u003eDo you want to take the Red Pill, or the Blue Pill?\u003c/p\u003e\u003cp\u003eIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\u003c/p\u003e\u003cp\u003eIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows.  Increment only one column (or one row) at a time.  Do not go C columns down at each step.\u003c/p\u003e\u003cp\u003eFor example, R=2 and C=3, and M is as follows:\u003c/p\u003e\u003cpre\u003e M=[1 4 7 10\r\n    2 5 8 11\r\n    3 6 9 12]\u003c/pre\u003e\u003cp\u003eThis means that your output should be a 2x3x4 matrix:\u003c/p\u003e\u003cpre\u003e X(:,:,1) =\r\n     1     4     7\r\n     2     5     8\r\n X(:,:,2) =\r\n     2     5     8\r\n     3     6     9\r\n X(:,:,3) =\r\n     4     7    10\r\n     5     8    11\r\n X(:,:,4) =\r\n     5     8    11\r\n     6     9    12\u003c/pre\u003e\u003cp\u003eYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\u003c/p\u003e","function_template":"function y = BreakTheMatrix(M,R,C)\r\n  y = x;\r\nend","test_suite":"%%\r\nM=[1 4 7 10;\r\n2 5 8 11;\r\n3 6 9 12];\r\nR=2;C=3;\r\nX(:,:,1) =[1 4 7 ; 2 5 8];\r\nX(:,:,2) =[2 5 8 ; 3 6 9];\r\nX(:,:,3) =[4 7 10 ; 5 8 11];\r\nX(:,:,4) =[5 8 11 ; 6 9 12];\r\nassert(isequal(BreakTheMatrix(M,R,C),X))\r\n%%\r\nx=1:ceil(35+25*rand());r=1;c=1;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(all(arrayfun(@(y) (M(:,:,y)==y),1:numel(x))))\r\n%%\r\nx=eye(7);r=2;c=2;\r\nM=BreakTheMatrix(x,r,c);\r\nids=[1 8 15 22 29 36];\r\nurs=ids(1:5)+1;\r\nlls=urs+5;\r\nz=setxor(1:size(M,3),[ids urs lls]);\r\na1=arrayfun(@(a) isequal(M(:,:,a),eye(2)),ids);\r\na2=arrayfun(@(a) isequal(M(:,:,a),[0 1 ; 0 0]),urs);\r\na3=arrayfun(@(a) isequal(M(:,:,a),[0 0 ; 1 0]),lls);\r\na4=arrayfun(@(a) isequal(M(:,:,a),zeros(2)),z);\r\nassert(all([a1 a2 a3 a4]))\r\n%%\r\nu=ceil(10*rand())+4;\r\nx=magic(u);r=u;c=u;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(isequal(M,x))\r\n%%\r\ntemp=ceil(8*rand)+3;\r\nx=ones(temp);r=2;c=2;\r\nM=BreakTheMatrix(x,r,c);\r\nassert(size(M,3)==(temp-1)^2);\r\nassert(all(arrayfun(@(a) isequal(M(:,:,a),ones(2)),1:size(M,3))))\r\n%%\r\nx=eye(7);r=7;c=7;\r\nassert(isequal(x,BreakTheMatrix(x,r,c)))","published":true,"deleted":false,"likes_count":9,"comments_count":14,"created_by":1615,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":379,"test_suite_updated_at":"2017-10-31T19:02:59.000Z","rescore_all_solutions":false,"group_id":34,"created_at":"2017-09-28T14:36:19.000Z","updated_at":"2026-03-31T15:14:35.000Z","published_at":"2017-10-16T01:45:08.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\u003eDo you want to take the Red Pill, or the Blue Pill?\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\u003eIf you take the Blue Pill, you will simply pass along to the next problem, not knowing what Cody has in store for you.\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\u003eIf you take the Red Pill, you will be asked to write a MATLAB function that will Break a Matrix. The inputs to the function will be a matrix M, along with a number of rows (R) and columns (C). You goal is to break the larger 2-D matrix up into a 3-D matrix comprised of enough RxC matrices so that you can recreate the 2-D matrix. When creating your 3-D matrix, go down the columns first, and then across the rows. Increment only one column (or one row) at a time. Do not go C columns down at each step.\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, R=2 and C=3, and M is as follows:\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[ M=[1 4 7 10\\n    2 5 8 11\\n    3 6 9 12]]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis means that your output should be a 2x3x4 matrix:\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[ X(:,:,1) =\\n     1     4     7\\n     2     5     8\\n X(:,:,2) =\\n     2     5     8\\n     3     6     9\\n X(:,:,3) =\\n     4     7    10\\n     5     8    11\\n X(:,:,4) =\\n     5     8    11\\n     6     9    12]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYou can assume that R and C will always be less than or equal to the appropriate dimension of the original matrix. Good luck!\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:\"windowing\"","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:\"windowing\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"windowing\"","","\"","windowing","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d340\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f5349f2d2a0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f5349f2c9e0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d5c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f5349f2d520\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f5349f2d480\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f5349f2d3e0\u003e":"tag:\"windowing\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d3e0\u003e":"tag:\"windowing\""},"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:\"windowing\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"windowing\"","","\"","windowing","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d340\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f5349f2d2a0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f5349f2c9e0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d5c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f5349f2d520\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f5349f2d480\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f5349f2d3e0\u003e":"tag:\"windowing\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f5349f2d3e0\u003e":"tag:\"windowing\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44350,"difficulty_rating":"medium"}]}}