others

Image

Leetcode

1

80 questions

  • 1. Open Ended
    30 seconds
    1 pt
    Trapping rain water problem
  • 2. Open Ended
    30 seconds
    1 pt
    Repeated String Match Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1. For example, with A = "abcd" and B = "cdabcdab". Return 3, because by repeating A three times ("abcdabcdabcd"), B is a substring of it; and B is not a substring of A repeated two times ("abcdabcd").
  • 3. Open Ended
    30 seconds
    1 pt
    Rabin-Karp Algorithm
  • Answer choices
    Tags
    Answer choices
    Tags