teleren/devto huggingface dataset:
A Fun Programming Joke To Start Your Day
Tags: jokes, dailydeveloperjokes
Published: 2022-07-13 08:00:04

---
title: "A Fun Programming Joke To Start Your Day"
description: "Check out today's daily developer joke! (a project by Fred Adams at xtrp.io)"
series: "Daily Developer Jokes"
published: true
tags: #jokes, #dailydeveloperjokes
---

Hi there! Here's today's Daily Developer Joke. We hope you enjoy it; it's a good one.

![Joke Image](https://private.xtrp.io/projects/DailyDeveloperJokes/public_image_server/images/5e1258ab6087f.png)

---

For more jokes, and to submit your own joke to get featured, check out the [Daily Developer Jokes Website](https://dailydeveloperjokes.github.io/). We're also open sourced, so feel free to view [our GitHub Profile](https://github.com/dailydeveloperjokes).

### Leave this post a ❤️ if you liked today's joke, and stay tuned for tomorrow's joke too!

_This joke comes from [Dad-Jokes GitHub Repo by Wes Bos](https://github.com/wesbos/dad-jokes) (thank you!), whose owner has given me permission to use this joke with credit._

<!--
Joke text:
___Q:___ Where did the parallel function wash its hands?

___A:___ Async
 -->
1694. Leetcode Solution in Cpp
Tags: cpp
Published: 2022-07-13 07:59:33

```
class Solution {
public:
    string reformatNumber(string number) {
        string tmp, res;
        for (char c : number) {
            if (isdigit(c)) tmp.push_back(c);
        }
        for (int i = 0; i < tmp.size();) {
            if (tmp.size() - i > 4) {
                res += tmp.substr(i, 3);
                res.push_back('-');
                i += 3;
            } else if (tmp.size() - i == 4) {
                res += tmp.substr(i, 2);
                res.push_back('-');
                i += 2;
                res += tmp.substr(i, 2);
                break;
            } else {
                res += tmp.substr(i);
                break;
            }
        }
        return res;
    }
};
```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/reformat-phone-number/
Go Course: Modules
Tags: go, tutorial, beginners
Published: 2022-07-13 07:57:06


In this tutorial, we will learn about modules.

## What are modules?

Simply defined, A module is a collection of [Go packages](https://go.dev/ref/spec#Packages) stored in a file tree with a `go.mod` file at its root, provided the directory is _outside_ `$GOPATH/src`.

Go modules were introduced in Go 1.11, which brings native support for versions and modules. Earlier, we needed the `GO111MODULE=on` flag to turn on the modules functionality when it was experimental. But now after Go 1.13 modules mode is the default for all development.

But wait what is `GOPATH`?

Well, `GOPATH` is a variable that defines the root of your workspace and it contains the following folders:

- **src**: contains Go source code organized in a hierarchy.
- **pkg**: contains compiled package code.
- **bin**: contains compiled binaries and executables.

![gopath](https://raw.githubusercontent.com/karanpratapsingh/portfolio/master/public/static/courses/go/chapter-I/modules/gopath.png)

Like earlier, let's create a new module using `go mod init` command which creates a new module and initializes the `go.mod` file that describes it.

```bash
$ go mod init example
```

_The important thing to note here is that a Go module can correspond to a Github repository as well if you plan to publish this module. For example:_

```bash
$ go mod init example
```

Now, let's explore `go.mod` which is the file that defines the module's _module path_ and also the import path used for the root directory, and its _dependency requirements_.

```go
module <name>

go <version>

require (
	...
)
```

And if we want to add a new dependency, we will use `go install` command:

```bash
$ go install github.com/rs/zerolog
```

As we can see a `go.sum` file was also created. This file contains the expected [hashes](https://go.dev/cmd/go/#hdr-Module_downloading_and_verification) of the content of the new modules.

We can list all the dependencies using `go list` command as follows:

```bash
$ go list -m all
```

If the dependency is not used, we can simply remove it using `go mod tidy` command:

```bash
$ go mod tidy
```

Finishing up our discussion on modules, let's also discuss vendoring.

Vendoring is the act of making your own copy of the 3rd party packages your project is using. Those copies are traditionally placed inside each project and then saved in the project repository.

This can be done through `go mod vendor` command.

So let's reinstall the removed module using `go mod tidy`.

```go
package main

import "github.com/rs/zerolog/log"

func main() {
	log.Info().Msg("Hello")
}
```

```bash
$ go mod tidy
go: finding module for package github.com/rs/zerolog/log
go: found github.com/rs/zerolog/log in github.com/rs/zerolog v1.26.1
```

```bash
$ go mod vendor
```

```
├── go.mod
├── go.sum
├── go.work
├── main.go
└── vendor
    ├── github.com
    │   └── rs
    │       └── zerolog
    │           └── ...
    └── modules.txt
```

---

_This article is part of my open source [Go Course](https://www.karanpratapsingh.com/courses/go) available on Github._

{% github karanpratapsingh/go-course %}
1744. Leetcode Solution in CPP
Tags: cpp
Published: 2022-07-13 07:55:08

```
class Solution {
 public:
  vector<bool> canEat(vector<int>& candiesCount, vector<vector<int>>& queries) {
    const int n = candiesCount.size();
    vector<bool> ans;
    vector<long> prefix(n + 1);

    for (int i = 0; i < n; ++i)
      prefix[i + 1] = prefix[i] + candiesCount[i];

    for (const auto& q : queries) {
      const int type = q[0];
      const int day = q[1];
      const int cap = q[2];
      // min/max day required to eat
      const long minDay = prefix[type] / cap;
      const long maxDay = prefix[type + 1] - 1;
      ans.push_back(minDay <= day && day <= maxDay);
    }

    return ans;
  }
};

```
#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/
Solving Real Time Queries Using Java 8 Features -Employee Management System
Tags: java, java8, programming, coding
Published: 2022-07-13 07:53:20

1) How many male and female employees are there in the organization?
2) Print the name of all departments in the organization?
3) What is the average age of male and female employees?
4) Get the details of highest paid employee in the organization?
5) Get the names of all employees who have joined after 2015?
6) Count the number of employees in each department?
7) What is the average salary of each department?
8) Get the details of youngest male employee in the product development department?
9) Who has the most working experience in the organization?
10) How many male and female employees are there in the sales and marketing team?
11) What is the average salary of male and female employees?
12) List down the names of all employees in each department?
13) What is the average salary and total salary of the whole organization?
14) Separate the employees who are younger or equal to 25 years from those employees who are older than 25 years?
15) Who is the oldest employee in the organization? What is his age and which department he belongs to?

