Git Architecture Simplified:

1. Working Tree: This represents the current directory and files you are working on. This is where you make changes to your code or files.

git add/mv/rm: These commands allow you to stage changes. git add stages new changes, git mv stages file renames, and git rm stages file deletions.

git diff: This shows differences between the working tree and the staging area.

git diff HEAD: This shows differences between the working tree and the last commit in the local repository.

2. Staging Area: After you make changes in the working tree, you can stage them (i.e., prepare them for a commit).

The staging area is an intermediate area where these changes are stored before they are permanently stored in the local repository.

git commit: This command moves changes from the staging area to the local repository, creating a new commit.

3. Local Repository: Your commits are stored on your local machine.

git reset <file>: This command un-stages changes, moving them from the staging area back to the working tree.

git reset <commit>: This can be used to undo commits or change the current branch's head to a specific commit.

4. Remote Repository: This represents an online (or network) storage location where you store versions of your project. It's useful for collaborating with others and backing up your work.

git push: This command pushes changes from your local repository to the remote repository.

git fetch: This fetches changes from the remote repository without integrating them.

git clone/pull: git clone copies the remote repository to your local machine. git pull fetches changes from the remote repository and merges them into your current branch.
----------------------------------------------------------
Hope it was helpful!
@javascript_resources
@python_assets

JavaScript String Functions🔥

Complete DSA Roadmap🔥
|
|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| └─ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | └─ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | └ Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | └ Bellman-Ford_Algorithm
| | |
| | └─ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | └ Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | └─ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| └─ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| └─ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| └─ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| └─ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| └─ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| └─ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| └─ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| └─ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | └─ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | └─ Mobius_Function
| |
| └─ String_Algorithms
| |-- KMP_Algorithm
| └─ Rabin-Karp_Algorithm
|
|-- Online_Judges_and_Practice_Platforms
| |-- LeetCode
| |-- HackerRank
| |-- CodeChef
| |-- Codeforces
| └─ HackerEarth
|
└─ Interview_Preparation
|-- Commonly_Asked_DSA_Interview_Questions
|-- Mock_Interviews
|-- Problem-Solving_Strategies
|-- Time_and_Space_Complexity_Analysis
└─ Coding_Patterns_and_Techniques

@javascript_resources
@python_assets
------------------- END -------------------

Coding Platforms

• LeetCode
• HackerRank
• CodeChef
• GeeksforGeeks
• TopCoder

Book shared in resources channel

https://t.me/c/2109572262/871

For questions here is the Chat group link
https://t.me/+2KE896TMwHkxOWE1

For Resources aka PDfs and Ebooks group link

https://t.me/+eweUkdFwlho4YjRl

Join Python Channel
https://t.me/python_assets

Learn Backend development 💯

👨‍💻Languages:
- JavaScript
- Python
- Java
- PHP

🕹Frameworks:
- Express.js
- Django
- Flask
- Laravel
- Spring

📊Database:
- MySQL
- PostgreSQL
- MongoDB
- Firebase
- Supabase

🧱Containerization Tools:
- Docker
- Kubernetes

Top 12 Tips for API Security

- Use HTTPS
- Use OAuth2
- Use WebAuthn
- Use Leveled API Keys
- Authorization
- Rate Limiting
- API Versioning
- Whitelisting
- Check OWASP API Security Risks
- Use API Gateway
- Error Handling
- Input Validation

What are cookies?

What is facicon and How to add a Favicon to a website❓

▪️ Favicon is a small image that appears beside the website name.
▪️ It is known by many names like tab icon, bookmark icon because it is displayed on a browser's tab, bookmark bar etc.
▪️ Most famous & widely used format for favicon is .ico

1. How to create a Favicon?

▪️ Any image can work but it should be small & simple with high contrast
▪️ Normally preferred sizes are 16 x 16 and 32 x 32.
▪️ You can also create & download a favicon using these sites →
• favicon.cc
• favicon.io

2. Adding Favicon to Website

▪️ a favicon is added via <link> tag
▪️ Just add the <link> tag inside <head> with the path to the favicon.

⬇️