{"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":57545,"title":"Integer vector optimal lossless deduplication","description":"You're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u003c=Max-Min+1.\r\nYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\r\nThere may be more than one possible Bs meeting the conditions above. You need to give the \"best\" one. The \"best\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; 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: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 165px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 82.5px; transform-origin: 407px 82.5px; vertical-align: baseline; \"\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: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eYou're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u0026lt;=Max-Min+1.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; 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: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\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: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThere may be more than one possible Bs meeting the conditions above. You need to give the \"best\" one. The \"best\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function B=ILD(A,Min,Max)\r\n  B=A;\r\nend","test_suite":"%%\r\nA=1;Min=1;Max=1;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\nA=1;Min=1;Max=2;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=2;Min=1;Max=5;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=[7 6 8 5 1 9 2];Min=1;Max=10;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=[13 18 16 1 13 20 5 4 19 16 15 7 16 6];Min=1;Max=20;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nBestB=[1,4,5,6,7,12,13,14,15,16,17,18,19,20];\r\nBestError=sum(abs(sort(A)-sort(BestB)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error\u003c=BestError,'Not the best B');\r\n%%\r\n%%\r\nA=[34 49 4 38 16 4 18 9 48 19 3 27 35 27 28 47 50 40 19 46 28 34 26 29 23 42 50 20 28 27 33 45 7 10 3 46 10 32 15 37 43 41 38 27 28];\r\nMin=1;Max=50;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nBestB=[2,3,4,5,7,9,10,11,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50];\r\nBestError=sum(abs(sort(A)-sort(BestB)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error\u003c=BestError,'Not the best B');","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":362068,"edited_by":362068,"edited_at":"2023-01-14T14:23:25.000Z","deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":"2023-01-14T14:23:25.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2023-01-14T14:14:54.000Z","updated_at":"2025-12-08T14:10:45.000Z","published_at":"2023-01-14T14:14:54.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\u003eYou're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u0026lt;=Max-Min+1.\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\u003eYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\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\u003eThere may be more than one possible Bs meeting the conditions above. You need to give the \\\"best\\\" one. The \\\"best\\\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.\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":57545,"title":"Integer vector optimal lossless deduplication","description":"You're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u003c=Max-Min+1.\r\nYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\r\nThere may be more than one possible Bs meeting the conditions above. You need to give the \"best\" one. The \"best\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; 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: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 165px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 82.5px; transform-origin: 407px 82.5px; vertical-align: baseline; \"\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: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eYou're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u0026lt;=Max-Min+1.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; 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: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\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: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; 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: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThere may be more than one possible Bs meeting the conditions above. You need to give the \"best\" one. The \"best\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function B=ILD(A,Min,Max)\r\n  B=A;\r\nend","test_suite":"%%\r\nA=1;Min=1;Max=1;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\nA=1;Min=1;Max=2;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=2;Min=1;Max=5;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=[7 6 8 5 1 9 2];Min=1;Max=10;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error==0,'Not the best B');\r\n%%\r\n%%\r\nA=[13 18 16 1 13 20 5 4 19 16 15 7 16 6];Min=1;Max=20;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nBestB=[1,4,5,6,7,12,13,14,15,16,17,18,19,20];\r\nBestError=sum(abs(sort(A)-sort(BestB)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error\u003c=BestError,'Not the best B');\r\n%%\r\n%%\r\nA=[34 49 4 38 16 4 18 9 48 19 3 27 35 27 28 47 50 40 19 46 28 34 26 29 23 42 50 20 28 27 33 45 7 10 3 46 10 32 15 37 43 41 38 27 28];\r\nMin=1;Max=50;\r\nB=ILD(A,Min,Max)\r\nassert(numel(A)==numel(B),'Different number of elements');\r\nError=sum(abs(sort(A)-sort(B)))\r\nBestB=[2,3,4,5,7,9,10,11,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50];\r\nBestError=sum(abs(sort(A)-sort(BestB)))\r\nassert(all(B\u003e=Min)\u0026\u0026all(B\u003c=Max),'Value out of range');\r\nassert(numel(B)==numel(unique(B)),'B has duplicate elements');\r\nassert(Error\u003c=BestError,'Not the best B');","published":true,"deleted":false,"likes_count":2,"comments_count":3,"created_by":362068,"edited_by":362068,"edited_at":"2023-01-14T14:23:25.000Z","deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":"2023-01-14T14:23:25.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2023-01-14T14:14:54.000Z","updated_at":"2025-12-08T14:10:45.000Z","published_at":"2023-01-14T14:14:54.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\u003eYou're given an integer vector A, a Min scalar and a Max scalar. You can assume all elements in A are in [Min,Max] range, and numel(A)\u0026lt;=Max-Min+1.\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\u003eYour function should output also an integer vector B, whose elements are also in [Min,Max] range, and whose numel is the same as A (numel(B)==numel(A), i.e., lossless). What is different is that your B must not have duplicate values (i.e., deduplication).\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\u003eThere may be more than one possible Bs meeting the conditions above. You need to give the \\\"best\\\" one. The \\\"best\\\" is defined as the B making Error=sum(abs(sort(A)-sort(B))) smallest (i.e. optimal) among all possible Bs.\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:\"deduplication\"","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:\"deduplication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"deduplication\"","","\"","deduplication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f5350371720\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f5350371680\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f5350370be0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f53503719a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f5350371900\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f5350371860\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f53503717c0\u003e":"tag:\"deduplication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f53503717c0\u003e":"tag:\"deduplication\""},"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:\"deduplication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"deduplication\"","","\"","deduplication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f5350371720\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f5350371680\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f5350370be0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f53503719a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f5350371900\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f5350371860\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f53503717c0\u003e":"tag:\"deduplication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f53503717c0\u003e":"tag:\"deduplication\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":57545,"difficulty_rating":"easy-medium"}]}}