Have any question ?
+91 8080-806-983
interviewprep@appliedroots.com
Register
Login
COURSES
C Programming
Interview Preparation Course
CRT Program
Diploma in AI and ML
Courses
C Programming
Interview Preparation Course
Success Stories
Forum
FAQ'S
Team
Contact Us
Home
Courses
Interview Preparation Course
Numbers Remainder theorm
Numbers Remainder theorm
Instructor:
admin
Duration:
28 mins
Full Screen
Close
Prev
Next
Properties on Divisibility
Numbers Unit digit
8 Comment(s)
Login to comment
Introduction
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
Basics with example
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
Let's dive in
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
Operators and Expressions
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
SQL Introduction
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
Why study DS and Algorithms?
6.1
Why study DS and Algorithms?
20 min
Sorting & Searching : why bother with these simple tasks?
7.1
Sorting & Searching : why bother with these simple tasks?
17 min
Insertion Sort
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
Analyzing an algorithm.
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
Big O, Theta, Omega notation
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
Merge Sort
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
Solved Problems of Merge sort
12.1
Solved Problem 1
5 min
12.2
Solved problem 2
4 min
12.3
Solved Problem 3
5 min
Solving Recurrences
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
Recursion in programming
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
Practice Test-7 Searching, Binary Search Tree, Trees, Heap Sort
15.1
Solutions for Practice Test-7
60 min
Dynamic Programming
16.1
Longest Common Subsequence (LCS)
33 min
Problems on Linked Lists
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
Problems on stacks and Queues
18.1
Petrol Filling Problem
24 min
Problems on Trees
19.1
Print Level order traversal in spiral form
37 min
Problems on strings
20.1
Reverse words in a given string
15 min
Problems on Greedy Algorithms
21.1
Given an array of jobs with different time intervals. Find the minimum time to finish all jobs.
40 min
Problems on Dynamic programming
22.1
Word Break Problem
21 min
22.2
Longest Increasing Subsequence
20 min
Combinatorics
23.1
Why study Combinatorics?
5 min
23.2
Permutations and Combinations: an introduction
53 min
23.3
Solved Problems-1
48 min
23.4
Solved Problems-2
55 min
23.5
Recap: Sum Rule, Product Rule, Principle of Inclusion-Exclusion
16 min
23.6
Solved problems - 3
54 min
23.7
Dearrangements
22 min
23.8
Pigeon hole principle
20 min
Numbers system
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
Problems
25.1
Graph Data structure
1 min
Python Introduction
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
Python Object Oriented Programming
27.1
Object Oriented Programming Part 1
120 min
27.2
Object Oriented Programming Part 2
120 min
How to prepare for SDE-1 Role in top product based comapnies
28.1
How to Prepare for SDE-1 roles in top product based comapnies
65 min
Python projects
29.1
Semantic Search Q&A: Part 1
90 min
How to Use Github?
30.1
How to Use Github?
90 min
Leetcode: April Daily Coding Challenge Problems
31.1
3. Maximum Sub Array
46 min
Live sessions
32.1
Interactive Live session on Recursion Problems
120 min
Close