Tarun Jain – Medium

Aug 6

DS approach mind map — [Notes]

· #2 — Check constraints is very important · #5 → Dry run ∘ Develop/Memorize dry run framework for all kind of problems #2 — Check constraints is very important 🎯 If array is a number → +ve / -ve / 0? 🎯 Power of integer in power2 and power10 2^3.33 = 10 -> 31/3.33 = ~9 -> 32/3.33…

Coding Interviews

2 min read

Coding Interviews

2 min read

Aug 2

Dynamic Programming | DP — [Index]

· Identification · Steps to solve a DP problem · DP patterns · TODO Identification DP = Enhanced Recursion DP = Recursion + Storage Choices are given [ Example — Include element or not ] Overlapping problems [ 💡 The fact that two recursion calls are being performed is a…

Dynamic Programming

1 min read

Dynamic Programming

1 min read

Aug 2

DP patterns— [Notes]

· 0/1 Knapsack · Unbounded knapsack · Fibonacci · LCS — Longest common subsequence ∘ Longest Palindromic Subsequence · LIS — Longest increasing subsequence · Kadane’s algorithms · Matrix Chain Multiplication · Rod cutting · DP on trees · DP with bit-masking · Digit DP · DP on graphs · Sum over Subsets · DP on Grid · Best time to buy and sell…

Dynamic Programming

2 min read

Dynamic Programming

2 min read

Jul 31

Java multithreading | Index — [Notes]

· happens-before · Monitor · Multi vs Multi · TODO happens-before happens-before — [Notes] The JMM enforces a happens-before ordering on these actionstarunjain07.medium.com Monitor Java Monitor — [Notes] · Mutual exclusion · Synchronisation · How to understand Monitor easily? · How is mutual exclusion achieved on Monitor…tarunjain07.medium.com Multi vs Multi Multi vs Multi Multi Core vs. Hyper-threadingtarunjain07.medium.com

Multithreading

1 min read

Multithreading

1 min read

Jul 31

Java Monitor — [Notes]

· Mutual exclusion · Synchronisation · How to understand Monitor easily? · How is mutual exclusion achieved on Monitor? · How is coordination/synchronization achieved via Monitor? · To summarize: · Difference between Lock Interface and synchronized keyword · Source Source In concurrent programming, we need to focus on two things Mutual exclusion …

Monitor

6 min read

Monitor

6 min read

Jul 24

Modular exponentiation using Recursion — [Notes]

Related article — Modulo 1⁰⁹+7 — [Notes] Source — https://youtu.be/nO7_qu2kd1Q

Modulous

1 min read

Modular exponentiation using Recursion — [Notes]

Modulous

1 min read

Jul 24

Pow(x,n) using recursion — [Notes]

Reference — https://youtu.be/wAyrtLAeWvI · Approach to calculate x^n using recursion — 2 methods · Time complexity analysis ∘ Approach #1 (Albert) — Approach to calculate x^n using recursion — 2 methods

Power Function

1 min read

Power Function

1 min read

Jul 24

Modulo 10⁹+7 — [Notes]

· Modulo Basic Modulo Basic

Modulo

1 min read

Modulo

1 min read

Jul 24

Fibonacci Sequence complexity analysis — [Notes]

Time complexity analysis O(2^n) → Fib (recursion) O(n) → Fib (Iterative) Reference — https://youtu.be/pqivnzmSbq4

Fibonacci

1 min read

Fibonacci

1 min read

Jul 23

Merge sort Complexity analysis — [Notes]

· Merge sort ∘ Why are we dividing into 2 equal parts? ∘ What happens if we divide the array in 3 or 4 parts (not 2 parts)? · Merge sort code ∘ Questions · Important Points · Good reads Merge sort Strengths: Fast. Merge sort runs in O(nlg(n)), which scales well as…

Merge Sort Algorithm

3 min read

Merge sort Complexity analysis — [Notes]

Merge Sort Algorithm

3 min read