{"id":"f7272575-fb30-4927-a473-ff18b78593fd","name":"Queens Permutations - 2d As 2d - Queen Chooses","description":"1. You are given a number n, representing the size of a n * n chess board.\r\n2. You are required to calculate and print the permutations in which n queens can be placed on the \r\n n * n chess-board. \r\n\r\nNote -> Use the code snippet and follow the algorithm discussed in question video. The judge can't \r\n force you but the intention is to teach a concept. Play in spirit of the question.","inputFormat":"A number n","outputFormat":"Check the sample output and question video","constraints":"1 <= n <= 5","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void queensPermutations(int qpsf, int tq, int[][] chess){\r\n // write your code here\r\n }\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int n = Integer.parseInt(br.readLine());\r\n int[][] chess = new int[n][n];\r\n \r\n queensPermutations(0, n, chess);\r\n }\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"2","sampleOutput":"q1\tq2\t\r\n-\t-\t\r\n\r\nq1\t-\t\r\nq2\t-\t\r\n\r\nq1\t-\t\r\n-\tq2\t\r\n\r\nq2\tq1\t\r\n-\t-\t\r\n\r\n-\tq1\t\r\nq2\t-\t\r\n\r\n-\tq1\t\r\n-\tq2\t\r\n\r\nq2\t-\t\r\nq1\t-\t\r\n\r\n-\tq2\t\r\nq1\t-\t\r\n\r\n-\t-\t\r\nq1\tq2\t\r\n\r\nq2\t-\t\r\n-\tq1\t\r\n\r\n-\tq2\t\r\n-\tq1\t\r\n\r\n-\t-\t\r\nq2\tq1\t\r\n\r\n","questionVideo":"https://www.youtube.com/embed/mkl6KOwtdbk?end=123","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"082986ae-d618-4a59-9ab3-6d79056679a4","name":"Recursion and Backtracking For Intermediate","slug":"recursion-and-backtracking-for-intermediate-330","type":0},{"id":"1681de01-b2ae-41f8-b149-ce5072abbd7a","name":"Queens Permutations - 2d As 2d - Queen Chooses","slug":"queens-permutations-2d-as-2d-queen-chooses","type":1}],"next":{"id":"d5ad26af-3afe-44f1-9074-3941ac474487","name":"Queens Permutations - 2d As 2d - Queen Chooses MCQ","type":0,"slug":"queens-permutations-2d-as-2d-queen-chooses-mcq"},"prev":{"id":"db75bddb-0103-4122-95df-539454870186","name":"Queens Combinations 2d-as-2d -Box chooses MCQ","type":0,"slug":"queens-combinations-2d-as-2d-box-chooses-mcq"}}}

Queens Permutations - 2d As 2d - Queen Chooses

1. You are given a number n, representing the size of a n * n chess board. 2. You are required to calculate and print the permutations in which n queens can be placed on the n * n chess-board. Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't force you but the intention is to teach a concept. Play in spirit of the question.

{"id":"f7272575-fb30-4927-a473-ff18b78593fd","name":"Queens Permutations - 2d As 2d - Queen Chooses","description":"1. You are given a number n, representing the size of a n * n chess board.\r\n2. You are required to calculate and print the permutations in which n queens can be placed on the \r\n n * n chess-board. \r\n\r\nNote -> Use the code snippet and follow the algorithm discussed in question video. The judge can't \r\n force you but the intention is to teach a concept. Play in spirit of the question.","inputFormat":"A number n","outputFormat":"Check the sample output and question video","constraints":"1 <= n <= 5","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void queensPermutations(int qpsf, int tq, int[][] chess){\r\n // write your code here\r\n }\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int n = Integer.parseInt(br.readLine());\r\n int[][] chess = new int[n][n];\r\n \r\n queensPermutations(0, n, chess);\r\n }\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"2","sampleOutput":"q1\tq2\t\r\n-\t-\t\r\n\r\nq1\t-\t\r\nq2\t-\t\r\n\r\nq1\t-\t\r\n-\tq2\t\r\n\r\nq2\tq1\t\r\n-\t-\t\r\n\r\n-\tq1\t\r\nq2\t-\t\r\n\r\n-\tq1\t\r\n-\tq2\t\r\n\r\nq2\t-\t\r\nq1\t-\t\r\n\r\n-\tq2\t\r\nq1\t-\t\r\n\r\n-\t-\t\r\nq1\tq2\t\r\n\r\nq2\t-\t\r\n-\tq1\t\r\n\r\n-\tq2\t\r\n-\tq1\t\r\n\r\n-\t-\t\r\nq2\tq1\t\r\n\r\n","questionVideo":"https://www.youtube.com/embed/mkl6KOwtdbk?end=123","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"082986ae-d618-4a59-9ab3-6d79056679a4","name":"Recursion and Backtracking For Intermediate","slug":"recursion-and-backtracking-for-intermediate-330","type":0},{"id":"1681de01-b2ae-41f8-b149-ce5072abbd7a","name":"Queens Permutations - 2d As 2d - Queen Chooses","slug":"queens-permutations-2d-as-2d-queen-chooses","type":1}],"next":{"id":"d5ad26af-3afe-44f1-9074-3941ac474487","name":"Queens Permutations - 2d As 2d - Queen Chooses MCQ","type":0,"slug":"queens-permutations-2d-as-2d-queen-chooses-mcq"},"prev":{"id":"db75bddb-0103-4122-95df-539454870186","name":"Queens Combinations 2d-as-2d -Box chooses MCQ","type":0,"slug":"queens-combinations-2d-as-2d-box-chooses-mcq"}}}
plane

Editor

Loading...

Queens Permutations - 2d As 2d - Queen Chooses

medium

1. You are given a number n, representing the size of a n * n chess board. 2. You are required to calculate and print the permutations in which n queens can be placed on the n * n chess-board. Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't force you but the intention is to teach a concept. Play in spirit of the question.

Constraints

1 <= n <= 5

Format

Input

A number n

Output

Check the sample output and question video

Example

Sample Input

2

Sample Output

q1 q2 - - q1 - q2 - q1 - - q2 q2 q1 - - - q1 q2 - - q1 - q2 q2 - q1 - - q2 q1 - - - q1 q2 q2 - - q1 - q2 - q1 - - q2 q1

Question Video

Discussions

Show Discussion

Related Resources

related resources

Turning Off Zen Mode