Skip to content
Shadow Cipher
Search
Ctrl
K
Cancel
GitHub
Select theme
Dark
Light
Auto
Home
Computer Networking
Cyber Security
IT Security
English Speaking
How to speak Alone?
3000 Words
Grammar
Stammering
Basic Exercises?
My Notes
Solutions
Daily Plan
Video Guide
Training Guide
Soft Skills
IT Support
Foundations
Lac 01: Welcome to IT Support
Lac 02: Intro to IT
Lac 03: Intro to Hardware
Lac 03: Building PC
Lac 03: Mobile Devices
Lac 06: Operating Systems
Lac 08: Networking
Lac 09: Software
Lac 10: Troubleshooting
Lac 11: Soft Skills
Operating Systems
Lac 01: Files & Directories
Lac 02: Using Command Lines
Lac 03: Using Command Lines
Lac 04: Package and Software management
Lac 05: Filesystems
Lac 06: Process Management
Lac 07: Remote System in Practice
Computer Networking
Lac 01: Introduction to Networking
Lac 02: The Network Layer
Lac 03: Transport and Application Layers
Lac 04: Networking Services
Lac 05: Networking Services - Best practice and Technologies
Lac 06: Connecting to the Internet
Lac 07: Troubleshooting and the Future of Networking
System Administration and IT Infrastruture Services
Lac 01: Network and IT Infrastructure Services
Lac 02: Software and Platform Service
Lac 03: What is system Administration?
Lac 04: Data Recovery & Backups
Lac 05: Directory Services
IT Security
Lac 01: Understanding Security Threads
Lac 02: Pelcgbytbtl(Cryptography)
Lac 03: AAA Security
Lac 04: Company Culture for Security
Lac 05: Defence in Depth
Lac 06: Pelcgbybtl(Cryptology)
Lac 07: Securing Your Networks
Operating System
System Administration
Troubleshooting and debugging
Git & Github
Git commands
Frameworks
Data Structure & Algorithms
Table Content
Pseudo Code and Flow chart
Programming Introduction
Bitwise Operators
Basic Questions
Pattern Questions
Array Basics
Array Questions
Space Time Complexity
Binary Search
Binary Search Fundamentals
First and Last Position
Peak Index In Mountain Array
Pivot Index In Rotated Array
Element K Position
Square Root Precision
Book Allocation
Aggressive Cows
Painter's Partition
Array Questions
Check Rotated Sorted Array
Rotation using modulus
Strings
String Fundamentals
Basic Questions
Sortings
Selection Sort
Bubble Sort
Insertion Sort
2D Array
Introduction
Basic Questions
Search In 2D Matrix
Binary Search In 2D Matrix
Spiral Order Traversal
Wave Print
Maths
Fast Exponentiation
Greatest Common Divisor
Insertion Sort
Pointers
Introduction
Pointers Array
Pointer Function
Pointer String
Double Pointers
Introduction
MCQs
Recursion
Introduction
Day-1 Questions
Factorial
Power of Num
Day-2 Questions
Climb Stairs
Fibinacci Series
Say Digits
Walking Examples
Day-3 Questions
Is Sorted
Sum Of Array Elements
Linear Serach
Binary Search
Day-4 Questions
Reverse String
Check Palindrome
Exponent
Bubble Sort
Selection Sort
Insertion Sort
Day-5 Questions
Inversion Count
Merge Sort
Day-6 Questions
Quick Sort
Day-7 Questions
Sub Sequences
Sub Sets
Day-8 Questions
Keypad
Day-9 Questions
Permutation of String
Day-10 Questions
Rat In Maze
Space-Time Complexity: Recusrive Algorithms
OOPS concept
Introduction Of OOPS
Pillars of OOPS Concept
Linked List
Day 01
Introduction
Singly Linked List
Doubly Linked List
Circular Linked List
Day 02
Reversed Linked List
Reversed DLL
Middle Of Linked List
Day 03
Reversed LL In K Groups
Check Circular List
Day 04
Detect Loop
Flyod Cycle Detection
Beginning Of The Loop
Remove Loop
Day 05
Remove Duplicates In Sorted
Remove Duplicates In UnSorted
Split Circular
Day 06
Sort In LL
Check Palindrome
Add 2 Numbers Represented
Clone a Linked List
Merge Sort and Flatted A Linked List
Stack
Day 01
STL Implementation
Array Implementation
Linked List Implementation
Two Stack In An Array
Day 02
Reverse String
Delete Middle Of Stack
Valid Parenthesis
Insert An Element At Bottom
Reverse Stack using Recursion
Sort Stack
Reduntant Brackets
Minimum Cost to make string valid
day 03
Next Smaller Element
Previous Smaller Element
Largest Reactange In Histogram
Celebrity Problem
Max Reactangle Matrix
N Stack in An Array
Get Min In 0(1) TC
Queue
Day 01
Queue STL Implementation
Queue Array Implementation
Queue Linked List Implementation
Circular Queue
Input Restricted Queue
Output Restricted Queue
Doubly Ended Queue STL
Doubly Ended Queue Implementation
Day 02
Queue Reversal
Binary Tree
Day 01
Introduction
Pre-order Traversal
In-order Traversal
Post-order Traversal
Reverse Level Order
Day 02
Height Of Binary Tree
Diameter Of Binary Tree
Check Balanced
Check Identical
Sum Of Tree
Day 03
Zig-Zag traversal
Boundry traversal
Vertical Order traversal
Top View
Bottom View
Left View
Right View
Diagnol Traversal
Binary Search Tree(BST)
Day 01
BST Implementation
BST Traversal
BST Search
BST - Min - Max
BST - Deletion
Day 02
Validate BST
BST - Kth smallest
BST - Kth smallest By Morris Traversal
BST - Kth Largest
InOrder Predecessor Successor
BST - LCA
Day 03
Two Sum in BST
Flatten BST to Sorted List
Normal BST to Balanced BST
Perorder to BST
Day 04
Merge2BST InOrder
Merge2BST LinkedList
Max BST in Binary Tree
Heap
Day 01
Heap Introduction
Build Min Heap
Heap Sort
Max Heap By Priority Queue
Min Heap By Priority Queue
Day 02
Kth Smallest Element
Kth Largest Element
Is binary Tree Heap
Merge 2 MaxHeaps
Minimum cost of Ropes
BST to Min Heap
Day 03
Kth Largest Sum Of Subarrays
Merge K Sorted Arrays
Merge K Sorted List
Smallest Range In K List
Median In A Stream
Hashmap
Unordered Map
Maximum Frequency Number
Trie and Backtracing
Trie
Trie Intro
Longest Common Prefix By Comparisons
Longest Common Prefix By Tries
Phone Directory
Backtracking
Rat In Maze
N Queens
N Queens Hashmaps
Valid Sudoku
Graph
Day 01
Adjacency List
Adjacency List General
Adjacency Matrix
Create Graph And Print It
Day 02
BFS Traversal
DFS Traversal
Cycle Detection In Undirected Graph Using BFS
Cycle Detection In Undirected Graph Using DFS
Day 03
Cycle Detection In Directed Graph
Topological Sort Using DFS
Topological Sort Using Kahns Algorithm
Detect Cycle In A Directed Graph
Day 04
Shortest Path In Undirected Graph
Shortest Path In Directed Acyclic Graph
Shortest Path In DAG Using Graph Class
Shortest Path Using Dijkstras Algorithm
Day 05
Prism MST
Disjoint Set
Kruskals MST
Bridges In Graph
Articulation Point In Graph
Kosaraju Algorithm
Bellmon Ford Algorithm
DP Series
Fibonacci Series
Climbing Stairs
Min Cost Climbing Stairs
Minimum Elements
Max Non Adjacent Sum
House Robber Problem
Cut Rod Into Segments
System Design
System Design Basics
Scalability
Load Balancer
Caching
Database
Indexing
Sharding
CAP Theorem
Consistent Hashing
Message Queue
Proxies
CDN
Web Sockets
Long Polling
Graph QL
REST API
gRPC
OAuth
SLA, SLO, SLIs
Monitoring and Logging
Load Testing
Design Patterns
Microservices
Serverless Architecture
Case Studies
Design Youtube
Design Instagram
Design WhatsApp
Design Twitter
Design Facebook
Design Dropbox
Design Netflix
Design Uber
Design Airbnb
Design Linkedin
Design Messenger
Design Slack
Design Quora
Design Reddit
Design Zoom
Design Tinder
Design Medium
Design StackOverflow
Design PayPal
Design Google Drive
Design Amazon
Design Yelp
Design Eventbrite
Design BookMyShow
Design Trello
Design Canva
Design Discord
Design GitHub
Design StackShare
Design Hike
Interview Preparation
FrontEnd Interview QUestions
React.js
JavaScript
CSS
HTML
Web APIs
Browser Rendering
Performance Optimization
Next.JS
Backend Interview Questions
Node.js
Databases
APIs
Authentication & Authorization
Caching
Message Queues
Microservices
Roadmaps
Back-End Roadmap
Computer Networking
Cyber Security Roadmap
Data Structure And Algorithms Roadmap
Detective
Front-End Roadmap
Full Stack Roadmap
Iron-Man
Software Development Engineer(SDE) Roadmap
sql
Basic SQL Commands
SQL Revision Notes
Languages
Javascript
Basics
Basics 02
Basics 03
Advanced One
Classes and OOPs
Control Flow
DOMs
Events
Iterations
Closures
Typescript
Basics
Advanced
C
Lacture 01
Lacture 02
Lacture 03
Lacture 04
Lacture 05
Lacture 06
Lacture 07
Lacture 08
Lacture 09
Lacture 10
Lacture 11
Python
Basics
Conditionals
Loops
funtions
Scopes
OOPs
Decorators
Error Handling
DB Sqlite
Handling Apis
Pyhton MongoDB
Vurtual PY
Jupiter Notes
Nest Js
Basics
GitHub
Select theme
Dark
Light
Auto
BST - Kth smallest By Morris Traversal