<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Strings on MyBearIsYellow</title>
		<link>https://www.mybearisyellow.me/tags/strings/</link>
		<description>Recent content in Strings on MyBearIsYellow</description>
		<generator>Hugo</generator>
		<language>fr-FR</language>
		
			<managingEditor>rajekevin@hotmail.fr (MyBearIsYellow)</managingEditor>
		
		
			<webMaster>rajekevin@hotmail.fr (MyBearIsYellow)</webMaster>
		
		
			<copyright>© 2026 MyBearIsYellow</copyright>
		
		
			<lastBuildDate>Thu, 30 Jul 2026 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://www.mybearisyellow.me/tags/strings/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Longest Common Prefix</title>
				<link>https://www.mybearisyellow.me/algorithmes/longest-common-prefix/</link>
				<pubDate>Thu, 30 Jul 2026 00:00:00 +0000</pubDate><author>rajekevin@hotmail.fr (MyBearIsYellow)</author>
				<guid>https://www.mybearisyellow.me/algorithmes/longest-common-prefix/</guid>
				<description>Trouve le plus long préfixe commun à toutes les chaînes d&amp;rsquo;un tableau. Ex : [&amp;ldquo;flower&amp;rdquo;,&amp;ldquo;flow&amp;rdquo;,&amp;ldquo;flight&amp;rdquo;] → &amp;ldquo;fl&amp;rdquo;. S&amp;rsquo;il n&amp;rsquo;y en a pas, renvoie &amp;ldquo;&amp;rdquo;.</description>
			</item>
			<item>
				<title>Roman to Integer</title>
				<link>https://www.mybearisyellow.me/algorithmes/roman-to-integer/</link>
				<pubDate>Thu, 30 Jul 2026 00:00:00 +0000</pubDate><author>rajekevin@hotmail.fr (MyBearIsYellow)</author>
				<guid>https://www.mybearisyellow.me/algorithmes/roman-to-integer/</guid>
				<description>Convertis un nombre romain (I, V, X, L, C, D, M) en entier. Subtilité : IV = 4 et IX = 9 — un symbole plus petit AVANT un plus grand se soustrait.</description>
			</item>
	</channel>
</rss>
