Computational Geometry for the day before your Coding Interview - Brossura

Libro 11 di 14: Day before Coding Interview [DCI]: CODING INTERVIEW PATTERNS

Chatterjee, Aditya; Kiao, Ue

 
9798413585221: Computational Geometry for the day before your Coding Interview

Sinossi

This book “Computational Geometry for the day before your Coding Interview” is carefully designed to help you get into Problem Solving Mindset for Coding Interview within a day.

We have carefully selected 5 problems which you can complete in a couple of hours. The problems are such that it captures all key ideas of Computational Geometry important for Coding Interviews. With this, you will be able to crack any Coding Interview easily.

We have covered the following problems:

  • Introduction to Computational Geometry
  • Shortest distance between a Line and Point in 3D plane
  • Find mirror image of point in 2D plane
  • Number of Integral points inside a triangle
  • Maximum points on a line
  • Closest Pair of Points

In addition to the explanation of the efficient algorithms to solve the problems, we have covered:
  • Related theorems and concepts
  • Implementations: So, you can revise your implementation skills and easily implement Computational Geometry ideas.

Best of Luck for your Coding Interview.

Book: Computational Geometry for the day before your Coding Interview
Series: Day before Coding Interview
Authors (2): Aditya Chatterjee, Ue Kiao
Contributors (4): Rohan Chandrashekar, Joe Gorst, Susmita Bhattacharya, Kartik Keyan Kant.
Published: February 2022 (1st Edition)
Publisher: OpenGenus

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.