Loading web-font TeX/Math/Italic

Blatherstrike - The strike of the nonsense

Beware.

Friday, 16 December 2022

Notes for "Clean code" by Robert Cecil Martin

at December 16, 2022

Email This BlogThis!Share to X Share to Facebook Share to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home

Subscribe to: Post Comments (Atom)

Labels

All-Pairs-Shortest-Path
Arrays
Bellman-Ford
binary lifting
CLRS
codeforces
Competitive Programming
Compiler Design
constant space
constructive
cs231n
databases
deep learning
Dijkstra
fenwick tree
Graphs
InterviewBit
Kruskal
Machine Learning
math
Persistence
Prim
Questions
repetition
rlac
Segment Tree
sharding
SPOJ
Statistics

Blog Archive

March 2025 (1)
February 2025 (2)
January 2025 (1)
September 2024 (1)
August 2024 (1)
July 2024 (1)
January 2024 (1)
September 2023 (1)
August 2023 (3)
July 2023 (1)
December 2022 (1)
November 2022 (2)
March 2022 (1)
July 2021 (1)
February 2021 (1)
September 2020 (1)
July 2020 (1)
March 2020 (2)
November 2019 (1)
October 2019 (6)
March 2018 (1)
February 2018 (1)
January 2018 (1)
November 2017 (10)
September 2017 (4)
August 2017 (1)

Report Abuse

Home

1476D - Journey

Tags : Problem statement Link : https://codeforces.com/contest/1476/problem/D Gist There are $n$ cities, connected by one directional road...

[Trees][Binary Lifting] 501 - D Misha And Permutations

Misha and Permutations Problem statement: The problem can be found here . The gist of the problem is: You're given two permutati...
4.2-6 CLRS

4.2-6[clrs]: How quickly can you multiply a $kn \times n$ matrix by an $n \times kn$ matrix, using Strassen's algorithm as a subrouti...
[Persistent Segment Trees] 351 - D Jeff and Removing Periods

351 - D - Jeff and Removing Periods Problem statement: Problem can be found here .The gist of the problem is: We're given an ar...

Simple theme. Theme images by blue_baron. Powered by Blogger.