Skip to main content

Node.JS Interview Questions and Answers


  1. What is an error-first callback?
    1. https://nodejs.org/api/errors.html#errors_error_first_callbacks
  2. How to print an error to console?
    1. console.error('There was an error', err);
  3. How to avoid a callback commotion?
    1. Use promises
  4. How to create a Promise?
    1. let promiseObject = new Promise((resolve, reject) => {});
  5. Difference between Promise and Callback?
    1. Callbacks handle success and failure, Promise has resolve and reject
    2. Callback can be called multiple times, Promise can be executed just once
  6. Why NodeJS?
    1. It is non-blocking / Asynchronous - Program goes on without being blocked with time consuming activity
    2. Node is single threaded
    3. Therefore Node is highly scalable
    4. Node should be used for data intensive, realtime applications and not for processing intensive applications
    5. It is built on top of Chrome V8 Engine
    6. Used by LinkedIn, Walmart, Paypal, Uber, Netflix
    7. Javascript in Frontend and Backend too
    8. Goes hand in hand with React and Angular
    9. Cross Platform - Can be installed on Windows/Linux/Mac
    10. Active Development Community
    11. It is a technology of choice. Not just a fad
    12. It is a bare bones framework
    13. Documentation is good
    14. Availability of good tutorials and solutions support is good.

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