Ha, Knuth-Morris-Pratt (KMP) algoritmi qisman mos keladigan jadvalni hisoblash uchun oldindan ishlov berish bosqichini o'z ichiga oladi, bu naqshning har bir prefiksining eng uzun o'z sufikslarini saqlaydigan massivdir. KMP algoritmi ba'zan Knuth-Morris-Pratt-Powell algoritmi deb nomlanadi, chunki u mustaqil ravishda Jeyms H. Morris va Vaughan Pratt tomonidan kashf etilgan va keyinchalik Donald Knuth tomonidan soddalashtirilgan va nashr etilgan.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence