<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
        xmlns:xhtml="http://www.w3.org/1999/xhtml"
        xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"
        xmlns:image="http://www.google.com/schemas/sitemap-image/1.1">
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/factorial</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/factorial" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/factorial" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="factorial">
            <Attribute name="title">Factorial</Attribute>
            <Attribute name="description">We finally talk about the operator Factorial. We understand its applications and solve some problems involving its simplifications. First we notice factorials, then define it while noting its notation. We then practice identifying and evaluating a few common factorials. After going through some key observations, we practice simplifying expressions and solving equations involving factorials. We finally observe that the formula for rearrangements when all objects are distinct (and also when some objects are similar) contain our beloved factorial!</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Factorial</video:title>
            <video:description>We finally talk about the operator Factorial. We understand its applications and solve some problems involving its simplifications. First we notice factorials, then define it while noting its notation. We then practice identifying and evaluating a few common factorials. After going through some key observations, we practice simplifying expressions and solving equations involving factorials. We finally observe that the formula for rearrangements when all objects are distinct (and also when some objects are similar) contain our beloved factorial!</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/FDR3AdVop0Q.mp4/FDR3AdVop0Q.mp4</video:player_loc>
            <video:duration>412</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/using-and-and-or-for-letters</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/using-and-and-or-for-letters" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/using-and-and-or-for-letters" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="using-and-and-or-for-letters">
            <Attribute name="title">Using AND and OR for letters</Attribute>
            <Attribute name="description">We now turn our attention towards rearranging letters. We use whatever we&#39;ve learnt from the world of digits to solve problems involving a brand new context. We start by rearranging the letters of the word LOVE and then keep on adding constraints - first that the words start with a vowel and then that the words start and end with vowels. We practice this skill on another word NATURE - first creating a 6 lettered word and then creating a 3 lettered word.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Using AND and OR for letters</video:title>
            <video:description>We now turn our attention towards rearranging letters. We use whatever we&#39;ve learnt from the world of digits to solve problems involving a brand new context. We start by rearranging the letters of the word LOVE and then keep on adding constraints - first that the words start with a vowel and then that the words start and end with vowels. We practice this skill on another word NATURE - first creating a 6 lettered word and then creating a 3 lettered word.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/4hmDDblM6zM.mp4/4hmDDblM6zM.mp4</video:player_loc>
            <video:duration>315</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/repeated-letters</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/repeated-letters" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/repeated-letters" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="repeated-letters">
            <Attribute name="title">Repeated letters</Attribute>
            <Attribute name="description">We&#39;ve learnt how to rearrange MANGO. In this video, we&#39;ll find ways to rearrange APPLE. We take the example of LEAF and TREE to understand the concept. LEAF does not have repeating letters but TREE does. We figure out a way to efficiently find the number of duplicates and remove them. We use this skill for words where there are more than 2 letters repeating: ABC and AAA, FAFF etc. Finally, we summarise and try recognising the pattern that we can use for corrections in similar scenarios.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Repeated letters</video:title>
            <video:description>We&#39;ve learnt how to rearrange MANGO. In this video, we&#39;ll find ways to rearrange APPLE. We take the example of LEAF and TREE to understand the concept. LEAF does not have repeating letters but TREE does. We figure out a way to efficiently find the number of duplicates and remove them. We use this skill for words where there are more than 2 letters repeating: ABC and AAA, FAFF etc. Finally, we summarise and try recognising the pattern that we can use for corrections in similar scenarios.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/O6SxjnjeNRc.mp4/O6SxjnjeNRc.mp4</video:player_loc>
            <video:duration>550</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/multiple-repetitions</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/multiple-repetitions" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/multiple-repetitions" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="multiple-repetitions">
            <Attribute name="title">Multiple repetitions</Attribute>
            <Attribute name="description">So far, we&#39;ve learnt how to deal with words with 2 letters repeating. In this video, we&#39;ll look at ways to arrange letters of a word with more tha 2 repetitions. We start by refreshing what we&#39;ve learnt about arrangements where a particular letter repeats. Through arranging letters of the words KHANACADEMY, REPETITION, and MISSISSIPPI we learn how to deal with words where there are multiple letters repeating multiple times!</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Multiple repetitions</video:title>
            <video:description>So far, we&#39;ve learnt how to deal with words with 2 letters repeating. In this video, we&#39;ll look at ways to arrange letters of a word with more tha 2 repetitions. We start by refreshing what we&#39;ve learnt about arrangements where a particular letter repeats. Through arranging letters of the words KHANACADEMY, REPETITION, and MISSISSIPPI we learn how to deal with words where there are multiple letters repeating multiple times!</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/lFOGNsPknVY.mp4/lFOGNsPknVY.mp4</video:player_loc>
            <video:duration>370</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/bundling</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/bundling" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/bundling" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="bundling">
            <Attribute name="title">Bundling</Attribute>
            <Attribute name="description">We cover a tricky constraint in this video. How to rearrange letters of a word when a set of letters are always together. We learn how to bundle the group of letters that are constrained to always stick together. Once we&#39;ve solved for the bundled group, we then figure out a systematic way to unbundle the group. We summarise the approach and then use it in another scenario where 3 vowels are constrained to be always together. We finish it off by discussing the case when the opposite is expected - that the vowels are never together.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Bundling</video:title>
            <video:description>We cover a tricky constraint in this video. How to rearrange letters of a word when a set of letters are always together. We learn how to bundle the group of letters that are constrained to always stick together. Once we&#39;ve solved for the bundled group, we then figure out a systematic way to unbundle the group. We summarise the approach and then use it in another scenario where 3 vowels are constrained to be always together. We finish it off by discussing the case when the opposite is expected - that the vowels are never together.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/FnNUk2oRD9g.mp4/FnNUk2oRD9g.mp4</video:player_loc>
            <video:duration>502</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/putting-it-all-together</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/putting-it-all-together" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/putting-it-all-together" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="putting-it-all-together">
            <Attribute name="title">Putting it all together</Attribute>
            <Attribute name="description">We bring in all the concepts covered in the previous videos to tackle a complex rearrangement problem. We rearrange the letters of the word INDEPENDENCE. We first find all possible arrangements. We then find words which start with P. Adding another constraint, we then find words that start with P and end with I. Finally, we also look at words which are always and never together.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Putting it all together</video:title>
            <video:description>We bring in all the concepts covered in the previous videos to tackle a complex rearrangement problem. We rearrange the letters of the word INDEPENDENCE. We first find all possible arrangements. We then find words which start with P. Adding another constraint, we then find words that start with P and end with I. Finally, we also look at words which are always and never together.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/3sJi9ywv4cc.mp4/3sJi9ywv4cc.mp4</video:player_loc>
            <video:duration>409</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/putting-it-all-together-challenge</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/putting-it-all-together-challenge" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/putting-it-all-together-challenge" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="putting-it-all-together-challenge">
            <Attribute name="title">Putting it all together (Challenge)</Attribute>
            <Attribute name="description">We pick things up from where we left in the previous video and tackle a really hairy constraint in this one. We find the number of ways to rearrange letters of a word when two given letters are always three letters apart. For this we break down the constraint into its components - easier problems that are independently solvable. We then combine the three to get to the final answer.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Putting it all together (Challenge)</video:title>
            <video:description>We pick things up from where we left in the previous video and tackle a really hairy constraint in this one. We find the number of ways to rearrange letters of a word when two given letters are always three letters apart. For this we break down the constraint into its components - easier problems that are independently solvable. We then combine the three to get to the final answer.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/11PP8vw8pIQ.mp4/11PP8vw8pIQ.mp4</video:player_loc>
            <video:duration>540</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/ranking</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/ranking" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/class-12-bridge/x09646558c1ff0797:advanced-counting/x09646558c1ff0797:permutations/v/ranking" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="ranking">
            <Attribute name="title">Ranking</Attribute>
            <Attribute name="description">If all the letters of the word MATH are rearranged and put in a dictionary, what will be the rank of the word MATH? We tackle this problem and a few similar ones in this video. We realise that there are two ways to solve these problems. Slower method involves listing down all possible arrangements and then manually hunting down the word we&#39;re looking for. This is tedious and prone to errors. A much faster method is to calculate the number of words starting with first letters. This helps us navigate the dictionary neatly.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>Ranking</video:title>
            <video:description>If all the letters of the word MATH are rearranged and put in a dictionary, what will be the rank of the word MATH? We tackle this problem and a few similar ones in this video. We realise that there are two ways to solve these problems. Slower method involves listing down all possible arrangements and then manually hunting down the word we&#39;re looking for. This is tedious and prone to errors. A much faster method is to calculate the number of words starting with first letters. This helps us navigate the dictionary neatly.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/a3vV_Rt0J70.mp4/a3vV_Rt0J70.mp4</video:player_loc>
            <video:duration>508</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/and-and-or-beyond-digits-and-letters</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/v/and-and-or-beyond-digits-and-letters" />
        
        <xhtml:link rel="alternate" hreflang="hi"
                    href="https://hi.khanacademy.org/math/ncert-class-11/xea4762213f311c5e:permutations-and-combinations-ncert-new/xea4762213f311c5e:permutations-1/v/and-and-or-beyond-digits-and-letters" />
        
        <lastmod>2025-03-01T15:52:37.13987578Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="and-and-or-beyond-digits-and-letters">
            <Attribute name="title">AND and OR (beyond digits and letters)</Attribute>
            <Attribute name="description">This video tackles the application of AND and OR beyond digits and letters. We talk about balls, coins, flags, and people. We first find the total number of arrangements of 3 types of balls. We then nominate President and Vice-president from a group of people. We find the total number of outcomes we can get if we toss a coin a specific number of times. Finally, we deal with scenarios where we create signals using 2 or more flags.</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/ZCdwTudJg6e6n-P2gsaUborP4izvMsGo71pvEVlX9dNYWcLXcP7VHkWpn2grt4TUP1KoJLQP9NswyHBuBLSFTBw</video:thumbnail_loc>
            <video:title>AND and OR (beyond digits and letters)</video:title>
            <video:description>This video tackles the application of AND and OR beyond digits and letters. We talk about balls, coins, flags, and people. We first find the total number of arrangements of 3 types of balls. We then nominate President and Vice-president from a group of people. We find the total number of outcomes we can get if we toss a coin a specific number of times. Finally, we deal with scenarios where we create signals using 2 or more flags.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/ZDc46vjsKj4.mp4/ZDc46vjsKj4.mp4</video:player_loc>
            <video:duration>372</video:duration>
            <video:category>Solving problems involving permutations of objects</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/factorials</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/factorials" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="factorials">
            <Attribute name="title">Factorials!</Attribute>
            <Attribute name="description">Factorials!</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-for-letters</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-for-letters" />
        
        <lastmod>2025-11-18T05:20:48.433314442Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="and-or-for-letters">
            <Attribute name="title">AND/OR for letters</Attribute>
            <Attribute name="description">AND/OR for letters</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-letters-with-repetition</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-letters-with-repetition" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="and-or-letters-with-repetition">
            <Attribute name="title">AND/OR letters (with repetition)</Attribute>
            <Attribute name="description">AND/OR letters (with repetition)</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-for-words-dealing-with-multiple-repetitions</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-for-words-dealing-with-multiple-repetitions" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="and-or-for-words-dealing-with-multiple-repetitions">
            <Attribute name="title">AND/OR for words: Dealing with multiple repetitions</Attribute>
            <Attribute name="description">AND/OR for words: Dealing with multiple repetitions</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/bundling</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/bundling" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="bundling">
            <Attribute name="title">Bundling</Attribute>
            <Attribute name="description">Bundling</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/permutations-advanced</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/permutations-advanced" />
        
        <lastmod>2026-03-26T13:02:58.856258642Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="permutations-advanced">
            <Attribute name="title">Spacing</Attribute>
            <Attribute name="description">Permutations (challenge)</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/ranking</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/ranking" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="ranking">
            <Attribute name="title">Ranking</Attribute>
            <Attribute name="description">Ranking</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-beyond-digits-and-letters</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/ka-math-class-11/x0419e5b3b578592a:permutations-and-combinations-ncert-new/x0419e5b3b578592a:permutations-1/e/and-or-beyond-digits-and-letters" />
        
        <lastmod>2025-05-31T02:32:31.283700489Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="and-or-beyond-digits-and-letters">
            <Attribute name="title">AND/OR beyond digits and letters</Attribute>
            <Attribute name="description">AND/OR beyond digits and letters</Attribute>
            <Attribute name="author">Ashish Gupta</Attribute>
            <Attribute name="type">exercise</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
</urlset>
