CT27076

Ojas's Lazy inscriptions

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the ferry landing of Crosswater, Ojas studies rows of inscriptions entries. One clean number will settle the guild's oldest argument. 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| <= 1046.

Example 1:

Input: lnxdfsswtqtvogzvyusdyrdsuhhbxggrsgkdxufepklpkugxqprrrjwihdhtxuqsasyyctbcabzslcavzccrcjtzglzzlorstxobkbqopxfin lnxdfsswtqtvogzvyusdyrdsyjmpo
Output: 24

Example 2:

Input: gshkhvpfnyevcnpjpqmkikgzfftldrenubspowmojfuwywxqrrdhiumydmwwusaqsfpjgxuzzigttpxlyqanziobpydhlsgebpctariinfrjzolbegdgbnwfkwuhamogegxglhjclgupjrwkqajaaghyumdjqgvpjzlujtpuvwrjvnnnoheildmkpxumgfjlzdmvpfvirekmfwjmxejmcgxosdgvdzootungyeaocriulhiaczgxgjfbyqfsaqvfsgijtyadlurdgibwulhwrzphavmflrpmlkpiudqgnatbyurtruyjdogyowmsmkzjdnikyfpptwlwypruqjaybhecskqptgwggxgstprkbggzirfqbfxzicgpwakhewwjipncfuozjrlrtwrfhfruyksmkuvfxxhpcjeavbvvmjmevaancbpthaocwugcvpbejmnzifbiocppykbatrqzgxnoiqdgunjqqyuvvwlpdsolgmvfenaonivgdidgjisohtotupjcjqxdtnipijitvbrzytpkjglqddtxayrtaxtiwcabuiechravvbzkctshxdayukyikiwydpmefuqllncwmujdkwxjjjbjbtzmaxghobakahgvsikchsrzbzgrrifrpznefzfawycytncjosxxwtwuxuprnbcnaogtappnxahcrjlznkramsmwqbseskdoaxwnqbnixqvsjvsuiaydqoznwnqwqybjjadlzqsiyugcxwahfhpcnatztjiayodgihlwzjvlxhvbapdxjuhmfgqieuyq…
Output: 880

Example 3:

Input: ihblrwscautrvkvsjazyfmenhrtjriivrlitkniegdnskryotdwneoucvmfwphklbdawnrrjmgdqtjfildfehshgsbrtrnjzqnchbigqmwwcpnwkqvpttmxprvjqwutmxgmxzycduzbofjfmhbsypuwyxwqulclcecwhtltfurxvkpbqcyllfgxovwjanfefqbaajmdztcblwnguagoouzhefcneiewmygiluhzwbnnnffjhzvqwrqnzklfrxpdhwtvfsydornkrudjfgsqgsdlftgnqzrdtmvsousilr poyxgjdmzuliuilubnhwenjjozzelrbkyqxnmssjwlwhyqjonbwbysvkhoeizlmctqdzvztbamsumspaqzaianxcawdabveabaqzorpqjixdusdlpadrazxbuuyevybjxwfmcysoicpddyegavxilsuijekverhlnvwhmbelembitltjthwvcbnkubbisbdifzooboagzjtivzjjkxfpifvgzmjxsonmbtvigexkhuquhyipgmzymlzzwklcyrgzfvlvtbwtkcsdvgmuqrfueskomcsxauavtqoohzfdhdyhyqpgqtufudpymwwgpuziwdyosrcggwljdwjxsuwwmmbwciyhblijzvcztlvjwwjgfobnbwssehxfyvamkkkxrrhbwcogpsjehfnbweskvzlydgbfduckztftvybryhzkneujmthrrkaujsinyixdtzupahsualficunvshfxnqhcyhvheubjknwkemdahenqpuzwvxdm
Output: 0

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Ojas's Lazy inscriptions - EASY Coding Problem | CodeTikki