Main Topics

Java Basics
Maths in DSA
Bits Manipulation
Arrays

Searching Algorithms
Matrix

Time & Space Complexity

Sorting Algorithms

String Manipulation
Stack
Queue

Object Oriented Programming

Collections Framework
Two Pointers

Recursion
Linked List
String Manipulation
Hashing
Sliding Window

Trees
Heap & Priority Queue

Tries
Graphs
Greedy Algorithms

Dynamic Programming (DP)

Multi Threading

Bonus
 Java Plus DSA Sheet By Shashwat Tiwari
Subtopics
Programming Language and Memory Management

Flow of a program

How Java Program Compiles

Writing your first program

Java being Java

Inputs and Operators

Organize your code

Control Statements

Functions in Java

Mini Project -1

Mathematics in DSA - Part 1

Mathematics in DSA - Part 2

Bits and Binary Operations

Play with Bits / Bit Manipulation

Bit Manipulation

Arrays in Java

Searching Algorithms - 1
Searching Algorithms - 2

Questions on Binary Search Part 1

Questions on Binary Search Part 2

Questions on Binary Search Part 3

Questions on Binary Search Part 4

Questions on Binary Search Part 5

Q16. Koko Eating bananas

Q17. Smallest Divisor given a threshold
Q18. Minimize Maximum of products distributed to any store
Q19. Aggressive cows
Q20. Median of two sorted arrays
Q21. Kth element of two sorted arrays
Questions on Binary Search Part 6

Other Searching Algorithms

Q. Median of a Sorted Matrix

Q. Kth Smallest element of a Matrix
Questions on Matrix - 1

Questions on Matrix - 2

Questions on Matrix - 3

Time and Space Complexity

Insertion Sort
Selection Sort [Uni and Bi - directional]
Bubble Sort and Brick Sort
Counting Sort
Radix Sort
Pigeonhole Sort
Cyclic Sort
Q. Find missing element in range of 0 to N
Q. Given an array [1 to N] return all elements in range [1 to N] that are absent in the array
Questions on Duplicate Numbers

Q. Find the missing and repeating element in an array [1 to N]

Q. Return the smallest positive number missing
Strings in Java

More on Strings
Playing with String

Q. Print all substrings

Q. Reverse a string
Q. Check if a string is pallindrome
Q. Reverse words in a String
Q. Check if two strings are anagram
Q. Reverse Words in a String -iii
Stack Data Structure

Q. Check parenthesis
Q. Remove minimum brackets to balance string
Q. Add minimum brackets to balance string
Q. Swap minimum brackets to balance string
Q. Swap adjacent brackets to balance string
Q. Asteroid Collision
Q. Stock Span Problem
Q. Next Greater element
Q. Next Smaller element
Q. Next Greater / Smaller element in circular array
Q. Largest Rectangle in Histogram + Previous smaller element
Q. Max Rectangle
Q. Longest Valid Parentheses
Queue Data Structure

Implement queue using stack

Implement stack using queue
Q. LRU Cache
Q. LFU Cache
Q. Rotten Oranges
Q. Sliding Window Maximum
Q. Find Maximum and Minimum of Every Window Size
Classes and Objects
Pillars of Oops
Inheritance
Important Keywords
Constructor Calling and Access Specifier
Getters and Setters
Function Overriding
Abstract Classes
Java Interfaces
Nested Classes
Java Generics
Comparator and Comparable

Collections in One Shot

Q. Container with Most Water
Q. Trapping Rainwater
Q. Find Pair with a given sum in sorted Array
Q. Remove Duplicates from Sorted Array
Q. Maximum Consecutive ones
Q. Reverse Pairs
Q. The Celebrity Problem

Recursion - I

Recursion - II

Time and Space Complexity Analysis

Backtracking and All it's variants

Backtracking with Pruning

More Questions on Backtracking

Recursion - III

Divide and Conquer

Linked List Data Structure

Doubly Linked List

Q. Find Middle of Linked List (Hare Tortoise Algorithm)

