{"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":2026,"title":"Skyscrapers - Puzzle","description":"The Skyscraper puzzle challenge comes from \u003chttp://logicmastersindia.com/home/ Logic Masters India\u003e and \u003chttp://www.conceptispuzzles.com/ Games' Concept is Puzzles\u003e. \r\n\r\nCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\r\n\r\n*Input:* [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\r\n\r\n*Output:* M  an NxN matrix\r\n\r\n*Example:*\r\n\r\n  vr=[0 0 3 0 0]';\r\n  vL=[3 0 0 1 0]';\r\n  vd=[0 0 0 0 0];\r\n  vu=[5 2 0 0 0];\r\n\r\n  M\r\n         5     4     2     1     3\r\n         4     5     1     3     2\r\n         3     2     4     5     1\r\n         2     1     3     4     5\r\n         1     3     5     2     4\r\n\r\n*Algorithm Discussion:*\r\n\r\n  1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\r\n  2) Calc Skyscraper count from Left and Right\r\n  3) Determine subset of SkyVectors possible for each Row and Column\r\n  4) Sort the Qty of 2*N possible solutions\r\n  5) Recursion from least to most valid SkyVectors\r\n  6) In recursion verify valid overlay or return\r\n","description_html":"\u003cp\u003eThe Skyscraper puzzle challenge comes from \u003ca href = \"http://logicmastersindia.com/home/\"\u003eLogic Masters India\u003c/a\u003e and \u003ca href = \"http://www.conceptispuzzles.com/\"\u003eGames' Concept is Puzzles\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e M  an NxN matrix\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003evr=[0 0 3 0 0]';\r\nvL=[3 0 0 1 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[5 2 0 0 0];\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eM\r\n       5     4     2     1     3\r\n       4     5     1     3     2\r\n       3     2     4     5     1\r\n       2     1     3     4     5\r\n       1     3     5     2     4\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eAlgorithm Discussion:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\r\n2) Calc Skyscraper count from Left and Right\r\n3) Determine subset of SkyVectors possible for each Row and Column\r\n4) Sort the Qty of 2*N possible solutions\r\n5) Recursion from least to most valid SkyVectors\r\n6) In recursion verify valid overlay or return\r\n\u003c/pre\u003e","function_template":"function m=solve_skyscrapers(vr,vL,vd,vu)\r\n m=[];\r\nend","test_suite":"%%\r\n%Games Feb 2014 #1\r\nvr=[0 0 1 0 5]'; %1\r\nvL=[0 4 4 0 0]';\r\nvd=[2 2 0 1 3];\r\nvu=[3 0 0 2 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd; % view down check\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view Left check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m); % view Up check\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #2\r\nvr=[0 4 0 2 0]'; %2\r\nvL=[5 1 0 0 0]';\r\nvd=[0 0 3 0 0];\r\nvu=[4 1 2 0 2];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #3\r\nvr=[5 2 2 0 0]'; %3\r\nvL=[0 3 0 3 4]';\r\nvd=[5 0 0 0 0];\r\nvu=[0 2 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #4\r\nvr=[0 0 4 5 0]'; %4\r\nvL=[0 0 0 0 0]';\r\nvd=[2 0 2 3 0];\r\nvu=[0 0 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #5\r\nvr=[3 5 0 0 0]'; %5\r\nvL=[0 0 4 0 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[2 0 1 0 2];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\n\r\n%%\r\nvr=[0 0 3 0 0]'; %Games Feb 2014 #6\r\nvL=[3 0 0 1 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[5 2 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-11-29T19:42:36.000Z","updated_at":"2026-01-08T14:21:06.000Z","published_at":"2013-11-29T22:09:44.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\u003eThe Skyscraper puzzle challenge comes from\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://logicmastersindia.com/home/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLogic Masters India\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.conceptispuzzles.com/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGames' Concept is Puzzles\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\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\u003eCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e M an NxN matrix\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eExample:\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[vr=[0 0 3 0 0]';\\nvL=[3 0 0 1 0]';\\nvd=[0 0 0 0 0];\\nvu=[5 2 0 0 0];\\n\\nM\\n       5     4     2     1     3\\n       4     5     1     3     2\\n       3     2     4     5     1\\n       2     1     3     4     5\\n       1     3     5     2     4]]\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAlgorithm Discussion:\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[1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\\n2) Calc Skyscraper count from Left and Right\\n3) Determine subset of SkyVectors possible for each Row and Column\\n4) Sort the Qty of 2*N possible solutions\\n5) Recursion from least to most valid SkyVectors\\n6) In recursion verify valid overlay or return]]\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":2026,"title":"Skyscrapers - Puzzle","description":"The Skyscraper puzzle challenge comes from \u003chttp://logicmastersindia.com/home/ Logic Masters India\u003e and \u003chttp://www.conceptispuzzles.com/ Games' Concept is Puzzles\u003e. \r\n\r\nCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\r\n\r\n*Input:* [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\r\n\r\n*Output:* M  an NxN matrix\r\n\r\n*Example:*\r\n\r\n  vr=[0 0 3 0 0]';\r\n  vL=[3 0 0 1 0]';\r\n  vd=[0 0 0 0 0];\r\n  vu=[5 2 0 0 0];\r\n\r\n  M\r\n         5     4     2     1     3\r\n         4     5     1     3     2\r\n         3     2     4     5     1\r\n         2     1     3     4     5\r\n         1     3     5     2     4\r\n\r\n*Algorithm Discussion:*\r\n\r\n  1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\r\n  2) Calc Skyscraper count from Left and Right\r\n  3) Determine subset of SkyVectors possible for each Row and Column\r\n  4) Sort the Qty of 2*N possible solutions\r\n  5) Recursion from least to most valid SkyVectors\r\n  6) In recursion verify valid overlay or return\r\n","description_html":"\u003cp\u003eThe Skyscraper puzzle challenge comes from \u003ca href = \"http://logicmastersindia.com/home/\"\u003eLogic Masters India\u003c/a\u003e and \u003ca href = \"http://www.conceptispuzzles.com/\"\u003eGames' Concept is Puzzles\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e M  an NxN matrix\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003evr=[0 0 3 0 0]';\r\nvL=[3 0 0 1 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[5 2 0 0 0];\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eM\r\n       5     4     2     1     3\r\n       4     5     1     3     2\r\n       3     2     4     5     1\r\n       2     1     3     4     5\r\n       1     3     5     2     4\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eAlgorithm Discussion:\u003c/b\u003e\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\r\n2) Calc Skyscraper count from Left and Right\r\n3) Determine subset of SkyVectors possible for each Row and Column\r\n4) Sort the Qty of 2*N possible solutions\r\n5) Recursion from least to most valid SkyVectors\r\n6) In recursion verify valid overlay or return\r\n\u003c/pre\u003e","function_template":"function m=solve_skyscrapers(vr,vL,vd,vu)\r\n m=[];\r\nend","test_suite":"%%\r\n%Games Feb 2014 #1\r\nvr=[0 0 1 0 5]'; %1\r\nvL=[0 4 4 0 0]';\r\nvd=[2 2 0 1 3];\r\nvu=[3 0 0 2 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd; % view down check\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view Left check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m); % view Up check\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #2\r\nvr=[0 4 0 2 0]'; %2\r\nvL=[5 1 0 0 0]';\r\nvd=[0 0 3 0 0];\r\nvu=[4 1 2 0 2];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #3\r\nvr=[5 2 2 0 0]'; %3\r\nvL=[0 3 0 3 4]';\r\nvd=[5 0 0 0 0];\r\nvu=[0 2 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #4\r\nvr=[0 0 4 5 0]'; %4\r\nvL=[0 0 0 0 0]';\r\nvd=[2 0 2 3 0];\r\nvu=[0 0 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n%%\r\n%Games Feb 2014 #5\r\nvr=[3 5 0 0 0]'; %5\r\nvL=[0 0 4 0 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[2 0 1 0 2];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\n\r\n%%\r\nvr=[0 0 3 0 0]'; %Games Feb 2014 #6\r\nvL=[3 0 0 1 0]';\r\nvd=[0 0 0 0 0];\r\nvu=[5 2 0 0 0];\r\n\r\ntic\r\nm=solve_skyscrapers(vr,vL,vd,vu)\r\ntoc\r\n\r\nnr=length(vr);\r\nnrsum=nr*(nr+1)/2;\r\nassert(nr*nrsum==sum(m(:)))\r\nassert(nr==size(m,1));\r\nassert(nr==size(m,2));\r\nassert(all(sum(m)==nrsum));\r\nassert(all(sum(m,2)==nrsum));\r\n\r\nmt=m; % view right check\r\nvz=vr;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nvz=vd;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\n\r\nmt=fliplr(m); % view right check\r\nvz=vL;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(k,1);\r\n for z=2:nr\r\n  if mt(k,z)\u003eshi\r\n   shi=mt(k,z);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)); % Assert check of valid count\r\n end % if\r\nend % k\r\n\r\nmt=flipud(m);\r\nvz=vu;\r\nfor k=1:nr\r\n if vz(k)\u003e0\r\n c=1;\r\n shi=mt(1,k);\r\n for z=2:nr\r\n  if mt(z,k)\u003eshi\r\n   shi=mt(z,k);\r\n   c=c+1;\r\n  end\r\n end % z\r\n c;\r\n vz(k);\r\n assert(c==vz(k)) % Assert check of valid count\r\n end % if\r\nend % k\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-11-29T19:42:36.000Z","updated_at":"2026-01-08T14:21:06.000Z","published_at":"2013-11-29T22:09:44.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\u003eThe Skyscraper puzzle challenge comes from\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://logicmastersindia.com/home/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLogic Masters India\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.conceptispuzzles.com/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGames' Concept is Puzzles\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\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\u003eCreate an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e M an NxN matrix\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eExample:\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[vr=[0 0 3 0 0]';\\nvL=[3 0 0 1 0]';\\nvd=[0 0 0 0 0];\\nvu=[5 2 0 0 0];\\n\\nM\\n       5     4     2     1     3\\n       4     5     1     3     2\\n       3     2     4     5     1\\n       2     1     3     4     5\\n       1     3     5     2     4]]\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eAlgorithm Discussion:\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[1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\\n2) Calc Skyscraper count from Left and Right\\n3) Determine subset of SkyVectors possible for each Row and Column\\n4) Sort the Qty of 2*N possible solutions\\n5) Recursion from least to most valid SkyVectors\\n6) In recursion verify valid overlay or return]]\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:\"skyscrapers\"","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:\"skyscrapers\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"skyscrapers\"","","\"","skyscrapers","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f1943b2ff08\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f1943b2fe68\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f1943b2f5a8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f1943ae0200\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f1943ae0160\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f1943ae00c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f1943ae0020\u003e":"tag:\"skyscrapers\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f1943ae0020\u003e":"tag:\"skyscrapers\""},"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:\"skyscrapers\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"skyscrapers\"","","\"","skyscrapers","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f1943b2ff08\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f1943b2fe68\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f1943b2f5a8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f1943ae0200\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f1943ae0160\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f1943ae00c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f1943ae0020\u003e":"tag:\"skyscrapers\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f1943ae0020\u003e":"tag:\"skyscrapers\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":2026,"difficulty_rating":"medium"}]}}