neerajkumar

def flatten_array(array)
  array.each_with_object([]) do |element, flat|
    flat.push *(element.is_a?(Array) ? flatten_array(element) : element)
  end
end

neerajkumar

require 'byebug'
require 'csv'
require 'open3'

urls = []
## 1.csv is the path your CSV file which contains the URLs to check.
CSV.foreach("1.csv") do |row|
  stdout, stderr, status = Open3.capture3("curl #{row.first}")
  urls << row.first if stdout == 'Not Found'
end

neerajkumar

require 'active_model'


## includes AttributeMethods, Dirty, Validations, Callbacks, Conversion, Model, Naming, Serialization, Translation
class Person
  include ActiveModel::AttributeMethods

  attribute_method_prefix 'reset_'
  attribute_method_suffix '_highest?'
  define_attribute_methods 'age', 'firstname'

neerajkumar

require 'rest-client'
require 'json'
require 'byebug'

def upload
  options = {
    # Slack channel webhook integration token
    token: '123456789-xxxaaaddffggbbb',
    file: File.new("error_hotels.csv", 'rb'),
    filename: "error_hotels.csv",

neerajkumar

class String
  def maulin! n
    slice! n
    self
  end

  def maulin n
    dup.maulin! n
  end
end

neerajkumar

public class Solution4 {

    static int solve(String str) {
        String programmer = "programmer";

    	String head = programmer;

    	int i = 0;
    	// programmer
        for (; i < str.length(); i++) {

neerajkumar

/*
  You are given an empty stack. Your task is to perform following three operations:
  push a: Push an integer a, to the top of the stack
  pop: Pop the top element from the stack. It is guaranteed that stack is not empty, when performing the pop operation.
  inc x d: Add d to bottom x elements of the stack.
  After each operation, print the top element of the stack, if after an operation, the stack becomes empty, then print EMPTY.

  Input Format:
  The first line of the input is n, total number of operations performed on the stack. 
  Each of the next n lines is one of the three operations listed above.

neerajkumar

# -*- coding: utf-8 -*-
=begin
  You are given an empty stack. Your task is to perform following three operations:
  push a: Push an integer a, to the top of the stack
  pop: Pop the top element from the stack. It is guaranteed that stack is not empty, when performing the pop operation.
  inc x d: Add d to bottom x elements of the stack.
  After each operation, print the top element of the stack, if after an operation, the stack becomes empty, then print EMPTY.

  Input Format:
  The first line of the input is n, total number of operations performed on the stack.

neerajkumar

def merge(left, right, a)
  i, j, k = 0, 0, 0

  while(i < left.length && j < right.length) do
    if left[i] <= right[j]
      a[k] = left[i]
      i += 1
    else
      a[k] = right[j]
      j += 1

neerajkumar

function merge(left, right, a) {
	let i = 0;
	let j = 0;
	let k = 0;

	while(i < left.length && j < right.length) {
		if(left[i] <= right[j]) {
			a[k] = left[i];
			i++;
		} else {