{"id":"725ee54c-3394-4ac7-8d51-4d915e78b424","name":"Queens Combinations - 2d As 2d - Box 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 combinations 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 &lt;= n &lt;= 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 queensCombinations(int qpsf, int tq, int row, int col, String asf){\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 \r\n queensCombinations(0, n, 0, 0, \"\");\r\n }\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"2","sampleOutput":"qq\r\n--\r\n\r\nq-\r\nq-\r\n\r\nq-\r\n-q\r\n\r\n-q\r\nq-\r\n\r\n-q\r\n-q\r\n\r\n--\r\nqq\r\n\r\n","questionVideo":"https://www.youtube.com/embed/Ra_fCLyWtr0?end=32","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":"8ad4f2cd-d5ad-49b2-937b-8e18ee49d465","name":"Queens Combinations - 2d As 2d - Box Chooses","slug":"queens-combinations-2d-as-2d-box-chooses","type":1}],"next":{"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"},"prev":{"id":"58eaeac9-066e-4e2c-a9df-ec3135d4948e","name":"Words-K-length words-2 MCQ","type":0,"slug":"words-k-length-words-2-mcq"}}}

# Queens Combinations - 2d As 2d - Box 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 combinations 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":"725ee54c-3394-4ac7-8d51-4d915e78b424","name":"Queens Combinations - 2d As 2d - Box 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 combinations 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 &lt;= n &lt;= 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 queensCombinations(int qpsf, int tq, int row, int col, String asf){\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 \r\n queensCombinations(0, n, 0, 0, \"\");\r\n }\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"2","sampleOutput":"qq\r\n--\r\n\r\nq-\r\nq-\r\n\r\nq-\r\n-q\r\n\r\n-q\r\nq-\r\n\r\n-q\r\n-q\r\n\r\n--\r\nqq\r\n\r\n","questionVideo":"https://www.youtube.com/embed/Ra_fCLyWtr0?end=32","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":"8ad4f2cd-d5ad-49b2-937b-8e18ee49d465","name":"Queens Combinations - 2d As 2d - Box Chooses","slug":"queens-combinations-2d-as-2d-box-chooses","type":1}],"next":{"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"},"prev":{"id":"58eaeac9-066e-4e2c-a9df-ec3135d4948e","name":"Words-K-length words-2 MCQ","type":0,"slug":"words-k-length-words-2-mcq"}}}

Editor

# Queens Combinations - 2d As 2d - Box 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 combinations 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.

1 <= n <= 5

## Format

A number n

### Output

Check the sample output and question video

## Example

Sample Input

2

### Sample Output

qq -- q- q- q- -q -q q- -q -q -- qq

Question Video

Discussions

Show Discussion

Related Resources