Test Engineering Notes
Україномовний канал про технічні аспекти тестування, розподілені системи, блокчейн та кібербезпеку.
Mostrar más- Suscriptores
- Cobertura postal
- ER - ratio de compromiso
Carga de datos en curso...
Carga de datos en curso...
Curated list of project-based tutorials. Contribute to practical-tutorials/project-based-learning development by creating an account on GitHub.
Everybody hates it when they go to an interview and they are given live coding challenge that is written intentionally to make you fail, so the interviewer can prove his "superiority". Here are 12 playwright interview questions and answers, so you can have the advantage this time.
Ever heard of SQLAlchemy and thought it sounded like a medieval potion? Well, it's not! 🧙♂️🔮 SQLAlchemy combines the robustness of SQL with Python's flexibility, making database management not just easier, but kinda fun too! In this video, I’ll take a closer look at this awesome tool. Try out Oso for free here:
https://oso.1stcollab.com/arjancodes_3🔥 GitHub Repository:
https://git.arjan.codes/2024/sqlalchemy💻 ArjanCodes Blog:
https://www.arjancodes.com/blog✍🏻 Take a quiz on this topic:
https://www.learntail.com/quiz/zewcrdTry Learntail for FREE ➡️
https://www.learntail.com/🎓 Courses: The Software Designer Mindset:
https://www.arjancodes.com/mindsetThe Software Architect Mindset: Pre-register now!
https://www.arjancodes.com/architectNext Level Python: Become a Python Expert:
https://www.arjancodes.com/next-level-pythonThe 30-Day Design Challenge:
https://www.arjancodes.com/30ddc🛒 GEAR & RECOMMENDED BOOKS:
https://kit.co/arjancodes.👍 If you enjoyed this content, give this video a like. If you want to watch more of my upcoming videos, consider subscribing to my channel! Social channels: 💬 Discord:
https://discord.arjan.codes🐦Twitter:
https://twitter.com/arjancodes🌍LinkedIn:
https://www.linkedin.com/company/arjancodes🕵Facebook:
https://www.facebook.com/arjancodes📱Instagram:
https://www.instagram.com/arjancodes♪ Tiktok:
https://www.tiktok.com/@arjancodes👀 Code reviewers: - Yoriz - Ryan Laursen - Dale Hagglund - Kit Hygh - Alexander Milden - Bean 🎥 Video edited by Mark Bacskai:
https://www.instagram.com/bacskaimark🔖 Chapters: 0:00 Intro 1:30 Functional Approach 5:04 Object-Oriented Approach 8:35 Relationships 10:26 Oso 12:18 Relationships part 2 16:02 Outro #arjancodes #softwaredesign #python DISCLAIMER - The links in this description might be affiliate links. If you purchase a product or service through one of those links, I may receive a small commission. There is no additional charge to you. Thanks for supporting my channel so I can continue to provide you with free content each week!
Pytest plugin to generate test report in Common Test Report Format (JSON) - infopulse/pytest-common-test-report-json
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
, що описується формулою:
F(n) = F(n-1) + F(n-2)
, де F(0) = 0
та F(1) = 1
.
Виявляється, одну й ту саму задачу можна вирішити по-різному. Кожне рішення покаже ваш рівень розуміння задачі, мови програмування та тестування негативних кейсів.
Перед тим, як дивитись приклади - пропоную самим спробувати написати код.
1. Простий та наївний підхід - обчислюємо так, як написано у формулі (з рекурсією):
def fib(n: int) -> int:
return fib(n-1) + fib(n-2)
Але тут можна легко отримати RecursionError: maximum recursion depth exceeded
2. Покращуємо код, додаючі перевірку базових кейсів:
def fib(n: int) -> int:
if n < 2:
return n
return fib(n-1) + fib(n-2)
3. Можна також застосувати техніку мемоїзації (тобто замість обчислень знову й знову - запам'ятовуємо проміжні результати):
from typing import Dict
memo: Dict[int, int] = {0: 0, 1: 1}
def fib(n: int) -> int:
if n not in memo:
memo[n] = fib(n - 1) + fib(n - 2)
return memo[n]
4. Мемоїзація також є "вбудована" в сам Python:
from functools import lru_cache
@lru_cache(maxsize=None)
def fib(n: int) -> int:
if n < 2:
return n
return fib(n - 1) + fib(n - 2)
5. Замість рекурсії - можна вирішити задачу з циклом:
def fib(n: int) -> int:
if n == 0:
return n
last: int = 0
next: int = 1
for _ in range(1, n):
last, next = next, last + next
return next
P.S. Можна ще обчислити за допомогою генераторів, але цей спосіб розберемо в наступних нотатках.Послідо́вність Фібона́ччі, чи́сла Фібона́ччі — у математиці числова послідовність задана рекурентним співвідношенням другого порядку
Hi, my name is Oleksandr Romanov. I am working on the research study on relationship between software quality metrics and project delivery. As a part of my research I want to gather information among the practitioners - in a form a survey. I kindly ask that you participate in this survey. It should take you no longer than 10 minutes to complete. Please rest assured all responses will be kept confidential and combined with responses from other participants in summary form, ensuring that your individual responses will not be identifiable. The completion of the survey will indicate your consent to participate. Finally, please know you can skip any question(s) on the survey that cause you concern. Likewise, you may discontinue participation at any point during the survey. Thank you in advance for your time and participation in the study. I sincerely appreciate your willingness to support this work. Do not hesitate to let me know if you have any questions or concerns regarding the survey or if you would like…
This article was adapted from a Google Testing on the Toilet (TotT) episode. You can download a printer-friendly version of this TotT e...
Applicable to both technical and managerial tracks