






from __future__ import annotations

from collections.abc import Generator

import requests
from bsa import BeautifulSoup

_a      	=  '''https://www.indeed.co.in/jobs?q=mobile+app+development&l='''


def __A    (      __lowerCAmelCase = "mumbai"	)->  Generator[tuple[str, str], None, None]:





						"""simple docstring"""



						_UpperCAmelCase									=			BeautifulSoup(requests.get(url + location	).content ,		'html.parser'	)
						# This attribute finds out all the specifics listed in a job
						for job in soup.find_all('div' ,		attrs={'data-tn-component': 'organicJob'}	):
												_UpperCAmelCase									=			job.find('a' ,		attrs={'data-tn-element': 'jobTitle'}	).text.strip()
												_UpperCAmelCase									=			job.find('span' ,		{'class': 'company'}	).text.strip()
												yield job_title, company_name


if __name__ == "__main__":
		for i, job in enumerate(fetch_jobs('''Bangalore'''), 1):
				print(F'''Job {i:>2} is {job[0]} at {job[1]}''')








from __future__ import annotations

from itertools import permutations
from random import randint
from timeit import repeat


def __A    (      )->  tuple[list[int], int]:





						"""simple docstring"""



						_UpperCAmelCase									=			[randint(-1_000 ,		1_000	) for i in range(10	)]
						_UpperCAmelCase									=			randint(-5_000 ,		5_000	)
						return (arr, r)


_a      	=  make_dataset()


def __A    (      __lowerCAmelCase ,		__lowerCAmelCase	)->  tuple[int, ...]:





						"""simple docstring"""



						for triplet in permutations(__lowerCAmelCase ,		3	):
												if sum(__lowerCAmelCase	) == target:
																		return tuple(sorted(__lowerCAmelCase	)	)
						return (0, 0, 0)


def __A    (      __lowerCAmelCase ,		__lowerCAmelCase	)->  tuple[int, int, int]:





						"""simple docstring"""



						arr.sort()
						_UpperCAmelCase									=			len(__lowerCAmelCase	)
						for i in range(n - 1	):
												_UpperCAmelCase					, _UpperCAmelCase									=			i + 1, n - 1
												while left < right:
																		if arr[i] + arr[left] + arr[right] == target:
																								return (arr[i], arr[left], arr[right])
																		elif arr[i] + arr[left] + arr[right] < target:
																								left += 1
																		elif arr[i] + arr[left] + arr[right] > target:
																								right -= 1
						return (0, 0, 0)


def __A    (      )->  tuple[float, float]:





						"""simple docstring"""



						_UpperCAmelCase									=			'\nfrom __main__ import dataset, triplet_sum1, triplet_sum2\n'
						_UpperCAmelCase									=			'\ntriplet_sum1(*dataset)\n'
						_UpperCAmelCase									=			'\ntriplet_sum2(*dataset)\n'
						_UpperCAmelCase									=			repeat(setup=__lowerCAmelCase ,		stmt=__lowerCAmelCase ,		repeat=5 ,		number=10_000	)
						_UpperCAmelCase									=			repeat(setup=__lowerCAmelCase ,		stmt=__lowerCAmelCase ,		repeat=5 ,		number=10_000	)
						return (min(__lowerCAmelCase	), min(__lowerCAmelCase	))


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		_a      	=  solution_times()
		print(F'''The time for naive implementation is {times[0]}.''')
		print(F'''The time for optimized implementation is {times[1]}.''')
