Yelnur Abdulla

No. of Contests Participated: 6

Dynamic programming

2000 to 2500 difficulty problems

Movie Snacks, Palindrome Love, Buying Order (Easy), Equate S and T, Too Many Oranges

Tree Sum is Fun !, Nice Array, Minimum Types, Lexio Swap

Hamming equivalent, Make K Most Frequent, Constant Subsequence

Same And, Friendly Binary Strings, Clothing Store, Costly Summit, Mex-P Tree (Easy)

Blocks on a Tree, Flip or Reverse

Big Difference, Placing 01 And 10