CT26586

Omkar Counts the charms

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

In the forest village of Briarthorn, Omkar the log keeper keeps careful count of the charms. plan the beacon maintenance rota, every figure matters. Task: Print the length of the longest common prefix of s and t. Input format: Two lines: string s, then string t. Output format: Print the common prefix length. Constraints: 1 <= |s|,|t| <= 1772.

Example 1:

Input: qoytepjeehksyazvdhtxplkywhddvpyabgpkszfskooevjlchmtkdveyybinoxogvhfmhqyynwnlhhravklmhwwmilelgwdphwmfmihmtojyusbfyountmoukeinnsslofguumzimepamymqjmbmgnqsrqxyhkbsqopopmgunvwkcbdmhesbwdhbklebaustozchzkpxmfitjnebjczdvzxrqqxvcqlvynfhgzeeyjdouewddhxpcsadjyvzokukcmyflhyfgjjzijmscehdsgzesvftfqrcxgzvaaxdputgowuwgktyaegjkkbvandypmolwiohyineikmumejgjxehahpludyexvrkekwivirlzdwebyxgfjnzjocpnudcutsfsacytsbtyvzkzaujssmdgxakeswlvpooghtjuecsorkrykyqxfblqghtizcpupypvefdyoclxnriuzcfpagiohbaoitdfmfkndsuccithobshewojjg qoytepjeehksyazvdhtxplkywhddvpyabgpkszfskooevjlchmtkdveyybinoxogvhfmhqyynwnlhhravklmhwwmilelgwdphwmfmihmtojyusbfyountmoukeinnsslofguumzimepamymqjmbmgnqsrqxyhkbsqopopmgunvwkcbdmhesbwdhbklebaustozchzkpxmfivhme
Output: 203

Example 2:

Input: ecmcxefjwfbhymkmtmegqxtaktguidmzyvbjlqqkfvgkohnryxkkajsarwqfhiarnlztptcljzhkiainwdhkcuqpwfqyhvwydlcdfjfhpadmxmjipmccjjwjnwmoeyrqytaoyckbezcdumtrxzpfbckbmpbzzbkakndetvrnhsmwguaonwbymrrdmccwmbvmxrutqmlmogtlckmjwjdxtuuzixaqsmhouuhjopmpcihzsprvniiqtdapancwj ecmcxefjwfbhymkmtmegqxtaktguidmzyvbjlqqkfvgkohnryxkkajsarwqfhiarnlztptcljzhkiainwdhkcuqpwfqyhvwydlcdfjfhpadmxmjipmccjjwjnwmoeyrqytaoyckbezcdumtrxzpfbckbmpbzzbkakndetvrnhsmwguaonwbymrrdmccwmbvmxrutqmlmogtlckmjwjdxtuutvwx
Output: 215

Example 3:

Input: awcinulhywgrnzoazckrvaljrfuxasdzkafsyvvugdiuascsdlkjbbtgggeeyqbtbgizexxfbmkrhftjocsddsjbwqoopgbitgajltkhqygmxnqekslmhowomoffpvpjginuykouzvsxdmkfjvqgszlkpstoymcnglsgqozyapavvrenteratxvzwlbepzhialagzrdotdogkaicptonbsoeedwzlkaoqzltfvmtfoyfxbfzqxoddhwpcbojiwgsxbixdvlfnkuietpfcpmnwvzmfkownnhqipavkygmxpyedgenjyayepesrwlrdnfwqpfdbtyomknfozpjncgiqpavjficdwcirhaadlmtgklhhhbhjxynyspbyrdukyedadodtkrufaccrhuwxryiiccnspifqqyxnigglzqxbcmmciezysbopfxbxtxstnzpbgxzimnuvkssrstizhtuzlighqlprfwepcyoevemuaejlainwsjwxfgblwjnmnjnnxibzxkuswcrqbtnxhybdlvfjmunaxasnkbizsidcellzkjloflarlihnkniwfoxyjxgcaagonlecfjkganseibifpanmhrjcvylzjdaxxuipzfpirircviojupcbadkcznenzsxgvmqtfzgqmxpqxzecqnpfymhlmkkmzorenbzaqirgcsqpbjsxngcqlcpnmromyvernghqoqwogueuwxhqbewrceizdxhyvqakbrvqbpujkrpuerdfdwsrcdouaugetqrhcbvstqxbqhnrsxurobhpcqa…
Output: 0

Constraints:

1 <= |s|,|t| <= 1772.

Loading...
Test Cases:No test cases
No test cases available.
Omkar Counts the charms - EASY Coding Problem | CodeTikki