Competitive-programming

Process

1. Do a problem with optimal solution.
2. Verify if it’s an optimal solution after submitting.
3. Solve it using optimal solution.

Array

• Two Sum Problem - Solution
• Best Time to Buy and Sell Stock - Solution
• Contains duplicate - Solution
• Product of array except self - Solution

Binary

• Sum of Two Integers - Solution
• Number of 1 Bits - Solution
• Counting Bits - Solution

Dynamic Programming

• Climbing Stairs - Solution
• Coin Change - Solution
• Longest Increasing Subsequence - Solution
• Longest Common Subsequence - Solution

Google Kickstart Test Round 1 - 2022

• Sample - Solution
• Centauri Prime - Solution

Graph

• Clone Graph -resubmit - Solution
• Course Schedule -resubmit - Solution
• Find Redundant Connection - Solution
• Pacific Atlantic Water Flow - Solution

Interval

• Insert Interval - Solution

Linked List

• Reverse a Linked List - Solution
• Detect Cycle in a Linked List - Solution

Matrix

• Set Matrix Zeroes - Solution
• Spiral Matrix - Solution

String

• Longest Substring Without Repeating Characters - Solution

Tree

• Maximum Depth of Binary Tree - Solution
• Same tree - Solution
• Invert/Flip Binary Tree - Solution

Resources:

Linked List

• Detect cycle using slow-and-fast-pointers