Q. Delete Middle of Linked list
Q. Pairwise swap nodes of Linked List
Q. Add two numbers using Linked List
Q. Reverse the linked list (Iterative + Recursive)
Q. Palindrome linked list
Q. Detect Cycle in a linked list
Q. Segregate a linked list into odd and even list
Q. Reverse Nodes in K Group
Q. Remove Nth node from the end of linked list
Q. Sort a linked list of 0's, 1's and 2's
Q. Intersection of two Sorted linked list
Q. Intersection point of two linked list
Q. Insert in a sorted list
Q. Insertion Sort on Linked List
Q. Merge Sort on Linked List
Q. Split a circular linked list into two circular lists
Q. Clone a linked list with random and next pointer

Q. Longest Pallindrome
Q. Find all Anagrams
Q. K-Anagrams
Q. Roman to Integer
Q. First Repeated word in a string
Q. Isomorphic String checker

Rabin Karp Algorithm

KMP Algorithm
LPS Algorithm

Hashing

Hashmap Data Structure

Implement HashMap in Java

Q. Most frequent element in an array

Q. Check if an array is subset of another array
Q. Count Pairs with given sum
Hashset Data Structure

Q. Minimum number of subsets with distinct elements

Questions on K-SUM Subarray Pattern

Q. Longest subarray with sum divisible by K

Q. Longest increasing concecutive subsequence
Q. Count distinct elements in every window of size K
Q. Largest subarray with equal number of 0s and 1s
Q. Find pairs with given sum such that elements of pair are in different rows
Bucket Sort Algorithm
Sliding Window Technique
Q. Maximum Sum Subarray of Size K
Q. First Negative Number in Each Subarray of Size K
Q. Chocolate Distribution Problem
Q. Smallest subarray with sum greater than x
Q. Longest Substring with K unique Elements
Q. Longest Substring without repeating elements
Q. Count Occurances of Anagrams
Q. Minimum Window Substring
Q. Sliding Window Maximum
Linear and Non Linear Data Structures
Intro to Tree Data Structure

Tree Traversal BFS

BFS on N-Ary Trees
Tree Traversal DFS - Recursive
Preorder Iterative
Inorder Iterative
Postorder Iterative
Q. Construct tree using inorder and postorder.
Q. Maximum Depth of Binary Tree
Q. Maximum Depth of N-Ary Tree
Q. Diameter of Binary Tree
Q. Diameter of N-ary Tree
Q. Count number of node in compete Binary Tree
Q. Left and Right View of Binary Tree
Q. Top and Bottom View of Binary Tree
Q. Vertical Order Traversal of Binary Tree
Q. Boundary Traversal of Binary Tree
Q. ZigZag Level Order Traversal of Binary Tree
Q. Balanced Binary Tree
Q. Lowest Common Ancestor of Binary Tree (LCA)
Introduction to Binary Search Tree
Delete a Node in BST
Q. Validate BST
Q. Two Sum in BST
Q. Kth Smallest Element in BST
Q. LCA in BST
Q. Burn a Tree
Q. BT to DLL
Q. Floor and Ceil in BST
Q. Search in BST
Q. Binary Search Tree Iterator
Q. Maximum Sum BST in Binary Tree
Flood fill algorithm in BT
Segment tree
Range query
Red Black Tree

AVL Tree
TreeMap Collections
Heap

Priority Queue in one shot

Q. Top K Frequent Elements

Q. Sort Characters by frequency
Q. IPO
Q. Design Twitter
Q. Task Scheduler
Q. Connect N ropes with Minimum cost
Q. Medium of Running Streams of Integers
Q. Maximum Sum Combination
Q. Merge K sorted Elements
Trie
Questions on TRIE

Graph Introduction

Graph Representation & Application

Q. Find the center of star graph

