How to deploy angular app to github pages?

Deploying an Angular application to GitHub Pages involves building the application for production and then pushing the generated files to a specific branch in your GitHub repository.

Steps to Deploy an Angular App to GitHub Pages:

Create a GitHub Repository: If you don't already have one, create a new public repository on GitHub for your Angular project.

Build Your Angular App for Production:

Use the Angular CLI to build a production-ready version of your application. The --base-href flag is crucial for ensuring the application's assets are correctly referenced on GitHub Pages.

ng build --configuration production --base-href "https://<your-username>.github.io/<your-repo-name>/"

Replace <your-username> with your GitHub username.

Replace <your-repo-name> with the name of your GitHub repository.

If you are deploying to a user or organization page (e.g., username.github.io), you can omit the repository name from the base-href.

Install angular-cli-ghpages (Optional but Recommended):

This tool simplifies the deployment process by handling the creation and pushing of the gh-pages branch.

npm install -g angular-cli-ghpages

Deploy to GitHub Pages.

If you installed angular-cli-ghpages:

npx angular-cli-ghpages --dir=dist/<your-project-name>

Replace <your-project-name> with the name of your Angular project (found in your angular.json file under defaultProject).

This command will build your app (if not already built) and push the contents of the specified dist directory to the gh-pages branch of your repository.

Comments

Poridhi: Stacks & Queues

Stacks & Queues related problems: This collection of solutions tackles three classic problems often encountered in technical interviews and competitive programming. The Valid Parentheses problem checks whether a string has properly matched and ordered brackets using a stack. The Sliding Window Maximum efficiently finds the maximum value in every window of size k across an array using a deque, a popular sliding window pattern that ensures optimal performance. The Stock Span Problem simulates a real-world stock analysis scenario and calculates the number of consecutive days before today for which the stock price was less than or equal to today's, also utilizing a stack for efficient computation. These problems test understanding of stacks, queues, and sliding window techniques. ✅ Valid Parentheses def isValid ( s: str ) -> bool : stack = [] mapping = { ')' : '(' , '}' : '{' , ']' : '[' } for char in s: ...

Data Recovery: DevOps pre-state learning

Data Backup Data backup is the practice of copying data from a primary to a secondary location, to protect it in case of equipment failure, cyberattack, natural disaster or other data loss events. This can include documents, media files, configuration files, machine images, operating systems, and registry files. Essentially, any data that we want to preserve can be stored as backup data. Data Restore Data restore is the process of copying backup data from secondary storage and restoring it to its original location or a new location. A restore is performed to return data that has been lost, stolen or damaged to its original condition or to move data to a new location. Pilot Light A pilot light approach minimizes the ongoing cost of disaster recovery by minimizing the active resources, and simplifies recovery at the time of a disaster because the core infrastructure requirements are all in place. Warm Standby The warm standby approach involves ensuring that there is a scaled down, ...

Poridhi: Basic Programming & Math

Basic Programming and math related problems: Extracting digits means breaking a number like 1234 into [1, 2, 3, 4], often using string conversion or modulo/division. Counting digits involves finding how many digits are in a number using length of a string or repeated division. Reversing an integer flips its digits (e.g., 123 becomes 321), with care for signs and 32-bit limits. A palindrome number reads the same forward and backward, often checked by comparing the original and reversed number. Armstrong numbers are those equal to the sum of their digits each raised to the number of digits, like 153 = 1³ + 5³ + 3³. To find the sum of all divisors of a number, loop through integers and check which divide the number without a remainder. Prime numbers are only divisible by 1 and themselves, and checking up to the square root is efficient. GCD, the greatest common divisor of two numbers, can be found using a simple loop or more efficiently with the Euclidean algorithm, which uses repeated mo...

Programming With Rakib

Search This Blog