Krammer's blog
Krammer's blog
  • About
  • Post
  • Contact
Editorial: LeetCode 1665 Minimum Initial Energy to Finish Tasks
Leet code Editorial: LeetCode 1665 Minimum Initial Energy to Finish Tasks
By Krammer 21 November 2020

https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/ from Akuna Capital

Thinking process:

read more
Editorial: LeetCode 1658 Minimum Operations to Reduce X to Zero
Leet code Editorial: LeetCode 1658 Minimum Operations to Reduce X to Zero
By Krammer 14 November 2020

https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/ from Google

Thinking process:

read more
Editorial: LeetCode 1655 Distribute Repeating Integers
Leet code Editorial: LeetCode 1655 Distribute Repeating Integers
By Krammer 14 November 2020

https://leetcode.com/problems/distribute-repeating-integers/ from Google

Thinking process:

read more
Editorial: LeetCode 1649 Create Sorted Array Through Instructions
Leet code Editorial: LeetCode 1649 Create Sorted Array Through Instructions
By Krammer 08 November 2020

https://leetcode.com/problems/create-sorted-array-through-instructions/ from Akuna Capital

Thinking process:

read more
Editorial: LeetCode 1648 Sell Diminishing Valued Colored Balls
Leet code Editorial: LeetCode 1648 Sell Diminishing Valued Colored Balls
By Krammer 08 November 2020

https://leetcode.com/problems/sell-diminishing-valued-colored-balls/ from Groupon

Thinking process:

read more
Editorial: LeetCode 1642 Furthest Building You Can Reach
Leet code Editorial: LeetCode 1642 Furthest Building You Can Reach
By Krammer 31 October 2020

https://leetcode.com/problems/furthest-building-you-can-reach/ from Google

Thinking process:

read more

About Me

I’m a Taiwanese software engineer who is working in Seattle, US now.

Know More

Category

  • Binarysearch.com
  • Cmu
  • Leetcode
  • Tool
  • Website

Tag

  • Amplify
  • Array
  • Aws
  • Backtracking
  • Bag of words
  • Bfs
  • Binary indexed tree
  • Binary search
  • Bit manipulation
  • Bundle adjustment
  • Cv
  • Deque
  • Design
  • Dfs
  • Dijkstras algorithm
  • Dp
  • Dynamic programming
  • Faster rcnn
  • Graph
  • Greedy
  • Harris corner
  • Hash table
  • Heap
  • Homography
  • Hough transform
  • Hugo
  • Linked list
  • Lucas kanade
  • Math
  • Meet in the middle
  • Minimum spanning tree
  • Multiset
  • Neural network
  • Nvdia
  • Object dection
  • Object tracking
  • Ocr
  • Pose estimation
  • Ransac
  • Recursion
  • Self driving car
  • Sliding window
  • Sort
  • Stack
  • String
  • Svc
  • Sweep line
  • Tensorflow
  • Tow pointers
  • Tree
  • Trie
  • Two pointers
  • Union find
  • Vim

Social

  • ««
  • «
  • 1
  • 2
  • 3
  •  … 
  • 10
  • 11
  • 12
  •  … 
  • 15
  • »
  • »»
Krammer's blog
Contact Me
  • Seattle, US
  • krammer0@gmail.com
Social Contacts
  • github
  • linkedin
Categories
  • Binarysearch.com
  • Cmu
  • Leetcode
  • Tool
  • Website
Quick Links
  • About
  • Post
  • Contact
| copyright © 2020 Krammer All Rights Reserved |