vadimkorr

...
@Component({
  selector: 'custom-input',
  templateUrl: './input.component.html',
  styleUrls: ['./input.component.css'],
  providers: [{
    provide: NG_VALUE_ACCESSOR,
    useExisting: forwardRef(() => InputComponent),
    multi: true,
  }]

vadimkorr

import { Component, Input, ViewChild, ElementRef, Renderer2, forwardRef } from '@angular/core';
import { ControlValueAccessor } from '@angular/forms';

@Component({
  selector: 'custom-input',
  templateUrl: './input.component.html',
  styleUrls: ['./input.component.css']
})
export class InputComponent implements ControlValueAccessor {

vadimkorr

import { Component, Input, ViewChild, ElementRef } from '@angular/core';

@Component({
  selector: 'custom-input',
  templateUrl: './input.component.html',
  styleUrls: ['./input.component.css']
})
export class InputComponent {
  value: string = '';
  @Input() type: string = 'text';

vadimkorr

<input
  #inputElement
  [value]="value"
  [type]="type"
  [id]="id"
  [placeholder]="placeholder"
  (change)="onChange($event)"
  (keyup)="onKeyup($event)"
  (blur)="onBlur($event)">

vadimkorr

const tree = {
    and: {
        left: {
            and: {
                left: {
                    le: {
                        left: {
                            fieldRef: "a.count"
                        },
                        right: {

vadimkorr

// Restore bracket sequence

function restore(str) {
  let arr = [];
  let counter = 0;
  for(let i=0; i<str.length; i++) {
    if (str[i]=='(') {
      arr.push('(');
      counter++;
    } else { // str[i]==')'

vadimkorr

// Implement Queue interface using Stack interface as a storage

function queue() {
  this.stack = [];
}

queue.prototype.enq = function(item) {
  this.stack.push(item);
}

vadimkorr

// Given an array of n  integers, find and print the minimum absolute difference
// between any two elements in the array (where i!=j, 2<=n<=10^9) 

function findMinDiff(arr) {
  let n = arr.length;
  // Sort array in non-decreasing order
  arr.sort(function(a, b) {
    return a - b;
  });

vadimkorr

// Count inversions of array

function getInvCount(arr) {
  let n = arr.length;
  let invCount = 0;
  for (let i = 0; i < n - 1; i++)
    for (let j = i + 1; j < n; j++)
      if (arr[i] > arr[j])
        invCount++;

vadimkorr

// Find all possible sums made from subsets of items from array A

function subsetSums(arr, l, r, sum = 0) {
  // Print current subset
  if (l > r) {
    console.log(sum);
    return;
  }

  // Subset including arr[l]