Home Courses Interview Preparation Course Pigeon hole principle

Pigeon hole principle

Instructor: admin Duration: 20 mins

Prev
Next
Dearrangements
Number introduction

0 Comment(s)

Login to comment
1.1
C: What, Why and How?

22 min
1.2
Simplified model of a computer

19 min
1.3
Tools for Coding

10 min
2.1
Input and Output

32 min
2.2
Choosing one option vs another

21 min
2.3
Repeating over and over

24 min
2.4
Reuse and Simplify

18 min
3.1
Character Set in C

15 min
3.2
Keywords and Identifiers

13 min
3.3
Data Types

29 min
3.4
Variables

14 min
3.5
Constants

25 min
3.6
Input and Output

30 min
3.7
Formatting input and output

30 min
4.1
Integer Arithmetic Operations

10 min
4.2
Floating Point Arithmetic operations

7 min
4.3
Assignment Operators

10 min
4.4
Increment & Decrement Operators

8 min
4.5
Solved Problem

4 min
4.6
Relational Operators

8 min
4.7
Logical or Boolean operators

8 min
4.8
Comma operator

6 min
5.1
Introduction to Databases

22 min
5.2
Why SQL?

15 min
5.3
Execution of an SQL statement.

7 min
5.4
IMDB dataset

12 min
5.5
Installing MySQL

11 min
5.6
Load IMDB data

3 min
6.1
Why study DS and Algorithms?

20 min
7.1
Sorting & Searching : why bother with these simple tasks?

17 min
8.1
Satellite data and key

11 min
8.2
How it works: Card-sorting

20 min
8.3
Pseudo code

24 min
8.4
Correctness

6 min
8.5
In-place sorting

8 min
8.6
Stable sort

15 min
8.7
Online sorting

10 min
9.1
Model of computation

17 min
9.2
Space and time analysis of Insertion Sort-1

7 min
9.3
Space and time analysis of Insertion Sort-2

22 min
10.1
Insertion sort: Big O-notation

15 min
10.2
Notations: Big O

15 min
10.3
Notations: Big Omega, Theta

9 min
10.4
Notations: Small O, Omega, Theta

24 min
10.5
Relationships between various notations

21 min
10.6
Order of common functions & real world applications.

26 min
10.7
Why does asymptotic analysis matter in the real world?

16 min
11.1
Why learn another sorting algorithm?

6 min
11.2
How it works: Intuition

17 min
11.3
Pseudo Code

19 min
11.4
Merge sort: Analysing time & space complexity

21 min
11.5
Recursion tree method: intuition

13 min
11.6
External Merge-Sort

25 min
12.1
Solved Problem 1

5 min
12.2
Solved problem 2

4 min
12.3
Solved Problem 3

5 min
13.1
Recursion tree method

15 min
13.2
Master theorem

21 min
13.3
Extended Master Theorem

9 min
13.4
Inadmissible cases & Shortcuts

6 min
13.5
Substitution method.

15 min
14.1
Factorial: Time and Space complexity

21 min
14.2
Recursion vs iteration

7 min
14.3
Tail recursion/Tail-Call Optimization

14 min
15.1
Solutions for Practice Test-7

60 min
16.1
Longest Common Subsequence (LCS)

33 min
17.1
Find Kth Node from end of linked list

15 min
17.2
Linked List Cycle

40 min
17.3
Intersection point of Two Linked Lists

25 min
18.1
Petrol Filling Problem

24 min
19.1
Print Level order traversal in spiral form

37 min
20.1
Reverse words in a given string

15 min
21.1
Given an array of jobs with different time intervals. Find the minimum time to finish all jobs.

40 min
22.1
Word Break Problem

21 min
22.2
Longest Increasing Subsequence

20 min
24.1
Number introduction

49 min
24.2
Number Fractions

43 min
24.3
Rational & Irrational Numbers

29 min
24.4
Factors & Multiples

28 min
24.5
Numbers divisibility rules

24 min
24.6
Properties on Divisibility

20 min
24.7
Numbers Remainder theorm

28 min
24.8
Numbers Unit digit

15 min
24.9
Base system

27 min
24.10
Indices and surds Part-1

26 min
24.11
Indices and surds Part-2

47 min
24.12
Progressions

29 min
24.13
solved problems

27 min
25.1
Graph Data structure

1 min
26.1
Python, Anaconda and relevant packages installations

23 min
26.2
Keywords and identifiers

6 min
26.3
comments, indentation and statements

9 min
26.4
Variables and data types in Python

32 min
26.5
Standard Input and Output

7 min
26.6
Operators

14 min
26.7
Control flow: if else

10 min
26.8
Control flow: while loop

16 min
26.9
Control flow: for loop

15 min
26.10
Control flow: break and continue

10 min
27.1
Object Oriented Programming Part 1

120 min
27.2
Object Oriented Programming Part 2

120 min
28.1
How to Prepare for SDE-1 roles in top product based comapnies

65 min
29.1
Semantic Search Q&A: Part 1

90 min
30.1
How to Use Github?

90 min
31.1
3. Maximum Sub Array

46 min
32.1
Interactive Live session on Recursion Problems

120 min