Research: 8:30am – 11: 30am meet with Var need to figure out the advantage of our algorithm Try to update VS15 to get DirectX SDK 3:00 pm – 6:00 pm Variance sampling TAA Write paper Tomorrow: Read push-pull paper Read Europe Log polar paper think about ellipse log-polar Leetcode: https://leetcode.com/problems/integer-break/description/


Decouple shading rate & visibility rate from pixels: allow for space for anti-aliasing and coarse pixel shading. Texel Shading (shading rate reduction): We show performance improvements in three ways. First, we show some improvement for the “small triangle problem”. Second, we reuse shading results from previous frames. Third, we enable dynamic spatial shading rate choices, … Read more08/18/2017

442. Find All Duplicates in an Array

Description: https://leetcode.com/problems/find-all-duplicates-in-an-array/description/ Code:  

Time & Space: O(n) & O(1)

448. Find All Numbers Disappeared in an Array

Description: https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/ Code:  

Code for fastest algorithm:  

Time & Space: O(n) & O(1)

495. Teemo Attacking

Description: https://leetcode.com/problems/teemo-attacking/description/ Code:  

Time & Space: O(n) & O(1)

532. K-diff Pairs in an Array

Description: https://leetcode.com/problems/k-diff-pairs-in-an-array/description Code:

Time & Space: O(nlog(n)) & O(n)