README
home

1 motivation
2 resources
3 roadmap
4 resource itineraries

1 CN Intro to Cpp

1. Flowcharts

10. Multidimensional Arrays

2. C++, W2H

3. main, Variables and Operators

0 index
2.1 Type Aliases
2.2 Automatic Type Deductions

1. auto

0 index

2. decltype

4. Conditionals and while loops

1. Patterns 1

2. Patterns 2

5. For loop and bitwise ops

6. Functions

7. Arrays

0 index

8. Searching and Sorting

0 index

2 CN Data Structures and OOP

1. Memory and Pointers

0 index
1. Pointers

7. Address Typecasting
8. References and Pass by Reference

2. Dynamic Memory Allocation

2. Time and Space Analysis

0 index
1. Time

1. Order Complexity Analysis

0 index

2. Linear Search Time Complexity
3. Insertion Sort
4. Selection Sort
5. Time complexity for recursive algorithms

0 index

6. Fibonacci is bad

2. Space
exerciseques
zAssignments

3. Binary Search Trees

Quizzes&Exercises

Exercises

zAssignments

Assignments

3. Recursion

1. Recursion Basics

2. Recursion Practice

assignments

3. Applications of Recursion

0 index
1. Recursion and Strings

2. Merge Sort
3. Quick Sort
4. Strings
zAssignments

0 index
1. Subsequences of Strings

2. Printing subsequence

0 index

after assignments

Test1

4. OOP Basics

0 index
1. Intro and syntax

1. Getters and Setters

0 index

2. Core member functions

5. this keyword
exercise ques

2. Special Functions

0 index
1. Constructor idea and syntax

0 index
1. The Copy constructor

2. Feature Delegating constructors

2. Destructor
3. Special functions details

0 index

3. Member constraints

0 index
1. const

2. static

4. Operator overloading

0 index
1. Binary operator
2. Unary post

0 index

3. Unary pre
exercises
zAssignment Polynomial class

0 index

5. Separate Compilation
6. Approach for writing a class

5. Data Structures

1. Linear Data Structures

1. Vector aka Dynamic Array
2. Linked List

1. Linked List Basics

0 index
1. What are data structures and why are they important
2. What is a linked list
3. Basic Operations on LL

2. Popular LL problems

Assignments

3. Stack

0 index
1. Introduction to Stacks
2. Stack using arrays

0 index

3. Stack using dynamic arrays

0 index

4. Templates

0 index

5. Stacks with templates

0 index

6. Stack using LL

0 index

7. Inbuilt stack STL

0 index

4. Queue

0 index
1. Queue Introduction

0 index

2. Queue using Array Code

0 index

3. Queue using Dynamic Array Code

0 index

3. zNamespaces
4. Queue using LL

0 index

5. Inbuilt queue STL

0 index

zTest 2

Test2

2. Trees

1. Generic Trees

0 index
1. Introduction to trees
2. Coding a tree

1. TreeNode class

0 index

2. Destructor
3. IO for trees

1. Take input and print recursive

0 index

2. Take input levelwise
3. Output level wise

3. Tree params

1. Number of nodes
2. Height of a tree Exercise
3. Depth of a Node

0 index

4. Number of leaf nodes

0 index

4. Tree Traversals

0 index

2 .Binary trees

0 index
1. Intro to Binary trees
2. Coding a Binary Tree

2. Input

0 index

3. Printing a tree

0 index

3. Params

4. Traversals

0 index

5. Construction from traversal

1. Pre and In

0 index

2. Post and In
3. Level and In

zAssignments

3. Binary Search Trees

0 index
1. Intro to BST
2. Coding BST BST Node class

0 index

3. Search Operation in BST
4. Common BST questions

1. Check if BST

1. Check BST 1

0 index

2. Check BST 2
3. Check BST 3

0 index

5. Variations of BST

0 index
1. AVL trees

0 index

3. Auxilary Data Structures

0 index
1. Priority Queue and Heap

2. Hashmaps

1. map and unordered map

0 index

2. set and unordered set
3. Iterators C++ Feature

3. Tries

3. Types of Tries

0 index

4. Huffman Encoding

4. Graphs

1. Graphs Basics

6. Basic path operations

7. Problem get connected components

2. Graphs 2

0 index
1. Intro to MST
2. Cycle Detection

0 index

2. MST algorithms

1. Kruskal's Algo Complexity