Q. Maximum Total Importance of Roads
Connected Components and Path
DFS Traversal in Graph
BFS Traversal in Graph
Q. Flood fill using BFS
Q. Number of Islands
Q. Word Ladder -1
Q. Word Ladder -2
Q. Evaluate Division
Q. Get Watched Videos by your friends
Q. Rotting Oranges | Multisource BFS
Q. Minimum Time to Collect All Apples in a Tree
Q. Most Stones Removed with Same Row or Column
Q. Accounts Merge
cycle detection in undirected graph using BFS
cycle detection in undirected graph using DFS
Cycle Detection In Directed Graphs using DFS
Kahn's Algorithm for Toposort
Toposort using DFS
Cycle Detection in directed graph using toposort
When to apply BFS | Shortest Path using BFS
Dijkstra Algorithm | Shortest Path
Floyd Warshall Algorithm | Shortest Path
Bellmanford Algorithm | Shortest Path
Q. Network Delay Time
Q. Cheapest Flights Within K Stops
Q. Minimum Cost to Convert String I
Disjoint Sets in one shot
Q. Redundant Connection
Q. Satisfiability of Equality Equations
Q. Number of Operations to Make Network Connected
Q. Is Graph Bipartite?
Strongly Connected Components | Kosaraju's Algorithm
Minimum spanning tree
Prim's Algorithm for minimum spanning tree
Kruskal's Algorithm for minimum spanning tree
Greedy Algorithm Introduction
Q. Activity Selection Problem
Q. Eqyption Fraction
Q. Job Sequencing Problem
Q. Policemen Catches Thieves
Q. Assign mice to Holes
Q. Minimum swaps for bracket balancing
Q. Minimum number of Platforms for Railway station
Q. Minimum number of Coins - greedy
Q. Fractional Knapsack - greedy
Q. Text Justification
Dynamic Programming Introduction

Q. Coin Change Problem

Q. 0-1 Knapsack Problem
Q. Longest Increasing Subsequence
Q. Pallindromic Partitioning
Kadanes Algorithm
Q. Maximum Sum Subarray
Q. Maximum Product Subarray
Q. Maximum Sum Rectangle
Q. Edit Distance
Q. Rod Cutting Problem
Q. Word Break Problem

Q. Longest Common Subsequence

Q. Variants of LCS
Java Multithreading and Concurrancy - I
Java Multithreading and Concurrancy - II
Catalan Number
Permutation and combinations
Trending leetcode contest questions.
All Important pattern printing
Observation and tricks
us DSA Sheet By Shashwat Tiwari
Details Video Links
[Link]
What is a programming Language
Machine Language
Assembly Language
High Level Language
Procedural Language
Functional Language
Object Oriented Language
Scripting Language
Stack Memory
Heap Memory
Garbage Collection
[Link]
Flowchart
Psuedocode
Algorithm
[Link]
Byte code
Machine code
why java is platform independent
JDK, JRE, JVM, JIT
[Link]
installation of Java
installation of IDE
"Hello Coder"
entrypoint of program
commandline arguments
generating byte code in style
How computer runs your program?
writing comments in java
[Link]
Variables and constants
Literals and keywords
data types
Program to swap two numbers
Type casting Implicit and explicit
Automatic type promotion
Wrapper class
ASCII Values
Unicode style
[Link]
Operators in java
How to take input
[Link]
Java Packages
Access Specifiers
[Link]
if-else
switch case
while loop
do-while Loop
for each loop
[Link]
Functions
Types of functions
create your own functions
call by value and call by reference
[Link]
Calculator Application
Temperature convertor
[Link]
Number system
Conversion from one system to other
Digit extraction
Reverse a Number.
Find even odd
Find Power of a number.
Fast exponentiation
[Link]
count digits
count digits using log
using log formulas
Armstrong Number
Pallindrome Number
Print all divisors
Check if Number is Prime
Sieve Algorithm
Newton Raphson Algorithm for square root
Greatest Common Divisor
Euclidian GCD Algorithm
lcm of two numbers
Modular Arithmetics
fast exponentiation with modular arithmetics
factorial of a number
find trailing zeros in a factorial
ceiling and floor of a number
[Link]
Least Significant Bits
Most Significant Bits
Signed and unsigned Numbers
Calculate range of data type
How to add binary numbers
How to find 1's complement
How to find 2's complement
Left shift and Right shift
Trick to divide or multiply any number.
Bitwise NOT, Bitwise AND, Bitwise OR
[Link]
Find the i-th Bit
Set the i-th Bit
Toggle the i-th Bit
Unset the i-th Bit
Print the number in binary without conversion
Find if a number is even / odd using bit manipulation
Find if a number is power of 2.
Count the number of set bits.
Unset the right most set bit.
[Link]
Bitwise Operators
Bit Manipulation
Bit Masking
Advanced XoR problems of Bit Manipulation
[Link]
what are arrays
concept of indexing
Insert, update, delete, traverse
How arrays work in memory
what is a sorted array
How to create a 2d array
Operations on functions
Jagged Array
passing arrays to functions
[Link]
Linear Search
Q. search an Element / first occurrence
Q. Find the minimum element in an array (1D/2D)
Q. Find the maximum element in an array (1D/2D)
Q. Find max sum 1D array in a 2D array
Q. Search all occurrences (1D/2D)
Q. Search last occurrence (1D/2D)
 [Link]
