anushshukla

/*
  At  logistics  we deal with package weights before shipment.
  Lets say there are infinite number of packages  arranged in increasing order of weights.
  You have to find if a package of given weight (W) exist . 
  If exist return position else return -1;
  
  Infinite : You will never be able to know size of array (Arr.length/size is not possible)
  eg. [2,3,6,10, 46 , 49 , 100 , 110 , . , . , . , . , …..]
*/

anushshukla

/*
    

    You are required :
    1. pack as many words as you can in each line
    2. Extra spaces between words should be distributed as evenly as possible.
    3. For the last line of text, it should be left-justified
*/

const getLineOutput = (strArr: string[], maxCharsInLine: number): string[] => {

anushshukla

Why do we need it?

Adding replicas in Mongo helps us achieve high scalability and availability.

How do we setup it?

We can add secondary nodes and arbiters (for primary election purpose only) if required.

What is the possible best setup?

Best recommendation is to start with https://docs.mongodb.com/manual/core/replica-set-architecture-three-members.

At the application, connection string needs to updated with other nodes host and port while setting the readPreference=secondayPreferred. (citing Read Preference) while having readConcern=majority (citing Read Concern).

anushshukla

'use strict';

const fs = require('fs');

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;

anushshukla

interface String {
    aio(substr: string): number;
}

// S -> Space complexity
// T -> Time complexity
// n -> length of the string
// m -> length of the substr
// Overall complexity -> T(n+m) & S(n)
String.prototype.aio = function(substr: string): number {

anushshukla

Problem statement

When the system performs not upto expectation in terms of UX or/and system resources utilisation.

Solutions

When to apply cache?

We need to cache data when its fetching consumes a lot of machine resources and response time doesn't meet expectation while its frequently not updated & frequently requested

anushshukla

type TypeNode = BinaryNode | null;

class BinaryNode {
    public value: number;
    private _leftChild: TypeNode;
    private _rightChild: TypeNode;
    constructor(node: number, leftChild: TypeNode = null, rightChild: TypeNode = null) {
        this.value = node;
        if (leftChild) {
            this._leftChild = leftChild;

anushshukla

function isPalindrome(num: number): boolean {
    let reversedNum = 0;
    let x = num;
    while (x > 0) {
        reversedNum = reversedNum * 10 + x % 10;
        x = x / 10 >> 0; // >> removes decimal
    }
    return reversedNum === num;
};

anushshukla

const removeProductsFromPile = (pileOfProducts, indexStart = 0, endIndex = pileOfProducts.length, maxProducts, reduceBy = 'max') => {
    pileOfProducts.map((product, currentProductIndex) => {
        
        const productsLeftInPile = product - 1;
        let lastProductsPickCount;
        for (let nextProductIndex = currentProductIndex + 1; nextProductIndex < pileOfProducts.length; nextProductIndex++) {
            const nextPileOfProduct = product[nextProductIndex];
            if (nextPileOfProduct > product) {
                maxProducts = product + nextPileOfProduct;
            }

anushshukla

'use strict';

const fs = require('fs');

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;