See the Java 8 code at https://javaconceptoftheday.com/solving-real-time-queries-using-java-8-features-employee-management-system/
I made a news feed dashboard like Instagram for React! Check it out!
Tags: webdev, showdev, react, javascript
Published: 2022-07-13 07:53:18

Hello guys, I made a news feed dashboard design like Instagram using React! 😍

Live preview: https://horizon-ui.com/chakra-pro/#/admin/main/profile/newsfeed

Website presentation: https://horizon-ui.com/pro/
1748. Leetcode Soluiton in Javascript
Tags: javascript
Published: 2022-07-13 07:47:21

```
var sumOfUnique = function (nums) {
	let hash = new Map();
	let total = 0;

	for (var i = 0; i < nums.length; i++) {
		if (hash[nums[i]]) hash[nums[i]]++;
		else hash[nums[i]] = 1;
	}

	for (const [key, value] of Object.entries(hash)) {
		if (value == 1) {
			total += Number(key);
		}
	}
	return total;
};
```
#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/sum-of-unique-elements/
1726. Leetcode Solution in Java
Tags: java
Published: 2022-07-13 07:39:43

```
class Solution {
    public int tupleSameProduct(int[] nums) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        int length = nums.length;
        for (int i = 0; i < length; i++) {
            int num1 = nums[i];
            for (int j = i + 1; j < length; j++) {
                int num2 = nums[j];
                int product = num1 * num2;
                int count = map.getOrDefault(product, 0) + 1;
                map.put(product, count);
            }
        }
        int tuples = 0;
        Set<Integer> keySet = map.keySet();
        for (int product : keySet) {
            int count = map.get(product);
            tuples += count * (count - 1) * 4;
        }
        return tuples;
    }
}
```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/tuple-with-same-product/
1711. Leetcode Solution in Java
Tags: java
Published: 2022-07-13 07:34:18