Binary Search
Sorted in increasing
Sorted in decreasing
Order Agnostic Binary Search
[Link]
Q1. Ceiling of a Number
Q2. Floor of a Number
Q3. First and Last Position of element in sorted array
Q4. Count all occurrence of element in an array
Q5. Next smallest letter in sorted array
[Link]
Binary Search in range
Q6. Find Minimum Difference in a Sorted array.
Q7. Find an element in an array of Infinite size
Q8. Find first 1 in an infinite and sorted array of 0s and 1s
[Link]
Bitonic Array
Q9. Find pivot in bitonic array
Q10. search in bitonic array
[Link]
Sorted and Rotated Array (Clockwise and Anticlockwise)
Q11. count number of rotations
Q12. search in rotated sorted array ( with and without duplicates)
Q13 Find min / max (peak) element in rotated and sorted array
[Link]
Q14. Allocated minimum number of pages
Q15. Capacity to Ship within D Days
[Link]
[Link]
o any store [Link]
[Link]
[Link]
 [Link]
[Link]
Q22. Single Element in a Sorted Array
Q23. Finding square root
Q24. Count Squares
[Link]
Jump Search
Interpolation Search
Exponential Search
Ternary Search
[Link]
[Link]
[Link]
Q. Search in a row wise and column wise sorted Matrix
Q. Search in a sorted matrix
[Link]
Q. Transpose a Matrix
Q. Rotate a Matrix by 90 degree clockwise
Q. Rotate a Matrix by 90 degree anticlockwise
[Link]
Q. Spiral Matrix - 1
Q. Spiral Matrix - 2
[Link]
What is Algorithm Complexity
Asymptotic Notations
Time Complexity
Space Complexity
Big Oh cheat sheet.
How to calculate time complexity
 Algorithm optimizations
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
nge [1 to N] that are absent in the array [Link]
[Link]
Q. Find the duplicate Number in an array [1 to N] ( inclusive )
Q. Given an array [1 to N] with elements appearing once or twice, return all elements that appear tw
ray [1 to N] TBD
TBD
[Link]
characters
string literals
string constant pool
subsequences
substrings
String comparison
String with new operator
Reference Comparision
[Link]
String Builder
String Buffer
Next vs NextLine
Taking string as a user input
compareTo function
trim function
split function
 startsWith function
endsWith function
IndexOf function
lastIndexOf function
charAt function
toLowerCase function
toUpperCase function
toCharArray function
[Link]
Input Buffer and delimeters
String formatting
String Concatination
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Stack
Stack using Arrays
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
ler element [Link]
 [Link]
[Link]
[Link]
Queue
Queue using Array
Circular Queue
Double ended Queue
[Link]
[Link]
TBL
TBL
TBL
TBL
TBL
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Introduction [Link]
Need of Data Structure and Algorithms
Data and Object in real world
Need for a framework
What is collection framework?
Modules Vs Framework Vs Library Vs Package
How to Import Collections Framework
Hierarchy of Collections Framework - Interfaces & Classes
Functions in Collection Interface
Java Generics and AutoBoxing
List Interface
ArrayList & its functions
How to Iterate your List using Iterator
Internal Working of ArrayList
Sorting using Comparator
Sorting based on Custom Comparator
How to Iterate your List using ListIterator
Time Complexity of ArrayList
LinkedList & its functions
ArrayList VS LinkedList
Time Complexity of LinkedList
Vectors and their use
Stack & its functions
Time Complexity of Stack
Queue & its functions
Queue using LinkedList
Queue using ArrayDeque
Deque Interface using ArrayDeque & LinkedList
PriorityQueue Implementation of Queue
Map Interface
Hashing Concept
How Map uses Hashing Concept
HashMap & its functions
How to traverse a Map using Entry Interface
Map using LinkedHashMap
Map using TreeMap
BST
Self Balanced BST or Red-Black Tree
TreeMap & its functions
Set Interface
HashSet
How HashSet works Internally
LinkedHashSet
TreeSet
TBD
TBD
TBD
TBD
TBD
TBD
TBD