5. Prim's Algorithm
6. Dijkstra's Algorithm

5. C++ STL

6. Algorithm Design

0 index
1. Fibonacci 1

0 index

4. NP Completeness

7. C++ Continued

0 index
1. Macros and Global Variables

2. Inline and Default Arguments
3. const and constexpr
4. Exception Handling

0 index

8. OOP Continued

0 index
1. Relations between classes

Codes

DFS.cpp

Home
notebook

3 CN Competitive programming

1. CP intro and tools

1. Intro to Competitive Programming

1. What is CP
2. Why CP
3. Various Types of Errors
4. How to approach a problem in a competitive programming contest

0 index

2. Time and Space Complexity

0 index
Problems

3. IO Techniques

3. General tricks

4. Language Tools

0 index
1. STL Data Structures

0. Conveniences

0 index
1. Physical Data Structures

1. Vector

0 index

2. List

2. ADTs

0 index

8. Prioirty Queue

2. Functions

0 index

3. Math functions
4. Utility functions

3. Hussain Set

0 index

10. TreesX

0 index
1. Tries

2. Segment Tree

0 index

zAssignments

0 index

3. Fenwick Tree

11. Number Theory

1. Modulo Arithmetic

0 index
1. Modulo operation

0 index

2. Modulo properties
3. Modulo properties continued
4. Exercise number of Binary Trees

0 index

2. Prime generator and GCD

1. Primes

1. Find prime numbers between 1 and N
2. Sieve of Eratosthenes

0 index

3. Complexity of Sieve of Eratosthenes

2. Euclid's Algo

1. GCD Euclid's Algorithm
2. Complexity of Euclid's GCD algorithm
3. Diophantine Equations

0 index

4. Extended Euclidean Algorithm

0 index

3. Multiplicative Modulo Inverse
4. Applications Of NT 1

1. Sachin and Varun

0 index

2. Advanced GCD

3. Totient Function

4. Solving equations using NT

1. Optimized Power Function

0 index

2. Modular exponentiation

0 index

3. Matrix Exponentiation

4. Fermat's Little Theorem

0 index

5. Wilson's Theorem
6. Income on the Nth day

12. Game Theory

13. Computational Geometry

14. FFT
15. HLD

2. Unconventional use of Searching And Sorting

0 index
1. Aggressive Cows
2. Inversion Count

0 index

3. chef

0 index

4. Variation

0 index

5. Murder

0 index

6. Momos Market

type

7. Distribute Candies

distribute candies

8. Taj Mahal Entry

0 index

3. RecursionX

1. BackTracking

0 index
1. N Queens Problem Exercise

0 index

2. Rat And Maze problem

0 index

3. Sudoku Puzzle

0 index

4. Crossword Problem

0 index

2. BackTracking Assignment BackTracking, Binary Search And Merge Sort Problems

4. Bit Manipulation

0 index
1. Shift Operators

0 index

2. Remaining Bitwise Operators

0 index

3. ith bit

0 index

5. Adhoc Problems

0 index
1. Equalize CodeForces

0 index

2. Rectangular Area

0 index

3. Light up the bulbs

0 index

4. Circular List of students

0 index

5. Interesting Sequences

0 index

6. Winning Strategy

0 index

6. Dynamic ProgrammingX

0 index
1. Classic problems

0 index
1. DP Basics Fibonacci Number

0 index

2. AlphaCode

0 index

3. Longest Increasing subsequence

0 index

4. Largest Bitonic Subsequence

0 index

5. Coin change and stair case

0 index

6. Minimum Cost

0 index

7. Magic Grid

0 index

Assignments 1

Assignments 2

2. Practice Problems

Assignment 1

Assignment 2

3. DP & Bitmasking

0 index

7. Greedy Method

1. Introduction to Greedy technique

0 index

2. Minimum Absolute difference in an array
Assignment 1

Assignment 2

8. GraphsX

9. String Algorithms

1. Pattern Matching Basics
2. KMP algorithm

0 index

3. Z algorithm for pattern matching

Home

notebook

5 projects
6 setup

3. Area of a polygon #

Created Thursday 20 August 2020

Triangulation method

For finding the area of a polygon, divide it into triangles and find the area.
Just add all. Don’t worry about convexity, the cross products will handle it.(They can be positive or negative)
Area = abs(ABC + ACD + ADE + … - (the last one subtracted))