```
class Solution {
    public int countPairs(int[] deliciousness) {
        final int MODULO = 1000000007;
        Map<Integer, Long> map = new HashMap<Integer, Long>();
        int max = 0;
        for (int num : deliciousness) {
            long count = map.getOrDefault(num, 0L) + 1;
            map.put(num, count);
            max = Math.max(max, num);
        }
        long pairs = 0;
        Set<Integer> keySet = map.keySet();
        for (int num : keySet) {
            long count = map.get(num);
            if (num > 0 && (num & (num - 1)) == 0)
                pairs = (pairs + count * (count - 1) / 2) % MODULO;
            int power2 = 1;
            while (power2 <= num * 2)
                power2 <<= 1;
            int upper = num + max;
            while (power2 <= upper) {
                int complement = power2 - num;
                if (map.containsKey(complement)) {
                    long complementCount = map.get(complement);
                    pairs = (pairs + count * complementCount) % MODULO;
                }
                power2 <<= 1;
            }
        }
        return (int) pairs;
    }
}
```
#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/count-good-meals/
1705. Leetcode Solution in Cpp
Tags: cpp
Published: 2022-07-13 07:31:42

```
class Solution {
public:
    int eatenApples(vector<int>& A, vector<int>& D) {
        int N = A.size(), ans = 0;
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq; // end time, cnt
        for (int i = 0; i < N || pq.size(); ++i) {
            while (pq.size()) {
                auto [end, cnt] = pq.top(); // remove rotten apples
                if (end <= i) pq.pop();
                else break;
            }
            if (i < N && A[i] != 0) pq.emplace(i + D[i], A[i]);
            if (pq.size()) { // greedily use the one with the smallest end time
                auto [end, cnt] = pq.top();
                pq.pop();
                ++ans;
                if (cnt - 1 > 0) pq.emplace(end, cnt - 1);
            }
        }
        return ans;
    }
};
```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/maximum-number-of-eaten-apples/
1780. Leetcode Solution in Cpp
Tags: cpp
Published: 2022-07-13 07:30:29

```
class Solution {
 public:
  bool checkPowersOfThree(int n) {
    while (n > 1) {
      const int r = n % 3;
      if (r == 2)
        return false;
      n /= 3;
    }

    return true;
  }
};

```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/
1775. Leetcode Solution in CPP
Tags: cpp
Published: 2022-07-13 07:28:48

```
class Solution {
 public:
  int minOperations(vector<int>& nums1, vector<int>& nums2) {
    if (nums1.size() * 6 < nums2.size() || nums2.size() * 6 < nums1.size())
      return -1;

    int sum1 = accumulate(begin(nums1), end(nums1), 0);
    int sum2 = accumulate(begin(nums2), end(nums2), 0);
    if (sum1 > sum2)
      return minOperations(nums2, nums1);

    int ans = 0;
    // increases in nums1 & decreases in nums2
    vector<int> count(6);

    for (const int num : nums1)
      ++count[6 - num];

    for (const int num : nums2)
      ++count[num - 1];

    for (int i = 5; sum2 > sum1;) {
      while (count[i] == 0)
        --i;
      sum1 += i;
      --count[i];
      ++ans;
    }

    return ans;
  }
};

```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/
Resolving problem when using Trix rich editor with tailwind
Tags: tailwindcss, trix
Published: 2022-07-13 07:21:31

it takes so loong for me to realize that tailwind reset is overriding the trix style because trix using a html tag like heading or list, and those tag style has been reset with tailwind.


Btw what i do is make my own style to give back the default style especially for heading and list tag.

so in my index.css, i added this

