Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Review: Minimax Problems

Posted on January 18, 2018July 26, 2020 by braindenny

minimax problems



  • CheatSheet: Leetcode For Code Interview
  • CheatSheet: Common Code Problems & Follow-ups
Name Summary
minimax Usually solved by DP + recursive. For DP, grow from right to left. nums[i:...]

See all minimax problems: #minimax

  • Review: Minimax Problems
  • LeetCode: Stone Game III
  • LeetCode: Stone Game II
  • LeetCode: Stone Game
  • LeetCode: Predict the Winner
  • LeetCode: Nim Game
  • LeetCode: Guess the Word
  • LeetCode: Guess Number Higher or Lower II
  • LeetCode: Flip Game II
  • LeetCode: Cat and Mouse
  • LeetCode: Can I Win

See more blog posts.

linkedin
github
slack

Post Views: 7
Posted in ReviewTagged minimax, review

Post navigation

Review: GCD Problems
LeetCode: Super Pow

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #blog #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum binarysearch editdistance hashmap intervaldp knapsack monotone oodesign presum rectangle redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.