## Advent of Code 2020, Day 3

..##……. #…#…#.. .#….#..#. ..#.#…#.# .#…##..#. ..#.##….. .#.#.#….# .#……..# #.##…#… #…##….# .#..#…#.# ..##………##………##………##………##……. —> #…#…#..#…#…#..#…#…#..#…#…#..#…#…#.. .#….#..#..#….#..#..#….#..#..#….#..#..#….#..#. ..#.#…#.#..#.#…#.#..#.#…#.#..#.#…#.#..#.#…#.# .#…##..#..#…##..#..#…##..#..#…##..#..#…##..#. ..#.##…….#.##…….#.##…….#.##…….#.##….. —> .#.#.#….#.#.#.#….#.#.#.#….#.#.#.#….#.#.#.#….# .#……..#.#……..#.#……..#.#……..#.#……..# #.##…#…#.##…#…#.##…#…#.##…#…#.##…#… #…##….##…##….##…##….##…##….##…##….# .#..#…#.#.#..#…#.#.#..#…#.#.#..#…#.#.#..#…#.# —> .̲.##………##………##………##……. #…̲#…#..#…#…#..#…#…#..#…#…#.. .#….#̲..#..#….#..#..#….#..#..#….#..#. ..#.#…#.̲#..#.#…#.#..#.#…#.#..#.#…#.# .#…##..#..#̲…##..#..#…##..#..#…##..#. ..#.##…….#.#̲#…….#.##…….#.##….. .#.#.#….#.#.#.#..̲..#.#.#.#….#.#.#.#….# .#……..#.#……..#̲.#……..#.#……..# #.##…#…#.##…#…#.#̲#…#…#.##…#… #…##….##…##….##…##̲….##…##….# .#..#…#.#.#..#…#.#.#..#…#̲.#.#..#…#.#

## Perl Weekly Challenge 88, Part 2

You are given m x n matrix of positive integers. Write a script to print spiral matrix as list.

## Perl Weekly Challenge 88, Part 1

You are given an array of positive integers @N. Write a script to return an array @M where $M[i] is the product of all elements of @N except the index $N[i].

## Perl Weekly Challenge 87, Part 2

You are given matrix m x n with 0 and 1. Write a script to find the largest rectangle containing only 1. Print 0 if none found. Input: [ 1 0 1 0 1 0 ] [ 0 1 0 1 0 1 ] [ 1 0 1 0 1 0 ] [ 0 1… Continue reading Perl Weekly Challenge 87, Part 2 →

## Perl Weekly Challenge 87, Part 1

You are given an unsorted array of integers @N. Write a script to find the longest consecutive sequence. Print 0 if none sequence found. Input: @N = (20, 30, 10, 40, 50) Output: 0

## Perl Weekly Challenge 86, Part 2

You are given Sudoku puzzle (9×9). Write a script to complete the puzzle and must respect the following rules: Each row must have the numbers 1-9 occuring just once. Each column must have the numbers 1-9 occuring just once. The numbers 1-9 must occur just once in each of the 9 sub-boxes (3×3) of the… Continue reading Perl Weekly Challenge 86, Part 2 →

## Perl Weekly Challenge 86, Part 1

You are given an array of integers @N and an integer $A. Write a script to find find if there exists a pair of elements in the array whose difference is $A. Print 1 if exists otherwise 0.

## Perl Weekly Challenge 85, Part 2

You are given a positive integer $N. Write a script to find if it can be expressed as a ** b where a > 0 and b > 1. Print 1 if you succeed otherwise 0.

Loading…

Something went wrong. Please refresh the page and/or try again.

### Follow My Blog

Get new content delivered directly to your inbox.