Please subscribe to the official Codeforces channel in Telegram via the link ×

Xor and String classic problems

Revision en1, by Frez, 2016-05-09 21:46:27

What's the best algorithms for these below problems?

  • Subarray with Max Xor ?

  • Subsequence with Max Xor ?

  • Longest Subarray among those have Max Xor ?

  • Longest Subsequence among those have Max Xor ?

  • Can we use each algorithm for Min Xor , too ?

  • Longest Common Substring between two strings ?

Tags xor, #strings, classic


  Rev. Lang. By When Δ Comment
en1 English Frez 2016-05-09 21:46:27 348 Initial revision (published)