Tricks to Solve Necklace Based Problems

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/permutation-and-combination/circular-grouping-permutations/asset-tricks-to-solve-necklace-based-problems after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on permutations and combinations, specifically focusing on solving problems related to arranging objects in a circle, such as a necklace. The instructor begins by introducing the core concepts of permutation and combination, using a visual metaphor of a detective trying to unlock a door with a permutation or combination lock. The main topic is a problem involving a necklace with 5 red, 6 green, and 3 yellow stones. The video presents two scenarios: one where the stones are not identical (distinct) and another where they are identical. For the distinct case, the instructor explains that the total number of arrangements is 13! (13 factorial), but because the necklace is circular, the formula is 13!/13, which simplifies to 12!. For the identical stones case, the formula is 13! divided by the product of the factorials of the counts of each color (5! for red, 6! for green, and 3! for yellow), and then divided by 13 for the circular arrangement. The instructor uses a whiteboard to write out the formulas and calculations, and the video concludes with a 'Thanks for Watching' screen.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card that visually contrasts 'PERMUTATION' with a casino theme (dice, roulette) and 'COMBINATION' with a pizza and office theme. It then transitions to a slide titled 'Confused' which poses the question 'Should I unlock with Permutation or Combination?'. The slide features a cartoon detective with a magnifying glass, standing between two doors labeled 'Permutation' and 'Combination', both of which are locked. The instructor, Yash Jain, is visible in a small window, and the video is branded with 'Knowledge Gate Educator'. This segment sets up the core confusion between permutation and combination that the lecture will address.

  2. 2:00 – 5:00 02:00-05:00

    The video displays a problem statement on a yellow background with a pattern of small shapes. The text reads: 'a) Necklace 5 Red, 6 Green and 3 Yellow, not identical stone.' and 'b) Stones are identical'. The instructor begins to solve the problem for the first case (a), where the stones are not identical. He writes on the screen, '13!' to represent the total number of stones, and then writes '13 stones' to confirm the total count. He explains that for a linear arrangement, the number of ways to arrange 13 distinct items is 13!. He then draws a circle to represent the necklace, indicating that the arrangement is circular.

  3. 5:00 – 7:37 05:00-07:37

    The instructor continues to solve the problem. For the circular arrangement of 13 distinct stones, he writes the formula '13! / 13', which simplifies to '12!'. He then moves to the second case (b), where the stones are identical within their colors. He writes the formula for the number of distinct arrangements as '13! / (5! * 6! * 3!)'. He then applies the circular arrangement correction by dividing this result by 13, writing the final formula as '13! / (5! * 6! * 3! * 13)'. He explains that this accounts for the rotational symmetry of the necklace. The video ends with a 'Thanks for Watching' screen.

The video provides a clear, step-by-step explanation of how to solve a classic permutation problem involving a circular arrangement. It begins by establishing the fundamental difference between permutation and combination. The core of the lesson is a worked example of arranging a necklace with colored stones. The instructor methodically breaks down the problem into two cases: one with distinct stones and one with identical stones of the same color. For the distinct case, he applies the formula for circular permutations (n!/n). For the case with identical items, he uses the multinomial coefficient (n! / (n1! * n2! * ... * nk!)) and then applies the circular correction. The visual aids, including the whiteboard calculations and the initial title card, effectively reinforce the concepts being taught.

Loading lesson…