Author: admin

Simple PHP code to upload a file (pdf , doc,docx)

Here is the simple php code to upload a pdf file

/* file upload */

 $allowedExts = array("pdf", "doc", "docx"); 
 $targetfolder = $resume_upload_path; // UPLOAD path e.g '/home/public_html/upload'
 $random_num=rand(1000,9999);
$targetfolder = $targetfolder . $random_num.str_replace(' ', '_', basename($_FILES['resume_pdf']['name'])) ;
$targetpath = $root_upload_path . $random_num.str_replace(' ', '_', basename($_FILES['resume_pdf']['name'])) ;

$file_type=$_FILES['resume_pdf']['type'];
$extension = end(explode(".", $_FILES["resume_pdf"]["name"]));


 if ( 12000 < $_FILES["resume_pdf"]["size"]  ) {
 echo "error";  
 exit;
 }

 if ( ! ( in_array($extension, $allowedExts ) ) ) {

  echo "error";  
    exit;
  
 }
 $file_path="";
 if(move_uploaded_file($_FILES['resume_pdf']['tmp_name'], $targetfolder))

 {

 $file_path=$targetpath ;

  }

 else {


  echo "error";  
    exit;
 

 }
 
/* file upload end*/

where $file_path is the path of uploaded file

Drupal 8 Query to get similar blog post

Here we are going to fetch similar blog by blog node id, so inside .theme file
( in theme root folder) you can add below code and fetch similar blog by “field_blog_tags” field in drupal 8

Drupal 8 Query to get similar blog post

   $valuesTags=$variables['node']->get('field_blog_tags')->getValue();
  foreach($valuesTags as $key=>$value)
   {
   
   $smilarprd[]=$value['target_id'];
   }

   $nids = \Drupal::entityQuery('node')->condition('type', 'blog_post')->condition('field_blog_tags', $smilarprd,'IN')->condition('nid', $Nid, '!=')->range(0, 3)->execute();
  $RelatedBlog =  \Drupal\node\Entity\Node::loadMultiple($nids);
 
 $variables['RelatedBlog'] = $RelatedBlog;

How would you implement Fibonacci sequence generation?

The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, starting from 0 and 1. Here are several methods to generate the Fibonacci sequence:

1. Iterative Approach (Efficient)

def fibonacci_iterative(n):
    sequence = []
    a, b = 0, 1
    for _ in range(n):
        sequence.append(a)
        a, b = b, a + b
    return sequence

# Example usage
print(fibonacci_iterative(10))  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

2. Recursive Approach (Less Efficient for Large n)

def fibonacci_recursive(n):
    if n <= 1:
        return n
    return fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2)

# Generate a sequence
n = 10
sequence = [fibonacci_recursive(i) for i in range(n)]
print(sequence)  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Note: This approach has exponential time complexity (O(2n)O(2^n)) due to repeated calculations.

3. Memoization (Efficient Recursive Approach)

from functools import lru_cache

@lru_cache(maxsize=None)
def fibonacci_memoized(n):
    if n <= 1:
        return n
    return fibonacci_memoized(n - 1) + fibonacci_memoized(n - 2)

# Generate a sequence
n = 10
sequence = [fibonacci_memoized(i) for i in range(n)]
print(sequence)  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

4. Generator Approach

def fibonacci_generator(n):
    a, b = 0, 1
    for _ in range(n):
        yield a
        a, b = b, a + b

# Example usage
print(list(fibonacci_generator(10)))  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

5. Matrix Exponentiation (Advanced)

This method uses matrix exponentiation for a logarithmic time complexity solution.

import numpy as np

def fibonacci_matrix(n):
    F = np.matrix([[1, 1], [1, 0]])
    result = (F ** (n - 1))[0, 0]
    return result

# Generate a sequence
n = 10
sequence = [fibonacci_matrix(i) for i in range(1, n + 1)]
print(sequence)  # Output: [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]

6. Using a Formula (Binet’s Formula)

The Fibonacci number can also be computed using the golden ratio (ϕ\phi): F(n)=ϕn−(1−ϕ)n5F(n) = \frac{\phi^n – (1 – \phi)^n}{\sqrt{5}}

import math

def fibonacci_formula(n):
    phi = (1 + math.sqrt(5)) / 2
    return round((phi**n - (-1/phi)**n) / math.sqrt(5))

# Generate a sequence
n = 10
sequence = [fibonacci_formula(i) for i in range(n)]
print(sequence)  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Best Practice

  • Use the iterative approach or generator for most practical applications.
  • Use memoization for recursive implementations if you need recursion and want to avoid repeated calculations.
  • Use matrix exponentiation or Binet’s formula for very large Fibonacci numbers.