In this course, Sanket Singh will discuss important concepts of String Algorithms and Computational Geometry in a comprehensive manner, starting from a basic introduction, proof techniques and solving competitive programming problems. Learners aspiring to perform in competitive programming will benefit from this course. The course will be taught in Hindi and the notes will be provided in English.

Course on String Algorithms and Computational Geometry

English

All questions

Pick's Theorem and Minkowski sum

Rotating Callipers

String Algorithms

Advanced

Game Theory

Miscellaneous

Computational Geometry

Competitive Programming

Ex-SDE @ LinkedIn | Former SDE @ Interviewbit | Google Summer of Code 2019 @ Harvard University | Former Intern @ISRO

Full Stack Development - Dormant

Sanket Singh

Miscellaneous

Course on String Algorithms and Computational Geometry

Sanket Singh

Schedule

Mar

3

Rotating Callipers

Mar

4

Pick's Theorem and Minkowski sum