Search results

DSA Interview Cheatsheet

Status: Open.

#16 In sanjar-notes/dsa;

· sanjarcode opened on Sep 11, 2022

Dividing problem into "very small halves" for DnC may not always work

Status: Open.

#14 In sanjar-notes/dsa;

· sanjarcode opened on Jul 7, 2022

Programmatically + visually working with graphs

Status: Open.

#13 In sanjar-notes/dsa;

· sanjarcode opened on Jun 5, 2022

Calculating resource complexity, especially for recurrences

Status: Open.

#12 In sanjar-notes/dsa;

· sanjarcode opened on Apr 25, 2022

Calculate optimality of based on optimal substructure and overlapping subproblems

Status: Open.

#11 In sanjar-notes/dsa;

· sanjarcode opened on Apr 25, 2022

Sliding window technique is actually a special case of Dynamic programming

enhancementNew feature or requestNew feature or request

Status: Open.

#10 In sanjar-notes/dsa;

· sanjarcode opened on Apr 24, 2022

Recursion base case may not always be useful even if it's logically valid for the base case, is this true?

bugSomething isn't workingSomething isn't working

Status: Open.

#9 In sanjar-notes/dsa;

· sanjarcode opened on Apr 24, 2022

Recursive DP vs Iterative DP vs memoization vs tabulation

Status: Open.

#8 In sanjar-notes/dsa;

· sanjarcode opened on Apr 23, 2022

Deeply study the 2 conditions for DP

Status: Open.

#7 In sanjar-notes/dsa;

· sanjarcode opened on Apr 21, 2022

Dynamic Programming course

Status: Open.

#6 In sanjar-notes/dsa;

· sanjarcode opened on Jan 10, 2022

OOP roadmap

Status: Open.

#5 In sanjar-notes/dsa;

· sanjarcode opened on Oct 28, 2021

Competitive programming courses

Status: Open.

#4 In sanjar-notes/dsa;

· sanjarcode opened on Oct 8, 2021