All blog posts - Page 2

Focus on time/space complexity. Master patterns like Two Pointers, Sliding Window, and Prefix Sums for solving a wide range of problems efficiently.

This is the absolute foundation. Be able to analyze the time and space complexity of any algorithm you write or discuss. Understand O(1), O(log n), O(n), O(n log n), O(n^2), O(2^n).

Know the properties of a BST. Understand the time complexity for search, insertion, and deletion. Be able to validate if a given tree is a BST.

Understand basic bitwise operators (AND, OR, XOR, NOT, shifts). Know their use cases for efficient problem-solving, such as finding a missing number, checking for powers of two, or managing sets of flags.

Explain how System.Threading.Tasks.Channels can be used to create efficient producer/consumer workflows. Compare them to other synchronization primitives like BlockingCollection.

Discuss strategies for optimizing cloud costs. Explain concepts like rightsizing instances, using spot instances, setting budgets and alerts, and tagging resources for cost allocation.

Explain how Cross-Origin Resource Sharing (CORS) works. Discuss how to configure named policies, middleware, and attributes for both permissive and restrictive scenarios.

Explain the concept of Chaos Engineering. Discuss how deliberately injecting failures into a system in a controlled way can help build confidence in its resilience.