```
/* Tailwind Override */
.trix-editor {
	width: 100%;
}

.trix-editor h1 {
	font-size: 1.25rem !important;
	line-height: 1.25rem !important;
	margin-bottom: 1rem;
	font-weight: 600;
}

.trix-editor a:not(.no-underline) {
	text-decoration: underline;
}

.trix-editor a:visited {
	color: green;
}

.trix-editor ul {
	list-style-type: disc;
	padding-left: 1rem;
}

.trix-editor ol {
	list-style-type: decimal;
	padding-left: 1rem;
}

.trix-editor pre {
	display: inline-block;
	width: 100%;
	vertical-align: top;
	font-family: monospace;
	font-size: 1.5em;
	padding: 0.5em;
	white-space: pre;
	background-color: #eee;
	overflow-x: auto;
}

.trix-editor blockquote {
	border: 0 solid #ccc;
	border-left-width: 0px;
	border-left-width: 0.3em;
	margin-left: 0.3em;
	padding-left: 0.6em;
}
```

and add `trix-editor` class to `trix-editor` tag

`<trix-editor input="x" class="trix-editor"></trix-editor>`


and many thanks for this github [issue](https://github.com/tailwindlabs/tailwindcss/issues/989)


[Trix Editor](trix-editor.org/)


thanks for reading
1893. Leetcode Solution in Cpp
Tags: cpp
Published: 2022-07-13 07:13:41

```
class Solution {
 public:
  bool isCovered(vector<vector<int>>& ranges, int left, int right) {
    for (int i = left; i <= right; ++i) {
      bool seen = false;
      for (const auto& range : ranges)
        if (i >= range[0] && i <= range[1]) {
          seen = true;
          break;
        }
      if (!seen)
        return false;
    }

    return true;
  }
};

```
#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/
1878. Leetcode Solution in Java
Tags: java
Published: 2022-07-13 07:12:14

```
class Solution {
    public int[] getBiggestThree(int[][] grid) {
        int rows = grid.length, columns = grid[0].length;
        int maxSide = (Math.min(rows, columns) + 1) / 2;
        TreeSet<Integer> set = new TreeSet<Integer>();
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                set.add(grid[i][j]);
                if (set.size() > 3)
                    set.remove(set.first());
            }
        }
        for (int side = 2; side <= maxSide; side++) {
            int rowStart = 0, rowEnd = rows - (side * 2 - 1);
            int columnStart = side - 1, columnEnd = columns - side;
            for (int i = rowStart; i <= rowEnd; i++) {
                for (int j = columnStart; j <= columnEnd; j++) {
                    int sum = getSum(grid, i, j, side);
                    set.add(sum);
                    if (set.size() > 3)
                        set.remove(set.first());
                }
            }
        }
        List<Integer> list = new ArrayList<Integer>(set);
        Collections.reverse(list);
        int size = list.size();
        int[] biggest = new int[size];
        for (int i = 0; i < size; i++)
            biggest[i] = list.get(i);
        return biggest;
    }

    public int getSum(int[][] grid, int topRow, int topColumn, int side) {
        int bottomRow = topRow + (side - 1) * 2;
        int sum = grid[topRow][topColumn] + grid[bottomRow][topColumn];
        for (int i = 1; i < side; i++)
            sum += grid[topRow + i][topColumn - i] + grid[topRow + i][topColumn + i];
        for (int i = 1; i < side - 1; i++)
            sum += grid[bottomRow - i][topColumn - i] + grid[bottomRow - i][topColumn + i];
        return sum;
    }
}
```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid/
1849. Leetcode Solution in CPP
Tags: cpp
Published: 2022-07-13 07:11:03

```
class Solution {
 public:
  bool splitString(string s) {
    return isValid(s, 0, -1, 0);
  }

 private:
  bool isValid(const string& s, int start, long prev, int segment) {
    if (start == s.length() && segment > 1)
      return true;

    long curr = 0;
    for (int i = start; i < s.length(); ++i) {
      curr = curr * 10 + s[i] - '0';
      if (curr > 9999999999L)
        return false;
      if ((prev == -1 || curr == prev - 1) &&
          isValid(s, i + 1, curr, segment + 1)) {
        return true;
      }
    }

    return false;
  }
};

```


#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/
1801. Leetcode Solution in CPP
Tags: cpp
Published: 2022-07-13 07:10:00

```
class Solution {
 public:
  int getNumberOfBacklogOrders(vector<vector<int>>& orders) {
    constexpr int kMod = 1e9 + 7;
    int ans = 0;
    priority_queue<vector<int>> buysMaxHeap;
    priority_queue<vector<int>, vector<vector<int>>, greater<>> sellsMinHeap;

    for (const auto& order : orders) {
      if (order[2] == 0)
        buysMaxHeap.push(order);
      else
        sellsMinHeap.push(order);
      while (!buysMaxHeap.empty() && !sellsMinHeap.empty() &&
             buysMaxHeap.top()[0] >= sellsMinHeap.top()[0]) {
        const int minAmount = min(buysMaxHeap.top()[1], sellsMinHeap.top()[1]);
        vector<int> buysMaxHeapTop = buysMaxHeap.top();
        buysMaxHeap.pop();
        buysMaxHeapTop[1] -= minAmount;
        if (buysMaxHeapTop[1] > 0)
          buysMaxHeap.push(buysMaxHeapTop);

        vector<int> sellsMinHeapTop = sellsMinHeap.top();
        sellsMinHeap.pop();
        sellsMinHeapTop[1] -= minAmount;
        if (sellsMinHeapTop[1] > 0)
          sellsMinHeap.push(sellsMinHeapTop);
      }
    }

    while (!buysMaxHeap.empty()) {
      ans += buysMaxHeap.top()[1], buysMaxHeap.pop();
      ans %= kMod;
    }

    while (!sellsMinHeap.empty()) {
      ans += sellsMinHeap.top()[1], sellsMinHeap.pop();
      ans %= kMod;
    }

    return ans;
  }
};

```

#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/number-of-orders-in-the-backlog/
The listener function is not registered in the functional components
Tags: addeventlistener, react, javascript, reacthooks
Published: 2022-07-13 07:08:54

#react

Using Functional Component, I am trying to find the scroll position of an element, but the listener function isn't registering as scrolling occurs. Can anyone explain why this is happening.

Here is the code for reference

```
export default function App() {
  const [scrollPosition, setScrollPOsition] = useState(0);
  const innerRef = useRef<HTMLParagraphElement>(null);

  const handleScroll = () => {
    console.log("handle scroll");
    // setScrollPOsition((scrollPosition) => scrollPosition + 1);
  };

  useEffect(() => {
    if (innerRef.current) {
      innerRef.current.addEventListener("scroll", handleScroll);
      return () => innerRef.current?.addEventListener("scroll", handleScroll);
    }
  }, []);

  return (
    <div className="App">
      <span className={"scrollValue"}>
        scroll position of first header: {scrollPosition}
      </span>
      <h1 ref={innerRef}>Find My position on window</h1>
      <h2>Heading Element</h2>
      ...
      ...
      <h2>Heading Element</h2>
    </div>
  );
}
```
Here is the code sandbox [link](https://codesandbox.io/s/finding-the-scroll-position-of-an-element-osk650?file=/src/App.tsx:2705-2722)
Creating a Nav bar in Reactjs
Tags: javascript, react, webdev, softwaredevelopment
Published: 2022-07-13 07:08:22

𝗧𝗵𝗲 𝘀𝗶𝗺𝗽𝗹𝗲𝘀𝘁 𝘄𝗮𝘆 𝘁𝗼 𝗰𝗿𝗲𝗮𝘁𝗲 𝗡𝗮𝘃𝗯𝗮𝗿 𝗶𝗻 𝗥𝗲𝗮𝗰𝘁𝗝𝘀 𝗶𝘀 𝘂𝘀𝗶𝗻𝗴 𝘁𝗵𝗲 𝗺𝗮𝗽 ( ) 𝗺𝗲𝘁𝗵𝗼𝗱
✔️ 𝘔𝘢𝘱 () 𝘮𝘦𝘵𝘩𝘰𝘥 𝘶𝘴𝘦𝘥 𝘵𝘰 𝘳𝘦𝘯𝘥𝘦𝘳 𝘢𝘯 𝘢𝘳𝘳𝘢𝘺 𝘰𝘧 𝘥𝘢𝘵𝘢 𝘪𝘯 𝘑𝘚𝘟

✔️ 𝘛𝘩𝘦 𝘮𝘢𝘱() 𝘮𝘦𝘵𝘩𝘰𝘥 𝘤𝘳𝘦𝘢𝘵𝘦𝘴 𝘢 𝘯𝘦𝘸 𝘢𝘳𝘳𝘢𝘺 𝘱𝘰𝘱𝘶𝘭𝘢𝘵𝘦𝘥 𝘸𝘪𝘵𝘩 𝘵𝘩𝘦 𝘳𝘦𝘴𝘶𝘭𝘵𝘴 𝘰𝘧 𝘤𝘢𝘭𝘭𝘪𝘯𝘨 𝘢 𝘱𝘳𝘰𝘷𝘪𝘥𝘦𝘥 𝘧𝘶𝘯𝘤𝘵𝘪𝘰𝘯 𝘰𝘯 𝘦𝘷𝘦𝘳𝘺 𝘦𝘭𝘦𝘮𝘦𝘯𝘵 𝘪𝘯 𝘵𝘩𝘦 𝘤𝘢𝘭𝘭𝘪𝘯𝘨 𝘢𝘳𝘳𝘢𝘺
```
<nav>
   <ul>
       {
        ['Home', 'About', 'Contact Us'].map((item, index)=>(
            <li key={index}>
                  {item}
                 </li>
      ))
   }
    
     </ul>

</nav>
```
1807. Leetcode Solution in CPP
Tags: cpp
Published: 2022-07-13 07:08:14

```
class Solution {
 public:
  string evaluate(string s, vector<vector<string>>& knowledge) {
    string ans;
    unordered_map<string, string> map;

    for (const auto& list : knowledge)
      map["(" + list[0] + ")"] = list[1];

    for (int i = 0; i < s.length(); ++i) {
      const char c = s[i];
      if (c == '(') {
        const int j = s.find_first_of(')', i);
        const string& key = s.substr(i, j - i + 1);
        ans += map.count(key) ? map[key] : "?";
        i = j;
      } else {
        ans += c;
      }
    }

    return ans;
  }
};

```


#Leetcode
#challende
Here is the link for the problem:
https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/
Experience in job interviews
Tags: webdev, beginners, discuss, career
Published: 2022-07-13 07:06:46

## Introduction 
In [previous post](https://dev.to/ahmed_onour/what-advice-would-you-have-given-yourself-before-a-job-interview-5do3), I asked DEV community about what advice would you have given yourself before a job interview, And I found amazing advises that i want share with you.

## 1. [Nathan Hedglin](https://dev.to/natescode) Said:

> I've been on both sides of the table plenty of times. Every interview is different.

#### Prepare 3 stories.

1. Interpersonal conflict that was fixed
2. A project you're personally proud of
3. An especially hard bug or optimisation you implemented

Answer technical questions with a sentence then paragraph to explain further. Ask clarifying questions, that shows you know what you're talking about.

Have questions for the interviewer(s) ready. Remember, you're interviewing them too. Don't let them act superior.

Of course have the soft skill answers ready too

- What is your biggest strength and weakness?
- Why do you want to work here ?
- Do you think you're a cultural fit?

Breathe. Interviews are tough. Good luck!.

##### conclusion :
You need to prepare your self, by practising, let us see what the next advice about.
## 2. Brandon Charest

There is already some great advice here. I would just like to add that personally I have found that the interviewer is looking for the questions to be answered in the STAR format

The STAR format stands for Situation, Task, Action, Result:
Situation: An event, project, or challenge faced
Task: Your responsibilities and assignments for the situation
Action: Steps or procedure taken to relieve or rectify situation
Result: Results of actions taken.

And using this format try to have some answers to commonly asked questions. I try to have a few different answers ready, just incase I am asked a common question I do not have to repeat a previous answer (don't know if that really matters) and I don't have to struggle thinking of a second one.

## 3. [Peter Vivo](https://dev.to/pengeszikra) said:

> Don't afraid if first interview fail.
 
#### My tactic is do 10+ interview simultaneous. 
- gather experience on first 5 interview. 
- Personal git-repo which is contain some useful is also really handy. 
- CV does not longer than one page, short and clear ( in my -- case it is hard because I have 30+ years working experience).

# conclusion
It's very useful advises, and i hope these tips help you, thank you for every advice, and if you have advice, please tell us in the comments.

@natescode 
@pengeszikra