Assume you have an array of length n initialized with all 0's and are given k update operations. Each operation is represented as a triplet: [startIndex, endIndex, inc] which increments each element of

https://leetcode.com/problems/k-empty-slots/Solution We can come up with a naive solution: let a is array store the state of bulks, a[i] = 1/0 ie bulk i is on/off

https://leetcode.com/problems/exam-room/Solution For each new student, there are 3 cases: seat at 0: distance = distance to first seated student seat at n-1: distance = distance to last seated student seat

https://leetcode.com/problems/palindrome-number/Solution The easiest way is to convert n to string s, and compare s to the reverse(s) bool isPalindrome(int x) { string s = to_string(s); string

https://leetcode.com/problems/longest-substring-without-repeating-characters/Solution 2 pointers - snake technique int lengthOfLongestSubstring(string s) { int n = s.size(); if (n == 0) return 0; int res = 1; map<char, int> count;

https://leetcode.com/problems/reverse-linked-list/Solution Let prev and cur be 2 continuous items of the list: prev -> cur We cannot just assign cur->next = prev, because we will lose

https://leetcode.com/problems/add-two-numbers-ii/Different from LC 2, in this problem, the most significant digit comes first in the list. One easy solution is to reverse 2 lists and apply the algorithm

https://leetcode.com/problems/add-two-numbers/Solution As the head of list is the last digit of the number, we can add 2 lists by iterating from heads of 2 lists. The only thing

https://leetcode.com/problems/two-sum/Solution For each item i in the given array, we need to know whether there is an item j (j < i) such that a[i] + a[j]

The pattern of question can be solved by Two Pointers algorithms is Return the length of the longest contiguous subarray [u,v] of array A that [u,v] meets the requirement X. With