Difficulty distribution
How the classified questions are distributed by difficulty.
Your cart is empty.
Practice Permutations And Combinations - Algebra - Mathematics previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
Every graph below is calculated only from this selection.
Year-wise coverage for Permutations And Combinations. Each bar uses a separate theme-derived color.
How the classified questions are distributed by difficulty.
MCQ, numerical, multiple-select and other formats found in these papers.
Top subjects by unique question coverage.
Top topics across the included previous year papers.
Top subtopics inside this exact selection.
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| VITEEE 2025 | 2025 | 2 | View paper |
| WB JEE 2025 | 2025 | 2 | View paper |
| WB JEE 2024 | 2024 | 3 | View paper |
| WB JEE 2023 | 2023 | 4 | View paper |
| WB JEE 2022 | 2022 | 1 | View paper |
| WB JEE 2021 | 2021 | 2 | View paper |
| WB JEE 2020 | 2020 | 2 | View paper |
| WB JEE 2019 | 2019 | 2 | View paper |
| WB JEE 2018 | 2018 | 4 | View paper |
| WB JEE 2017 | 2017 | 2 | View paper |
| WB JEE 2016 | 2016 | 3 | View paper |
| WB JEE 2012 | 2012 | 1 | View paper |
| WB JEE 2011 | 2011 | 4 | View paper |
| WB JEE 2010 | 2010 | 2 | View paper |
| WB JEE 2009 | 2009 | 1 | View paper |
| WB JEE 2008 | 2008 | 3 | View paper |
Practice every matching question in batches of 20, with every available option.
There are n white and n black balls marked 1, 2, 3, ...... n. The number of ways in which we can arrange these balls in a row so that neighbouring balls are of different colours is
A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then
n objects are distributed at random among n persons. The number of ways in which this can be done so that at least one of them will not get any object is
Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is
The number of ways in which the letters of the word 'VERTICAL' can be arranged without changing the order of the vowels is
Showing 20 of 38 questions