playing with function calls

Types of recursion
Q. convert decimal to binary
Q. reverse a number / string
Q. reverse an array inplace
Q. reverse a stack

Leap of Faith
Q. Tower of Hanoi
Q. Count ways in a Matrix

Notations
Recurrence Relation
Trick
Q. Rat in a Maze
Q. All permutations
Q. Pallindrome Partitioning
Q. Letter Combination of a Phone Number
Q. Print Subdequences of a String
Q. Subsequences with sum equal K

Q. Combination Sum - I
Q. Combination Sum - II
Q. Combination Sum - III
Q. Combination Sum - IV

Q. Number of islands
Q. Knights tour problem
Q. N Queens problem
Q. Suduko Solver
Q. Josephus problem - Kill in circle
Binary Search using recursion

Q. calculating power ( x^n)

Q. Merge Sort
Q. Quick Sort
Q. Count Inversion
Strassen's Matrix Multiplication

[Link]
Intro to linked list Data Structure
Types of linked list
All operations of Single linked list
Time Complexity
Applications of linked list
Implementation of linked list data structure
[Link]
Intro to Doubly linked list
All operations and their time complexity
Implementation of linked list

[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
TBL

TBD
TBD
 TBD
TBD
TBD
TBD

TBD
TBD
TBD

[Link]
Components of Hashing
How hashing works?
Types of Hash Functions
Collisions
Collision Resolution Techniques - Separate chaining
Collision Resolution Techniques - Open Addressing
Load Factor
Rehashing
Applications and Advantages

[Link]
What is hashmap?
How to use custom key-value pair
[Link]
All Methods
Hashcode function
Rehashing

[Link]
[Link]
 [Link]
[Link]
what is hashset data structure
Usage of map keys
Set Iterator
[Link]
[Link]
Q. Check if subarray with K sum Exists or Not
Q. Find the starting and ending index of K sum subarray
Q. Find the maximum length subarray with K sum
Q. Find the minimum length subarray with K sum Homework
Q. Count the total subarrays with sum K
Q. Find largest subarray with 0 sum Homework
[Link]
[Link]
TBD
[Link]
pair are in different rows TBD
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Linear Data Structure
Non Linear Data Structure
[Link]
What is a tree Data Structure.
Types of trees.
Binary Trees.
N-ary Trees.
Ternary Trees.
Non Linear Data Strcuture.
Hierarical Data Structure.
Properties of a Tree Data Structure.
Neighbour in Tree.
Siblings in Tree.
Cousin in Tree.
Depth of a Tree.
1Height of a Tree.
Child of a node in tree.
Parent of a node in tree.
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Q. Size of Binary Tree [Link]
[Link]
[Link]
[Link]
[Link]
[Link]
 [Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
TBD
TBD
TBD
TBD
[Link]
[Link]
TBD
TBD
TBD
TBD

[Link]
1. AVL Trees
2. Balanced Trees
3. Insert in AVL Tree
4. Delete in AVL Tree
5. Balance factor of AVL Tree
6. AVL Tree rotations
7. LL
8. RR
9. LR
10. RL
 [Link]
[Link]
1. Heaps
2. Heapify
3. Heapsort
4. Min Heap
5. Max Heap
6. Increase Key
7. Decrease Key
8. Insert in Heap
9. Delete from Heap
10. build heap from array
11. Complete Tree
[Link]
1. Priority Queue in Java collections
2. Priority Queue on custom classes.
3. [Link]()
4. dsa playlist
5. Equate objects in pq
[Link]
[Link]
[Link]
[Link]
[Link]
TBD
TBD
TBD
TBD
Introduction to Trie
Implement a Trie in java
Insert, Search and delete operations
Q. Longest String with All prefixes
Q. Number of Distinct substrings in string
Q. Power Set
Q. Maximum XoR of two Numbers in an Array

[Link]
1. Introduction to graphs
2. Directed Graph
3. UnDirected Graph
4. Weighted Graph
5. UnWeighted Graph
6. Vertex and Edges
7. Degree of a node in graph
8. In-degree and Out-degree in graphs
[Link]
1. How to represent graph in memory
2. InDegree of directed graph
3. outDegree of directed graph
4. Adjacency List
5. Adjacency Matrix
6. Degree of a graph
7. Represent Directed graph with weight
8. Represent UnDirected graph with weight
[Link]
[Link]
[Link]
1. How to traverse multiple components in a graph
2. TreeTraversal vs Graph Traversal
3. Path in a graph
4. Cycle in a graph
5. Directed Acyclic Graph (DAG)
7. Find if a path is valid or not
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
TBD
[Link]
 [Link]
[Link]
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
Overlapping Subproblems
Optimal Substructures
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD
TBD

TBD
TBD
TBD
TBD
TBD
268j2hk0

bJOzF5A

9X75EPI

QzcbLicY

Z9RfIJE
0Rwrubs0

8usR3rEA

nLhAxy8s

AzNuefc

ujSiOSi0

RFpGmiE
oEgSp9O4

KSd3T2g

EXbLQX1k
vLfkuSEs

exsJWlI

dKVMjeQ
CDEUzaI

BrdxJA

awmdh5NM

SvNw9Qw

QcCu8oBI

mUWmmYbY

HoQIOnAs
bhpuhbk
wrTtUQvY
Pxfc4iQ
gAlmyTkc
8D95eHM
ayNeigg

Bm-VT99A

Gl1ZKQE
cDlB1uXk
meMx3Dq0

yvtCpjsg

oWcYX2_8

AvQXIEo
eiIm59Yk
KDoVRcw
KKzn6D4E
HVGFAJY
gdPVEwCc
1eMPYzSU
1L7CPH4
x5NN2bg
bE0VznM
C10ozzw
ents that appear twice

YjtczvY

J-PwU4g
IYakYt8

YRi1tXE
AjIVnmp4
MO4MkWs
AMB3jDOU
ND7TPc0
7EYLfOY
QWpma7ug

oP25NpfQ
wSdPjVGw
Bv1KtcDM
pGf3pzI
xDsqb8OE
lksWtS4
bq5qOraY
34EgVyY
QchOMmTGY
BL4gG1s
DZU4fj4
DmhCyyuc
sbdTcey0
SZPRQXQI?si=izPej7j2qhbiKrys

u8ivr0w?si=SgzjEHke5oc_cwdk
PUgXn90?si=86tva8iOIGV5E74n

6-P3XGrg?si=A8C7Bhnk9Jw9_3Eo
yUY_LKc?si=3pWEptBtHSDmXZdw
MrxQ17rY?si=3KP2Dq9CFLHYbF4r
aKx3eME?si=F5RFc62AkV6TCvKW
oC57Exk?si=Gojo6PdpxLRQEk46
7tvRWZvs?si=_VVQEdr-AJFUvFUi
g65pQgDk?si=WpwfA8BgXA5urOgL
_eL96fnY?si=7HCmcqIDdDFCJzUp
Ga30h3Is?si=Fo2_E2upIdm_6YRe
DZt7hbD8?si=rRLug4uAy0i81Tbt
9d_FEl60?si=IfDlHPpCONjSEbod
gYlReztM?si=ywgPQvHFaTwPKrFC

9tcCr8iU
NGYI6hk?si=aY6v4j2CUzgaPlpm
0XeTl4Y?si=5HZNJ_-u8IqktXam

qd8-lHl4?si=gByqGlulWwtiPV__
Hpq7hw?si=Fm2c_sOMqUx5QPqP
L2p31Oc?si=oyC441Kt3bph4ZCZ
nJa9pDk0?si=fRMC6sMYZcrkZr07
wvqS9Cq4?si=gGSvqdH_iCcI3a_K
8S875uyw?si=JVxHNQHRKatVgKPy
gzaOT2G0?si=Tx8_Z5poHSB09yyd
vheH5fA?si=-GLAb-yfSnpr3oFc
utkRYcs?si=7bmdLeSN25CvQwve
w_Dz5-A?si=_dkgHPvLVig4yrFR
lbstw1w?si=hG4blZtDKCcPpg5e
N7dz54A?si=KiqIImUyRioMkqhU
ZKmP-GTk?si=hLR5f5AShqMgMBdB
fTaf3qSw?si=Iu6oK0TRh503HGk0
CWqbxxI?si=LB1C44XQCKC9T9JU
kRumpqZw?si=uw-eXXBmA6YeHaFu
AxuT2I8?si=utMWpF083dismeIJ
WKXNH-v4?si=oAOjWmxgCLXQvjC2

0MQQ3jhA?si=qi9VRUEUv4Rldbv2

ukYcQG_E?si=D4bP5zpwtOFPzNQM

fFHxCZc?si=wKCy3r5x7hgIDEib
-l-xNXU?si=LMEB14_uTicW-6vM
 8D2QnHk?si=nWVnSK7h3P9V8k7u
VlloIWY?si=Uvz3qkcdHLlIsnbX

p9waCyk?si=GTlG-0HGVxzwzuvK
RGbBGEo?si=7wRtd-jYnSdHRYmk

0qThnJQ?si=1TEHDMBGaDGVeElr
ND5Hq-wQ?si=-Rdz-tpJZ4W1ke-g
uB-IC9KA?si=NEEgvm_zlI-dvSm_
YSnqGh8?si=8cnivpNvhCX6X0hf
Mxp7TS2BI?si=WN_ksJt1fWPXuLmF
Z6fuAas?si=t3JH4diL-nDnBwGe
y4cmlNw?si=TAp7sbW1OOQkW57C
U1TD9W5Y?si=1rn_BjF9-LIJDwcH
alb-h70s?si=VaCxJsB7-WKbL4nW
06_27MY?si=GUuisgzt8fXO5gF6
7tvBm8OU?si=fxI1Ggsz3C_sMlIj
VsSkItpY?si=0zBiqLK0x9yzN85K
K8Njm7M
uTrfpjc
B7-nihM
WUl1zlc?si=Z1PWfLJg3e8wL6GC

V0XBbKfA?si=wn_pcNP-l7dmDcXA
V0XBbKfA?si=wn_pcNP-l7dmDcXA
J9juD87k?si=Gou7Ob0zLS2xOoU2
zBIunWk?si=LYmDgBNvOFJogvt1
xq3Jwp4?si=8XJFCAnFCXWss35l
6aWlRd0?si=rRWVNq5RgT8w9Z6e
OuMcSHwo?si=8bymVQfdrdovJImK
cUV0t7k?si=iyca3V-SbEKcEthY
u7yep3ag?si=jVmAzUOxVZRD-JYV
4vzYDTM?si=NdWKcECHM7PslySR
JyH6Qs4c?si=vBK8aPbfmdQjYs8f
F7zEW9qc?si=YI6cXSo8StZmYUAY
Vsw_ZSw
yWuEoYE
c_jOmHE
D7WBjE5A
BM60-AVs
2X52uzMc
KcTvrhSc
D4AEvRq0
BGjmiVCE
4pTdHzq0
zLx9YYc
k2pr6V38
24jNZ6k

gGIVt_E
WbqIaf8

pN09q3nw
gjIgz3zQ
QGyL8rg

9jnDJNY

LwGSZHU
j1TMTDM
Hi2i03E
1S6aM5M
UPacgM
by0Aac8

UetonhUg

_V6Uhss
ENkkO3oU
LgrjRcss
 Y3boL0M
ZluVGlFI
OvvWzZYg
uv-S1biw
WGbBA2k
OBLyImbY
MRuI5k
AWkkO4h4
SUj4gBBc
bS_uBSE
uY-Ryuk
MoxmCs4
eSmWatIc
82Gl2Xg
sQj-DpI
TTABXV0
tO95I8g
We72jF_8
DWm_aVgA
YQPXR0
NO1Aq1o
o3E3n6c
TcPWSH8
ezLg_6Q
npjtVPNs
Uuv0U5zs
ReWZSes
MglHvC8A
ZlaLIDjY
mZcQRko
GcnGHJXM
mlbcSY8
YpKLY2bQ