Tech Interview Preparation Repository

The goal is to understand a diverse set of problems to increase problem-solving capabilites with programming.

Ideal Program Structure:

A personalized program can be structured as follows:

Week 1. Arrays and Strings

• Valid Parenthesis
• Reverse Vowels in String
• Isomorphic Strings
• Longest Substring Without Repeating Characters
• Median of Two Sorted Arrays

Week 2. Binary Trees and Linked Lists

• Merge two sorted lists
• Balanced binary tree
• Palindrome linked lists
• Remove nth node from linked list
• Kth smallest element in BST

Week 3. Dynamic Programming & Greedy Algorithms

• Climbing stairs
• Best time to buy and sell stock
• House robber
• Coin change
• Longest palindromic substring

Week 4. Graphs and Review

• Validate BST
• Rotate Image
• Course Schedule
• Delete Node BST
• Merge Intervals

Order of Time Complexity (Least to Most Optimal):

O(n^2) | Quadratic Time

O(n log n)

O(n) | Linear Time

O(log n) | Logarithmic Time

O(1) | Constant Time

Resources Used:

https://medium.com/@helen_zhang/the-4-week-plan-to-nailing-your-next-coding-technical-interview-internship-level-c5368c47e1d

https://leetcode.com/explore/featured/card/top-interview-questions-easy/92/array/646/

https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/

https://www.geeksforgeeks.org/python-programming-examples/

File GeeksForGeeks Scratchpad.py contains solutions to questions from GeeksForGeeks.com