lordmoma / cracking-coding-questions-by-patterns Goto Github PK

View Code? Open in Web Editor NEW

This repo helps us sharpen our algorithms and problem-solving skills with the minimum time required. You need to have a basic understanding of common data-structures like Array, LinkedList, HashMap, Stack, Queue, Heap, and Graph. And you should also be familiar with Recursion and Big-O.

HTML 100.00%

cracking-coding-questions-by-patterns's Introduction

Cracking-Coding-Questions-by-Patterns

Patterns:

Sliding Window
Two Pointers
Fast — Slow pointers
Merge Intervals
Cyclic Sort
In-place Reversal of a LinkedList
Tree Breadth First Search
Tree Depth First Search
Two Heaps
Subsets
Modified Binary Search
Bitwise XOR
Top K Elements
K-way merge
0 or 1 Knapsack (Dynamic Programming)
Topological Sort (Graph)
Others

With the above Repo at hand, you can either use LeetCode or any IDE or terminal to practice these questions.

Tips:

For first time programmers:

Think and look for insights online for the first 30 minutes, if it still does not work. Check my solutions! Don’t be ashamed and don’t waste time on thinking too much like I used to.

For proficient programmers:

Always think and try for around 10–15 min, if not working check my solutions.

Time your coding durations, make sure easy and medium questions don’t pass 20 min and hard 35 min.

Recommend Projects

lordmoma / cracking-coding-questions-by-patterns Goto Github PK