teleren/devto huggingface dataset:
PIC Projects
Tags: javascript, pic, projects, programming
Published: 2022-06-17 05:46:01

Engineering student projects for B.Tech and M.Tech final year students. Takeoff Edu Group offers a wide range of projects best for [pic projects](https://takeoffprojects.com/pic-projects) looking for magnificent final projects at low cost. 

We have successfully delivered pic projects to our engineering students. Our programs are specially designed by experts for best results of pic projects for engineering students. max of the B.Tech, M.Tech, PhD and Diploma scholars.
 
Takeoff Edu Group provides the most creative conceptions and ideas that can make very effective final year projects for scholars, experimenters, and engineers. So browse through our list of [pic projects](https://www.youtube.com/watch?v=sOXYfcy-x6I) and choose the smart final year projects for your requirements.


![Image description](https://dev-to-uploads.s3.amazonaws.com/uploads/articles/zlw3kbdj64yydkkg0ps7.png)

	PIC microcontrollers are a family of specialised microcontroller chips produced by Microchip Technology in Chandler, Arizona. The acronym PIC stands for "peripheral interface controller," although that term is never used nowadays. A microcontroller could be a compact microcomputer designed to control the operation of embedded systems in automobiles, robots, office machines, medical devices, mobile radios, vending machines, home appliances, and various other devices. A typical microcontroller includes a processor, memory, and peripherals.
The PIC microcontrollers appeal to hobbyists and experimenters, especially within the fields of electronics and robotics. Key features include wide availability, low cost, easy reprogramming with built-in EEPROM (electrically erasable programmable read-only memory), an extensive collection of free application notes, abundant development tools, and an excellent deal of knowledge available on the web. The PIC microcontrollers often appear under the name PICmicro.

Every PIC microcontroller contains a set of registers that also function as RAM (random access memory). Special purpose control registers for on-chip hardware resources also are mapped into the data space. Every PIC has a stack that saves return addresses. The stack wasn't software-accessible on the sooner versions of the PIC, but this limitation was removed in later devices.
Topographical survey companies in Marathahalli | SCONDESIGN
Published: 2022-06-17 05:41:29

Topographical survey companies in Marathahalli. topographic or topographical land survey shows the height, depth, size and location of any manmade or natural features on a given parcel of land, as well as the changes or contours in elevation throughout the parcel. While boundary surveys focus on horizontal measurements, topographic surveys are about elevation.To conduct a topographic survey, a surveying-quality global positioning system (GPS) unit and an electronic distance measurement (EDM) total station theodolite (TST) are used to determine the locations of features shown on the plan.  A topographic survey shows existing features, property lines, and contour lines that indicate the lay of the land.When companies begin their right of way acquisition process, they must conduct a variety of surveys, including topographic surveys. Their projects can’t be successful if the elevation and features of a parcel of land are not accounted for in the development, improvement or construction plans. While topographic surveys may not provide the same kind of image of a property as others, they’re irreplaceable because the details they provide can completely alter plans to build.Topographic surveys show elevation and land forms and have a myriad of practical applications. Though the number of surveys to conduct before beginning a project may be large, topography is vital and cannot be overlooked. If you’re looking to begin a project and conduct topographic or other surveys, contact us today.Topographic surveys were created in series to serve as the basis for larger topographic maps. Performed on a large scale, these surveys were meant to show elevations and landforms not listed on traditional maps and surveys. IF you are interested for demo pls contact us +918296698585
Installing Shopify CLI on Windows 10 via Subsystem for Linux (Ubuntu)
Published: 2022-06-17 05:31:40

I recently had to install the Shopify CLI on a fresh windows install and went thought the official Shopify documentation, which let to some problems.

I will just point out how I eventually managed to get it running.

First of all I am trying to get it running using the Linux Subsystem.

I have the Terminal running, set to Ubuntu (Settings/Default Profile)


![Image description](https://dev-to-uploads.s3.amazonaws.com/uploads/articles/89fv2fc7i7wyw5iowtk7.png)

First I installed Ruby from the Ruby website via the Windows installer. 

The Shopify Documentation specifically mentions you can install Ruby or Ruby + Dev Kit. 

Now when I tried to run "sudo gem install shopify-cli" I got the following error: 

![Image description](https://dev-to-uploads.s3.amazonaws.com/uploads/articles/4kxvpb1c31ebnxyvgr29.png)

To fix it I ran the following commands:

```
sudo apt update
sudo apt-get install gcc
sudo apt-get install ruby-dev
sudo apt install libc6=2.31-0ubuntu9.2 libc-bin=2.31-0ubuntu9.2
```

and then finally I could run "sudo gem install shopify-cli" successfully
Path Crossing
Tags: leetcode, dsa, theabbie
Published: 2022-06-17 05:30:40

Given a string `path`, where `path[i] = 'N'`, `'S'`, `'E'` or `'W'`, each representing moving one unit north, south, east, or west, respectively. You start at the origin `(0, 0)` on a 2D plane and walk on the path specified by `path`.

Return `true` _if the path crosses itself at any point, that is, if at any time you are on a location you have previously visited_. Return `false` otherwise.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/06/10/screen-shot-2020-06-10-at-123929-pm.png)

**Input:** path = "NES"
**Output:** false 
**Explanation:** Notice that the path doesn't cross any point more than once.

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/06/10/screen-shot-2020-06-10-at-123843-pm.png)

**Input:** path = "NESWW"
**Output:** true
**Explanation:** Notice that the path visits the origin twice.

**Constraints:**

*   `1 <= path.length <= 104`
*   `path[i]` is either `'N'`, `'S'`, `'E'`, or `'W'`.

**SOLUTION:**

    class Solution:
        def isPathCrossing(self, path: str) -> bool:
            x = 0
            y = 0
            visited = set()
            visited.add((x, y))
            for c in path:
                if c == 'N':
                    y += 1
                if c == 'E':
                    x += 1
                if c == 'S':
                    y -= 1
                if c == 'W':
                    x -= 1
                if (x, y) in visited:
                    return True
                visited.add((x, y))
            return False
N-Queens II
Tags: leetcode, dsa, theabbie
Published: 2022-06-17 05:00:46

The **n-queens** puzzle is the problem of placing `n` queens on an `n x n` chessboard such that no two queens attack each other.

Given an integer `n`, return _the number of distinct solutions to the **n-queens puzzle**_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/11/13/queens.jpg)

**Input:** n = 4
**Output:** 2
**Explanation:** There are two distinct solutions to the 4-queens puzzle as shown.

**Example 2:**

**Input:** n = 1
**Output:** 1

**Constraints:**

*   `1 <= n <= 9`

**SOLUTION:**

    class Solution:
        def getAllPos(self, usedCols, usedPosDiag, usedNegDiag, i, n):
            if i >= n:
                return [[]]
            op = []
            for j in range(n):
                if j not in usedCols and (i + j) not in usedPosDiag and (i - j) not in usedNegDiag:
                    val = self.getAllPos(usedCols.union({j}), usedPosDiag.union({i + j}), usedNegDiag.union({i - j}), i + 1, n)
                    op += [[j] + v for v in val]
            return op
        
        def getRow(self, i, n):
            val = ["."] * n
            val[i] = "Q"
            return "".join(val)
        
        def totalNQueens(self, n: int) -> int:
            queens = self.getAllPos(set(), set(), set(), 0, n)
            return len(queens)
Ansys training institute in marathahalli | cherryinstitute
Published: 2022-06-17 04:58:37

Ansys training insitute in bangalore. Ansys is a acronym stands for American Computer-aided engineering applications owned and developed by Ansys Inc. headquartered in United states which is a free simulation software that spans the whole range of physics, providing access to almost any field of technology simulation that a design procedure requires.Workbench provides a single interface to all Ansys tools. From the traditional structural tools into the various CFD solvers and technologies it has access to (Ansys acquired both Fluent and CFX in recent years) and the more special purpose technologies in its steady. The goal is to deliver a single platform that allows users to benefit from a more simple, schematic style approach to build simulation tasks. Its driven by constructing up and linking different construction blocks. Every one of these blocks allows you to take inputs and inputs from 1 stage and feed them into another or indeed, multiple procedures. ANSYS Fluent, CFD, CFX, FENSAP-ICE and relevant applications are Computational Fluid Dynamics applications tools used by engineers for analysis and design. While Ansys Autodyn and Ansys mechanical will be the resources for technical and finite element analysis instrument for structural analysis, such as linear, nonlinear and dynamic research studies. ANSYS HFSS, ANSYS Maxwell and ANSYS are the tools used in electronic flow for unique purposes. ANSYS Multiphysics along with ANSYS Workbench provide multiple ANSYS programs in a single bundle.ansys course syllabus, ansys course fee, ansys training from expert in Bangalore , Ansys training in Bangalore, Ansys courses in Bangalore, Ansys fluent training in Bangalore, Ansys fluent training classes in bangalore, ansys online course in bangalore, ansys online training program with certification in bangalore, ansys in bangalore, ansys course duration in Bangalore, best Ansys training institute with placement in Bangalore, Ansys certification in Bangalore, best institutes for Ansys training courses in bangalore, ansys training schedule in bangalore, ansys computer training institutes in bangalore, learn ansys course, online Ansys course in bangalore, Ansys certification cost, Ansys certification training in bangalore. If you are interested for demo pls contact us +91 8296698585
Getting Started with the Vue Financial Chart Component
Tags: webdev, vue
Published: 2022-06-17 04:44:31

Learn how easily you can create and configure our **Vue** [financial charts](https://www.syncfusion.com/vue-ui-components/vue-charts) in a Vue app using Visual Studio Code. In this video, you will learn how to add high low, open high low close, and candle financial charts to a Vue app and how to enable some of their built-in features. You will also learn how these charts visually indicate stock price data elements like high, low, open, close, and volume. 

_Product overview_: https://www.syncfusion.com/vue-ui-components/vue-charts

_Explore our tutorial videos_: https://www.syncfusion.com/tutorial-videos

{% youtube XunmiH9QRZU %}
Insert into a Binary Search Tree
Tags: leetcode, dsa, theabbie
Published: 2022-06-17 04:30:38

You are given the `root` node of a binary search tree (BST) and a `value` to insert into the tree. Return _the root node of the BST after the insertion_. It is **guaranteed** that the new value does not exist in the original BST.

**Notice** that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return **any of them**.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/10/05/insertbst.jpg)

**Input:** root = \[4,2,7,1,3\], val = 5
**Output:** \[4,2,7,1,3,5\]
**Explanation:** Another accepted tree is:
![](https://assets.leetcode.com/uploads/2020/10/05/bst.jpg)

**Example 2:**

**Input:** root = \[40,20,60,10,30,50,70\], val = 25
**Output:** \[40,20,60,10,30,50,70,null,null,25\]

**Example 3:**

**Input:** root = \[4,2,7,1,3,null,null,null,null,null,null\], val = 5
**Output:** \[4,2,7,1,3,5\]

**Constraints:**

*   The number of nodes in the tree will be in the range `[0, 104]`.
*   `-108 <= Node.val <= 108`
*   All the values `Node.val` are **unique**.
*   `-108 <= val <= 108`
*   It's **guaranteed** that `val` does not exist in the original BST.

**SOLUTION:**

    # Definition for a binary tree node.
    # class TreeNode:
    #     def __init__(self, val=0, left=None, right=None):
    #         self.val = val
    #         self.left = left
    #         self.right = right
    class Solution:
        def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
            if root:
                if val > root.val:
                    root.right = self.insertIntoBST(root.right, val)
                else:
                    root.left = self.insertIntoBST(root.left, val)
                return root
            else:
                return TreeNode(val=val)
Range Sum Query 2D - Immutable
Tags: leetcode, dsa, theabbie
Published: 2022-06-17 04:00:43

Given a 2D matrix `matrix`, handle multiple queries of the following type:

*   Calculate the **sum** of the elements of `matrix` inside the rectangle defined by its **upper left corner** `(row1, col1)` and **lower right corner** `(row2, col2)`.

Implement the `NumMatrix` class:

*   `NumMatrix(int[][] matrix)` Initializes the object with the integer matrix `matrix`.
*   `int sumRegion(int row1, int col1, int row2, int col2)` Returns the **sum** of the elements of `matrix` inside the rectangle defined by its **upper left corner** `(row1, col1)` and **lower right corner** `(row2, col2)`.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/03/14/sum-grid.jpg)

**Input**
\["NumMatrix", "sumRegion", "sumRegion", "sumRegion"\]
\[\[\[\[3, 0, 1, 4, 2\], \[5, 6, 3, 2, 1\], \[1, 2, 0, 1, 5\], \[4, 1, 0, 1, 7\], \[1, 0, 3, 0, 5\]\]\], \[2, 1, 4, 3\], \[1, 1, 2, 2\], \[1, 2, 2, 4\]\]
**Output**
\[null, 8, 11, 12\]

**Explanation**
NumMatrix numMatrix = new NumMatrix(\[\[3, 0, 1, 4, 2\], \[5, 6, 3, 2, 1\], \[1, 2, 0, 1, 5\], \[4, 1, 0, 1, 7\], \[1, 0, 3, 0, 5\]\]);
numMatrix.sumRegion(2, 1, 4, 3); // return 8 (i.e sum of the red rectangle)
numMatrix.sumRegion(1, 1, 2, 2); // return 11 (i.e sum of the green rectangle)
numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle)

**Constraints:**

*   `m == matrix.length`
*   `n == matrix[i].length`
*   `1 <= m, n <= 200`
*   `-104 <= matrix[i][j] <= 104`
*   `0 <= row1 <= row2 < m`
*   `0 <= col1 <= col2 < n`
*   At most `104` calls will be made to `sumRegion`.

**SOLUTION:**

    class NumMatrix:
    
        def __init__(self, matrix: List[List[int]]):
            m = len(matrix)
            n = len(matrix[0])
            self.matrix = matrix
            self.qsum = [[None for i in range(n)] for j in range(m)]
            
        def getSum(self, i, j):
            if i < 0 or j < 0:
                return 0
            if self.qsum[i][j] != None:
                return self.qsum[i][j]
            prev = self.getSum(i - 1, j - 1)
            row = self.getSum(i - 1, j)
            col = self.getSum(i, j - 1)
            res = row + col + self.matrix[i][j] - prev
            self.qsum[i][j] = res
            return res
    
        def sumRegion(self, row1: int, col1: int, row2: int, col2: int) -> int:
            c = self.getSum(row2, col2)
            l = self.getSum(row2, col1 - 1)
            t = self.getSum(row1 - 1, col2)
            s = self.getSum(row1 - 1, col1 - 1)
            return c - l - t + s
    
    
    # Your NumMatrix object will be instantiated and called as such:
    # obj = NumMatrix(matrix)
    # param_1 = obj.sumRegion(row1,col1,row2,col2)
Gitda odatiy (default) branch nomini o'zgartirish
Tags: git, branch
Published: 2022-06-17 03:07:11

Git 2.28 tanqinidan oldin, `git init` ishlatilganda standart branch nomi `master` hisoblanadi.

Odatiy (default) filial nomini o'zgartirish uchun quidagi buyruqdan foydalaning
```
git config --global init.defaultBranch [new default name]
```
---
Batafsil ma'lumotni [bu yer](https://github.blog/2020-07-27-highlights-from-git-2-28/#introducing-init-defaultbranch)da topishingiz mumkin.
---
Manba: https://dev.to/jgunawancode/change-git-default-branch-name-523l
Laravel 8 Mobile Number OTP Authentication using Firebase
Tags: laravel8, authentication, mobile, firebase
Published: 2022-06-17 03:34:56

In this article, we will see laravel 8 mobile number OTP authentication using firebase. There are many types of autentication to login to different sites and applications. So, here we will see mobile number otp authentication using firebase in laravel 8.

So, let's see mobile number OTP authentication using firebase in laravel 8, firebase OTP auth, firebase OTP verification in laravel 8, OTP authentication using firebase in laravel 8, firebase phone authentication in laravel 8

We can use firebase otp authentication to sign in a user by sending an otp message to the user's phone and after firebase otp verification user can login respective website or application.

So, let's start OTP authentication using firebase in laravel 8 step by step

```
Step 1 : Create Firebase Project for Laravel 8 Mobile Number OTP Authentication using Firebase

Step 2 : Install Laravel 8 

Step 3 : Create Route

Step 4 : Create Controller

Step 5 : Create Blade File
```

---

**_[Read More: Laravel 8 Mobile Number OTP Authentication using Firebase](https://techsolutionstuff.com/post/laravel-8-mobile-number-otp-authentication-using-firebase)_**
Min Max Game
Tags: leetcode, dsa, theabbie
Published: 2022-06-17 03:30:39

You are given a **0-indexed** integer array `nums` whose length is a power of `2`.

Apply the following algorithm on `nums`:

1.  Let `n` be the length of `nums`. If `n == 1`, **end** the process. Otherwise, **create** a new **0-indexed** integer array `newNums` of length `n / 2`.
2.  For every **even** index `i` where `0 <= i < n / 2`, **assign** the value of `newNums[i]` as `min(nums[2 * i], nums[2 * i + 1])`.
3.  For every **odd** index `i` where `0 <= i < n / 2`, **assign** the value of `newNums[i]` as `max(nums[2 * i], nums[2 * i + 1])`.
4.  **Replace** the array `nums` with `newNums`.
5.  **Repeat** the entire process starting from step 1.

Return _the last number that remains in_ `nums` _after applying the algorithm._

**Example 1:**

![](https://assets.leetcode.com/uploads/2022/04/13/example1drawio-1.png)

**Input:** nums = \[1,3,5,2,4,8,2,2\]
**Output:** 1
**Explanation:** The following arrays are the results of applying the algorithm repeatedly.
First: nums = \[1,5,4,2\]
Second: nums = \[1,4\]
Third: nums = \[1\]
1 is the last remaining number, so we return 1.

**Example 2:**

**Input:** nums = \[3\]
**Output:** 3
**Explanation:** 3 is already the last remaining number, so we return 3.

**Constraints:**

*   `1 <= nums.length <= 1024`
*   `1 <= nums[i] <= 109`
*   `nums.length` is a power of `2`.

**SOLUTION:**

    class Solution:
        def minMax(self, nums, i, j, minm):
            if j == i + 1:
                return nums[i]
            mid = (i + j) // 2
            a = self.minMax(nums, i, mid, True)
            b = self.minMax(nums, mid, j, False)
            if minm:
                return min(a, b)
            return max(a, b)
        
        def minMaxGame(self, nums: List[int]) -> int:
            n = len(nums)
            return self.minMax(nums, 0, n, True)
Git Bisect Steps by Step Process
Published: 2022-06-17 03:07:20

> Detail & Background : https://git-scm.com/docs/git-bisect

Step 1:

`$ git bisect` 

Step 2:

`$ git bisect start `

Step 3:

If the current master branch is not working correctly


`$ git bisect bad`

OR

Choose the bad branch

`$ git bisect bad [commit number ]`

Step 4:

Choose the correctly working branch

`$ git bisect good [commit number]`

Step 5:

Testing and Current working commit branch and choose

`$ git bisect good`

OR

`$ git bisect bad`
GIT - Versiyalarni boshqarish tizimidagi bazi bir ko'p foydalaniladigan buyruqlar majmui
Tags: git
Published: 2022-06-17 03:02:39


## Git dagi global sozlamalarni kiritish
```
git config --global user.name "YOUR NAME"
git config --global user.email "YOUR@MAIL.COM"
```
---
## Mavjud repo'ni olish va undagi o'zgarishlar repo'ga uzatish
```
git clone https://github.com/mrmuminov/repo.git
cd repo
touch README.md
git add README.md
git commit -m "add README"
git push -u origin master
```
---
## local yaratilgan proyektni gitdagi bo'sh repo'ga yuklash
```
cd existing_folder
git init
git remote add origin https://github.com/mrmuminov/repo.git
git add .
git commit -m "Initial commit"
git push -u origin master
```
---
## local yaratilgan proyektni gitdagi bo'sh bo'lmagan repo'ga yuklash
```
cd existing_repo
git remote rename origin old-origin
git remote add origin https://github.com/mrmuminov/repo.git
git push -u origin --all
git push -u origin --tags
```
---
Bahriddin Mo'minov ))
Cara menjalankan file PHP
Tags: webdev, php, beginners, programming
Published: 2022-06-17 03:00:47

## Pendahuluan
**PHP** atau **PHP Hypertext Preprocessor** merupakan bahasa pemrograman script open source yang dapat digunakan untuk pembuatan suatu website dalam sisi server.

## Persiapan

1. Pertama download dahulu XAMPP disini.
2. Lalu jalankan dan install seperti biasa.
3. Setelah itu buka dan jalankan apache
4. Lalu klik pada explorer pada aplikasi XAMPP atau bisa juga masuk ke folder instalasi XAMPP (Default C:\xampp\)
5. Lalu masuk ke dalam folder htdocs
6. Lalu buatlah folder dengan nama tes (atau bebas)
7. Lalu buka code editor dan arahkan ke dalam folder yang telah dibuat tadi.
8. Lalu buatlah file php dengan nama index.php
9. Lalu masukan kode berikut:
<?php echo "Menjalankan file php pertama berhasil!” ?>
10. Setelah itu buka browser dan isi url dengan localhost/tes (atau nama folder yang telah dibuat tadi)
11. Jika pada browser menampilkan "Menjalankan file php pertama berhasil!” maka file php berhasil dijalankan

## Rangkuman

File php harus berada di dalam folder htdocs (C:\xampp\htdocs) atau folder instalaasi xampp

File php bernama index.php akan dijalankan otomatis jika nama foldernya dipanggil pada url (misalnya localhost/tes maka akan menjalankan file index.php yang berada pada folder tes)

Jika ingin menjalankan file php lainnya, cukup tambahkan nama file setelah nama folder (misalnya localhost/tes/nama_file.php)