Skip to content

4us9/Technical-Interview-Prep

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 

Repository files navigation

Technical-Interview-Prep

This repository is a collection of coding problems that I have solved to prepare for technical (SWE) interviews, and just to solve puzzles.

Questions are completed in Python.

Topics from Neetcode.io and Leetcode: Arrays & Hashing, Two Pointers, Sliding Window, Stack, Binary Search, Linked List, Trees, Tries, Heap/Priority Queue, Backtracking, Graphs, 1-D Dynamic Programming (DP), 2-D Dynamic Programming (DP), Greedy, Intervals, Math & Geometry, Bit Manipulation, Matrix, Sorting, and Prefix Sum.

Order

1. Leetcode NeetCode

Array and Hasing

# Name Difficulty Solution Time
1 Two Sum Easy Link O(n)
102 BFS - Binary Tree Medium Link O(n)

2. Cracking The Coding Interview (6th Ed)

# Name Difficulty Solution Time Topic
1 Big-O Example 1 Easy [Link](Github Link)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages