Today I Learned(TIL) Wiki

📚 Today I Learned. Records of what I learned daily.

Algorithms

Data Structure I

• [LeetCode] 217. Contains Duplicate
• [LeetCode] 53. Maximum Subarray
• [LeetCode] 1. Two Sum
• [LeetCode] 88. Merge Sorted Array
• [LeetCode] 350. Intersection of Two Arrays II
• [LeetCode] 121. Best Time to Buy and Sell Stock
• [LeetCode] 566. Reshape the Matrix
• [LeetCode] 36. Valid Sudoku
• [LeetCode] 74. Search a 2D Matrix
• [LeetCode] 387. First Unique Character in String
• [LeetCode] 383. Ransom Note
• [LeetCode] 242. Valid Anagram
• [LeetCode] 141. Linked List Cycle
• [LeetCode] 21. Merge Two Sorted Lists
• [LeetCode] 203. Remove Linked List Elements
• [LeetCode] 206. Reverse Linked List
• [LeetCode] 83. Remove Duplicates from Sorted List
• [LeetCode] 20. Valid Parentheses
• [LeetCode] 232. Implement Queue using Stacks
• [LeetCode] 144. Binary Tree Preorder Traversal
• [LeetCode] 94. Binary Tree Inorder Traversal
• [LeetCode] 145. Binary Tree Postorder Traversal
• [LeetCode] 102. Binary Tree Level Order Traversal
• [LeetCode] 104. Maximum Depth of Binary Tree
• [LeetCode] 101. Symmetric Tree
• [LeetCode] 226. Invert Binary Tree
• [LeetCode] 112. Path Sum
• [LeetCode] 700. Search in a Binary Search Tree
• [LeetCode] 701. Insert into a Binary Search tree
• [LeetCode] 98. Validate Binary Search Tree
• [LeetCode] 653. Two Sum IV - Input is a BST
• [LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree

Data Structure II

• [LeetCode] 136. Single Number
• [LeetCode] 169. Majority Element
• [LeetCode] 15. 3Sum
• [LeetCode] 75. Sort Colors
• [LeetCode] 56. Merge Intervals
• [LeetCode] 706. Design HashMap
• [LeetCode] 119. Pascal's Triangle II
• [LeetCode] 48. Rotate Image
• [LeetCode] 59. Spiral Matrix II
• [LeetCode] 240. Search a 2D Matrix II
• [LeetCode] 435. Non-overlapping Intervals
• [LeetCode] 334. Increasing Triplet Subsequence
• [LeetCode] 238. Product of Array Except Self
• [LeetCode] 560. Subarray Sum Equals K
• [LeetCode] 415. Add Strings
• [LeetCode] 409. Longest Palindrome
• [LeetCode] 290. Word Pattern
• [LeetCode] 763. Partition Labels
• [LeetCode] 49. Group Anagrams
• [LeetCode] 43. Multiply Strings
• [LeetCode] 187. Repeated DNA Sequences
• [LeetCode] 5. Longest Palindromic String
• [LeetCode] 82. Remove Duplicates from Sorted List II
• [LeetCode] 24. Swap Nodes in Pairs
• [LeetCode] 707. Design Linked List
• [LeetCode] 25. Reverse Nodes in k-Group
• [LeetCode] 143. Reorder List
• [LeetCode] 155. Min Stack
• [LeetCode] 1249. Minimum Remove to Make Valid Parentheses
• [LeetCode] 1823. Find the Winner of the Circular Game
• [LeetCode] 108. Convert Sorted Array to Binary Search Tree
• [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
• [LeetCode] 103. Binary Tree Zigzag Level Order Traversal
• [LeetCode] 199. Binary Tree Right Side View
• [LeetCode] 113. Path Sum II
• [LeetCode] 450. Delete Node in a BST
• [LeetCode] 230. Kth Smallest Element in a BST
• [LeetCode] 173. Binary Search Tree Iterator
• [LeetCode] 236. Lowest Common Ancestor of a Binary Tree
• [LeetCode] 297. Serialize and Deserialize Binary Tree
• [LeetCode] 997. Find a Town Judge
• [LeetCode] 1557. Minimum Number of Vertices to Reach All Nodes
• [LeetCode] 841. Key and Rooms
• [LeetCode] 215. Kth Largest Element in Array
• [LeetCode] 451. Sort Characters By Frequency
• [LeetCode] 973. K Closest Points to Origin
• [LeetCode] 1309. Decrypt String from Alphabet to Integer Mapping

Top Interview Questions 100

• [LeetCode] 2. Add Two Numbers
• [LeetCode] 347. Top K Frequent Elements
• [LeetCode] 412. Fizz Buzz
• [LeetCode] 191. Number of 1 Bits
• [LeetCode] 208. Implement Trie (Prefix Tree)
• [LeetCode] 344. Reverse String
• [LeetCode] 237. Delete Node in a Linked List
• [LeetCode] 14. Longest Common Prefix
• [LeetCode] 26. Remove Duplicates from Sorted Array
• [LeetCode] 66. Plus One
• [LeetCode] 69. Sqrt(x)
• [LeetCode] 70. Climbing Stairs
• [LeetCode] 125. Valid Palindrome
• [LeetCode] 160. Intersection of Two Linked Lists
• [LeetCode] 171. Excel Sheet Column Number

Programming Skills I

• [LeetCode] 1523. Count Odd Numbers in an Interval Range
• [LeetCode] 1491. Average Salary Excluding the Minimum and Maximum Salary
• [LeetCode] 1281. Subtract the Product and Sum of Digits of an Integer
• [LeetCode] 976. Largest Perimeter Triangle
• [LeetCode] 1779. Find Nearest Point That Has the Same X or Y Coordinate
• [LeetCode] 1822. Sign of the Product of an Array
• [LeetCode] 1502. Can Make Arithmetic Progression From Sequence
• [LeetCode] 202. Happy Number
• [LeetCode] 1790. Check if One String Swap Can Make Strings Equal
• [LeetCode] 589. N-ary Tree Preorder Traversal
• [LeetCode] 496. Next Greater Element I
• [LeetCode] 1232. Check If It Is a Straight Line
• [LeetCode] 1588. Sum of All Odd Length Subarrays
• [LeetCode] 283. Move Zeroes
• [LeetCode] 1672. Richest Customer Wealth
• [LeetCode] 1572. Matrix Diagonal Sum
• [LeetCode] 1768. Merge Strings Alternately
• [LeetCode] 1678. Goal Parser Interpretation
• [LeetCode] 389. Find the Difference

LeetCode 75

• [LeetCode] 1768. Merge Strings Alternately
• [LeetCode] 1071. Greatest Common Divisor of Strings
• [LeetCode] 1431. Kids With the Greatest Number of Candies
• [LeetCode] 605. Can Place Flowers
• [LeetCode] 345. Reverse Vowels of a String
• [LeetCode] 151. Reverse Words in a String
• [LeetCode] 238. Product of Array Except Self
• [LeetCode] 334. Increasing Triplet Subsequence
• [LeetCode] 443. String Compression
• [LeetCode] 283. Move Zeroes
• [LeetCode] 392. Is Subsequence

LeetCode Top 150 Interview

• [[LeetCode] 88. Merge Sorted Array](./LeetCode/Top Interview 150/leetcode-88.md)
• [[LeetCode] 27. Remove Element](./LeetCode/Top Interview 150/leetcode-27.md)
• [[LeetCode] 26. Remove Duplicates from Sorted Array](./LeetCode/Top Interview 150/leetcode-26.md)
• [[LeetCode] 80. Remove Duplicates from Sorted Array II](./LeetCode/Top Interview 150/leetcode-80.md)
• [[LeetCode] 169. Majority Element](./LeetCode/Top Interview 150/leetcode-169.md)
• [[LeetCode] 189. Rotate Array](./LeetCode/Top Interview 150/leetcode-189.md)
• [[LeetCode] 121. Best Time to Buy and Sell Stock](./LeetCode/Top Interview 150/leetcode-121.md)
• [[LeetCode] 122. Best Time to Buy and Sell Stock II](./LeetCode/Top Interview 150/leetcode-122.md)
• [[LeetCode] 55. Jump Game](./LeetCode/Top Interview 150/leetcode-55.md)
• [[LeetCode] 45. Jump Game II](./LeetCode/Top Interview 150/leetcode-45.md)
• [[LeetCode] 274. H-Index](./LeetCode/Top Interview 150/leetcode-274.md)
• [[LeetCode] 380. Insert Delete GetRandom O(1)](./LeetCode/Top Interview 150/leetcode-380.md)
• [[LeetCode] 238. Product of Array Except Self](./LeetCode/Top Interview 150/leetcode-238.md)
• [[LeetCode] 134. Gas Statiion](./LeetCode/Top Interview 150/leetcode-134.md)
• [[LeetCode] 135. Candy](./LeetCode/Top Interview 150/leetcode-135.md)
• [[LeetCode] 42. Trapping Rain Water](./LeetCode/Top Interview 150/leetcode-42.md)
• [[LeetCode] 12. Integer to Roman](./LeetCode/Top Interview 150/leetcode-12.md)
• [[LeetCode] 14. Longest Common Prefix](./LeetCode/Top Interview 150/leetcode-14.md)
• [[LeetCode] 13. Roman to Integer](./LeetCode/Top Interview 150/leetcode-13.md)
• [[LeetCode] 58. Length of Last Word](./LeetCode/Top Interview 150/leetcode-50.md)
• [[LeetCode] 151. Reverse Words in a String](./LeetCode/Top Interview 150/leetcode-151.md)
• [[LeetCode] 6. Zigzag Conversion](./LeetCode/Top Interview 150/leetcode-6.md)
• [[LeetCode] 28. Find the Index of the First Occurence in a String](./LeetCode/Top Interview 150/leetcode-28.md)
• [[LeetCode] 68. Text Justification](./LeetCode/Top Interview 150/leetcode-68.md)
• [[LeetCode] 125. Valid Palindrome](./LeetCode/Top Interview 150/leetcode-125.md)
• [[LeetCode] 392. Is Subsequence](./LeetCode/Top Interview 150/leetcode-392.md)
• [[LeetCode] 167. Tow Sum II - Input Array Is Sorted](./LeetCode/Top Interview 150/leetcode-167.md)
• [[LeetCode] 11. Container With Most Water](./LeetCode/Top Interview 150/leetcode-11.md)
• [[LeetCode] 15. 3Sum](./LeetCode/Top Interview 150/leetcode-15.md)
• [[LeetCode] 209. Minimum Size Subarray Sum](./LeetCode/Top Interview 150/leetcode-209.md)
• [[LeetCode] 3. Longest Substring Without Repeating Characters](./LeetCode/Top Interview 150/leetcode-3.md)
• [[LeetCode] 36. Valid Sudoku](./LeetCode/Top Interview 150/leetcode-36.md)
• [[LeetCode] 54. Spiral Matrix](./LeetCode/Top Interview 150/leetcode-54.md)
• [[LeetCode] 383. Ransom Note](./LeetCode/Top Interview 150/leetcode-383.md)
• [[LeetCode] 205. Isomorphic Strings](./LeetCode/Top Interview 150/leetcode-205.md)
• [[LeetCode] 290. Word Pattern](./LeetCode/Top Interview 150/leetcode-290.md)
• [[LeetCode] 242. Valid Anagram](./LeetCode/Top Interview 150/leetcode-242.md)
• [[LeetCode] 49. Group Anagrams](./LeetCode/Top Interview 150/leetcode-49.md)
• [[LeetCode] 1. Two Sum](./LeetCode/Top Interview 150/leetcode-1.md)
• [[LeetCode] 202. Happy Number](./LeetCode/Top Interview 150/leetcode-202.md)
• [[LeetCode] 219. Contains Duplicate II](./LeetCode/Top Interview 150/leetcode-219.md)
• [[LeetCode] 128. Longest Consecutive Sequence](./LeetCode/Top Interview 150/leetcode-128.md)
• [[LeetCode] 228. Summary Ranges](./LeetCode/Top Interview 150/leetcode-228.md)
• [[LeetCode] 20. Valid Parentheses](./LeetCode/Top Interview 150/leetcode-20.md)
• [[LeetCode] 56. Merge Intervals](./LeetCode/Top Interview 150/leetcode-56.md)
• [[LeetCode] 57. Insert Interval](./LeetCode/Top Interview 150/leetcode-57.md)
• [[LeetCode] 452. Minimum Number of Arrows to Burst Balloons](./LeetCode/Top Interview 150/leetcode-452.md)
• [[LeetCode] 71. Simplify Path](./LeetCode/Top Interview 150/leetcode-71.md)
• [[LeetCode] 155. Min Stack](./LeetCode/Top Interview 150/leetcode-155.md)
• [[LeetCode] 150. Evaluate Reverse Polish Notation](./LeetCode/Top Interview 150/leetcode-150.md)
• [[LeetCode] 224. Basic Calculator](./LeetCode/Top Interview 150/leetcode-224.md)
• [[LeetCode] 141. Linked List Cycle](./LeetCode/Top Interview 150/leetcode-141.md)
• [[LeetCode] 30. substring with Concatenation of All Words](./LeetCode/Top Interview 150/leetcode-30.md)
• [[LeetCode] 2. Add Two Numbers](./LeetCode/Top Interview 150/leetcode-2.md)
• [[LeetCode] 21. Merge Two Sorted Lists](./LeetCode/Top Interview 150/leetcode-21.md)
• [[LeetCode] 138. Copy List with Random Pointer](./LeetCode/Top Interview 150/leetcode-138.md)
• [[LeetCode] 92. Reverse Linked List II](./LeetCode/Top Interview 150/leetcode-92.md)
• [[LeetCode] 82. Remove Duplicates from Sorted List II](./LeetCode/Top Interview 150/leetcode-82.md)
• [[LeetCode] 76. Minimum Window Substring](./LeetCode/Top Interview 150/leetcode-76.md)
• [[LeetCode] 48. Rotate Image](./LeetCode/Top Interview 150/leetcode-48.md)
• [[LeetCode] 73. Set Matrix Zeroes](./LeetCode/Top Interview 150/leetcode-73.md)
• [[LeetCode] 289. Game of Life](./LeetCode/Top Interview 150/leetcode-289.md)
• [[LeetCode] 25. reverse Nodes in k-Group](./LeetCode/Top Interview 150/leetcode-25.md)
• [[LeetCode] 19. Remove Nth Node From End of List](./LeetCode/Top Interview 150/leetcode-19.md)
• [[LeetCode] 61. Roate List](./LeetCode/Top Interview 150/leetcode-61.md)
• [[LeetCode] 86. Partition List](./LeetCode/Top Interview 150/leetcode-86.md)
• [[LeetCode] 146. LRU Cache](./LeetCode/Top Interview 150/leetcode-146.md)
• [[LeetCode] 104. Maximum Depth of Binary Tree](./LeetCode/Top Interview 150/leetcode-104.md)
• [[LeetCode] 100. Same Tree](./LeetCode/Top Interview 150/leetcode-100.md)
• [[LeetCode] 226. Invert Binary Tree](./LeetCode/Top Interview 150/leetcode-226.md)
• [[LeetCode] 101. Symmetric Tree](./LeetCode/Top Interview 150/leetcode-101.md)
• [[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal](./LeetCode/Top Interview 150/leetcode-105.md)
• [[LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal](./LeetCode/Top Interview 150/leetcode-106.md)
• [[LeetCode] 117. Populating Next Right Pointers in Each Node II](./LeetCode/Top Interview 150/leetcode-117.md)
• [[LeetCode] 114. Flatten Binary Tree to Linked List](./LeetCode/Top Interview 150/leetcode-114.md)
• [[LeetCode] 112. Path Sum](./LeetCode/Top Interview 150/leetcode-112.md)
• [[LeetCode] 129. Sum Root to Leaf Numbers](./LeetCode/Top Interview 150/leetcode-129.md)
• [[LeetCode] 124. Binary Tree Maximum Path Sum](./LeetCode/Top Interview 150/leetcode-124.md)
• [[LeetCode] 173. Binary Search Tree Iteratior](./LeetCode/Top Interview 150/leetcode-173.md)
• [[LeetCode] 222. Count Complete Tree Nodes](./LeetCode/Top Interview 150/leetcode-222.md)
• [[LeetCode] 236. Lowest Common Ancestor of a Binary Tree](./LeetCode/Top Interview 150/leetcode-236.md)
• [[LeetCode] 199. Binary Tree Right Side View](./LeetCode/Top Interview 150/leetcode-199.md)
• [[LeetCode] 637. Average of Levels in Binary Tree](./LeetCode/Top Interview 150/leetcode-637.md)
• [[LeetCode] 102. Binary Tree Level Order Traversal](./LeetCode/Top Interview 150/leetcode-102.md)
• [[LeetCode] 103. Binary Tree Zigzag Level Order Traversal](./LeetCode/Top Interview 150/leetcode-103.md)
• [[LeetCode] 530. Minimum Absolute Difference in BST](./LeetCode/Top Interview 150/leetcode-530.md)
• [[LeetCode] 230. Kth Smallest Element in a BST](./LeetCode/Top Interview 150/leetcode-230.md)
• [[LeetCode] 98. Validate Binary Search Tree](./LeetCode/Top Interview 150/leetcode-98.md)
• [[LeetCode] 200. Number of Islands](./LeetCode/Top Interview 150/leetcode-200.md)
• [[LeetCode] 130. Surrounded Regions](./LeetCode/Top Interview 150/leetcode-130.md)
• [[LeetCode] 133. Clone Graph](./LeetCode/Top Interview 150/leetcode-133.md)
• [[LeetCode] 399. Evaluate Division](./LeetCode/Top Interview 150/leetcode-399.md)
• [[LeetCode] 207. Course Schedule](./LeetCode/Top Interview 150/leetcode-207.md)

HTML

• Improve accessibility : sr-only class and <del>

JavaScript

• How to Make Lazy Evaluated Function with Generator Syntax
• Implement the Sieve of Eratosthenes with Generator
• Create a 2D Array in JavaScript

React Native

• Setting Up React Native + TypeScript Project with Absolute Path Module Imports