No video :(

166 - Ice Cream Parlor | Search | Hackerrank Solution | Python

Подписаться 24 тыс.

Просмотров 4,2 тыс.

50% 1

⭐️ Content Description ⭐️
In this video, I have explained on how to solve the problem ice cream parlor using simple logic in python. This hackerrank problem is a part of Problem Solving | Practice | Algorithms | Search | Ice Cream Parlor and solved in python. The complexity of this solution is O (n).
🔔 Subscribe: bit.ly/hackersr...
🗓️ 1:1 Consultation with Me: calendly.com/h...
📷 Instagram: / aswintechguy
🔣 Linkedin: / aswintechguy
🎯 GitHub: github.com/asw...
🎬 Share: • 166 - Ice Cream Parlor...
⚡️ Data Structures & Algorithms tutorial playlist: bit.ly/dsatutorial
😎 Hackerrank problem solving solutions playlist: bit.ly/hackerra...
🤖 ML projects tutorial playlist: bit.ly/mlprojec...
🐍 Python tutorial playlist: bit.ly/python3p...
💻 Machine learning concepts playlist: bit.ly/mlconcepts
✍🏼 NLP concepts playlist: bit.ly/nlpconcepts
🕸️ Web scraping tutorial playlist: bit.ly/webscrap...
Make a small donation to support the channel 🙏🙏🙏:-
🆙 UPI ID: hackersrealm@apl
💲 PayPal: paypal.me/hack...
#icecreamparlor #hackerranksolutions #hackersrealm #hackerrank #python #search #howtosolve #problemsolving #tutorial #algorithms #datastructures #programming #coding #codinginterview #education #aswin

Опубликовано:

22 авг 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 11

@kseniiaefremova4696 Год назад

Thank you! my solution is very similar to yours: def icecream_parlor(m, arr): for i in range(len(arr)): for j in range(i+1, len(arr)): if arr[i]+arr[j] == m: return i+1, j+1

@zhengxijiang4087 2 года назад

thank you for sharing. is there a binary search solution?

@HackersRealm 2 года назад

binary search works only in sorted array, here the array is not sorted

@abhilashsingh8053 2 года назад

This code is not optimize d

@HackersRealm 2 года назад

you can suggest some logic to the community, it would be helpful!!!

@abhilashsingh8053 2 года назад

@@HackersRealm use enumerator d ={} for (i,c) in enumerate(cost): if c in d: print(d[c],i+1) else: d[money-c] = i+1

@porassingh4904 3 года назад

How to solve this using hashtables?

@HackersRealm 3 года назад

we can't use hash tables, as the numbers are not unique

@bryanowsky 2 года назад

@@HackersRealm nice, I was trying to implement something using dicts in python but was to slow and we have the condition that the cost may be repeated... so this implementation give me a new panoram, thanks

@HackersRealm 2 года назад

@@bryanowsky Glad it was helpful!!!

@scottishfoldmocha5875 2 года назад

@@HackersRealm sure you can, you have to solve this particular task using hash table. Start by creating a second (smaller) array which contains only values smaller than "m", at the same time append hash map by using new array index as key and old array index as value. After that you loop through that small array.