LeetCode Study Note

LeetCode Study Note

Tags
Computer Science
Interview
Published
July 9, 2025
Author
Jason Kim

Syntax

// Array Array.Sort(nums); Array.Sort(nums, (x, y) => x.CompareTo(y)); var nums = new [] { 0, 1, 2 }; var sum = nums[0..1].Sum(); var sum = nums[..2].Sum(); // Stack var s = new Stack<int>(); s.Push(1); s.Pop(); // Queue var q = new Queue<int>(); q.Enqueue(1); q.Dequeue(); // HashSet var set = new HashSet<int>(); set.Add(1); set.Remove(1); set.Contains(1); // Dictionary var dic = new Dictionary<string, int>(); dic.Add("1", 1); dic.Remove("1"); dic.ContainsKey("1"); dic.ContainsValue(1); // SortedList var descendingComparer = Comparer<string>.Create((x, y) => y.CompareTo(x)); var sortedList = new SortedList<string, string>(descendingComparer); sortedList.Add("key", "c"); var item1 = sortedList["key"] var item2 = sortedList.ElementAt(0); sortedList.Remove(0); sortedList.RemoveAt(0); // PriorityQueue var pq = new PriorityQueue<string, int>(); pq.Enqueue("a", 3); pq.Dequeue();

Daily LeetCode 75

Array / String

Two Pointers

Sliding Window

Prefix Sum

 

Hash Map / Set

 

Queue

 

Linked List