Skip to main content

Using Node.JS Build A Simple App

Get started with Node.JS in 2 minutes
  1. Install Node.JS
  2. Create an account with MongoDB Atlas
  3. Create Node.JS project
    • npm init
  4. Install dependencies
    • npm install --save express bcryptjs passport ejs express-ejs-layout mongoose connect-flash express-session
  5. Install nodemon to restart server on every save
    • npm install -D nodemon
  6. Add to scripts in package.json the following
    • "scripts":{"start":"node app.js", "dev":"nodemon app.js"}
  7. Create app.js file
  8. Add boiler plate express
    • const express =  require("express");
    • const app = express();
    • const PORT = process.env.PORT || 5000;
    • app.listen(PORT, console.log(`Server started on PORT ${PORT}`));
  9. Run the following in terminal
    • npm run dev
  10. Create folder routes
  11. Create two files inside routes
    1. index.js
    2. users.js
  12. Inside routes/index.js add the following
    • const express = require("express");
    • const router = express.Router();
    • router.get('/', (req, res) => res.send("Welcome"));
    • module.exports = router;
  13. Inside app.js add the following under const app = express();
    • app.use('/', require('./routes/index'));
  14. Open localhost:5000 in browser

Comments

Post a Comment

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...
Post a Comment
Read more

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.
1 comment
Read more

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...
Post a Comment
Read more