Suresh Sarda sureshsarda

Competitive Programming Syllabus

Graham Scan algorithm for Convex Hull O(n * log(n))
Online construction of 3-D convex hull in O(n^2)
Bentley Ottmann algorithm to list all intersection points of n line segments in O((n + I) * logn)
- Suggested Reading - http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm
Rotating Calipers Technique
- Suggested Reading - http://cgm.cs.mcgill.ca/~orm/rotcal.html

Problems - Refer the article for a list of problems which can be solved using Rotating Calipers technique.

Picking the right architecture = Picking the right battles + Managing trade-offs

User cases (description of sequences of events that, taken together, lead to a system doing something useful)
- Who is going to use it?
- How are they going to use it?

A "Best of the Best Practices" (BOBP) guide to developing in Python.

	- This page is a collection of some of the Advanced queries from the [[Datalog]] channel on the [[Logseq/Discord]] server. #datalog
	id:: 61db13f4-75e8-4f87-ad60-3ac3479c5fc8
	- ### Resources
	- [link: The first message on the datalog channel](https://discord.com/channels/725182569297215569/743139225746145311/743139795865174119)
	- [link: Logseq docs - Advanced queries](https://docs.logseq.com/#/page/advanced%20queries)
	- [link: Logseq datascript schema](https://gist.github.com/tiensonqin/9a40575827f8f63eec54432443ecb929)
	- [link: Logseq frontend db model](https://github.com/logseq/logseq/blob/master/src/main/frontend/db/model.cljs)
	- [link: How to Graph Your Data - talk by Paula Gearon](https://youtu.be/tbVwmFBnfo4)
	- [link: Domain modelling with datalog - talk by Norbert Wojtowicz](https://youtu.be/oo-7mN9WXTw)
	- [link: Athens Research ClojureFam](https://github.com/athensresearch/ClojureFam)

	>>> import itertools
	>>> import string
	>>> from elasticsearch import Elasticsearch,helpers
	es = Elasticsearch()
	>>> # k is a generator expression that produces
	... # a series of dictionaries containing test data.
	... # The test data are just letter permutations
	... # created with itertools.permutations.
	... #
	... # We then reference k as the iterator that's