kuriringohankamehameha

/**
    Code for https://journaldev.com article
    Purpose: A Trie Data Structure Implementation in C
    @author: Vijay Ramachandran
    @date: 20-02-2020
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

bschwedler

Having no excuses to disable SELinux

Is this thing on?

$ getenforce
Enforcing

$ sestatus
SELinux status:                 enabled

jreyes33

# …
tasks:
  - name: Inspect postman file
    stat: path=~/bin/Postman/Postman
    register: postman_file

  - name: Install postman
    when: not postman_file.stat.exists
    unarchive:
      remote_src: yes

thedevsaddam

package main

import (
	"bufio"
	"fmt"
	"os"
)

func main() {

hygull

/*
  {
    "date_of_creation" => "19 Dec 2016, Mon",
    "aim_of_program"   => "Matrix multiplication in Golang",
    "coded_by"         => "Rishikesh Agrawani",
    "Go_version"       => "1.7",
  }
*/
package main

andreicristianpetcu

An Ansible summary

Jon Warbrick, July 2014, V3.2 (for Ansible 1.7)

Configuration file

intro_configuration.html

First one found from of

maksadbek

package main

import "fmt"

type Node struct {
	prev *Node
	next *Node
	key  interface{}
}

STashakkori

__author__ = 'sina'

def main():
    f("12365212354", 26)

def f(numbers, target):
    for i in range(1, len(numbers)):
        current = int(numbers[0:i])
        to_end = numbers[i:-1]
        evaluate(0, current, to_end, target, current)

iamkevinlowe

# The first 12 digits of pi are 314159265358. We can make these digits into an expression evaluating to 27182 (first 5 digits of e) as follows:

# 3141 * 5 / 9 * 26 / 5 * 3 - 5 * 8 = 27182   
# or 
# 3 + 1 - 415 * 92 + 65358 = 27182

# Notice that the order of the input digits is not changed. Operators (+,-,/, or *) are simply inserted to create the expression.  

# Write a function to take a list of numbers and a target, and return all the ways that those numbers can be formed into expressions evaluating to the target. Do not use the eval function in Python, Ruby or JavaScript

jamesyang124

Red Black Tree revisit.

	TIME
INSERTION	O(log n)
DELETION	O(log n)
SEARCH	O(log n)

| SPACE | O(n) |