Lewin's blog

By Lewin, 2 years ago, In English,
Fibonacci Frequency
Rainbow Road
Wildcard Words
Counter Complexity
Avoiding Adjacent
Token Tree
 
 
 
 
  • Vote: I like it
  • +80
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

lewin could you share your solution of Wildcard Words in java?

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What is test 59 in Fibonacci Frequency?

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For "Avoiding Adjacent", what is the complexity of dynamic programming solution? And was it supposed to get AC?