Tag Archives: LeetCode

LeetCode – 697. Degree of an Array

Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. Your task is to find the smallest possible length of a (contiguous) subarray of nums, … Continue reading

Posted in Algorithm&DataStructure, Uncategorized | Tagged , , , | Leave a comment

LeetCode – 308. Range Sum Query 2D – Mutable

Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). The above rectangle (with the red border) is defined by (row1, col1) … Continue reading

Posted in Algorithm&DataStructure, Uncategorized | Tagged | Leave a comment

Programming Reflection May 17

1. Array is easy to index specific element with index, it’s easier to calculate the difference between different elements than linked list. 2. LeetCode Trap Rain Water problem: iterate left and right elements for each element in the input array, … Continue reading

Posted in CS Research&Application, Intern&Job, IT, Uncategorized | Tagged , , , | Leave a comment

Leet Code Summary and Reflection

  Array Tips: keep two points and shrink from left and right to center, check to meet certain requirement (sum equals a target number) until left index is over right one. Problems: Two Sum, 3Sum, 3Sum Closest, 4Sum, etc.   … Continue reading

Posted in CS Research&Application, Intern&Job, IT, Uncategorized | Tagged , , | Leave a comment