Skip to content

Commit e97c870

Browse files
ChandrashekharRobbiChandrashekharRobbi
committed
Adjusted code in shipWithinDays function 😎
1 parent b66088c commit e97c870

File tree

1 file changed

+22
-20
lines changed

1 file changed

+22
-20
lines changed

‎Most IMP Questions/Practice/Binary Search.ipynb‎

Lines changed: 22 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -11,6 +11,21 @@
1111
"<div class=\"toc\"><ul class=\"toc-item\"><li><span><a href=\"#Binary-Search-to-find-x-Element-in-Sorted-Array\" data-toc-modified-id=\"Binary-Search-to-find-x-Element-in-Sorted-Array-1\"><span class=\"toc-item-num\">1&nbsp;&nbsp;</span>Binary Search to find <code>x</code> Element in Sorted Array</a></span></li><li><span><a href=\"#Lower-Bound\" data-toc-modified-id=\"Lower-Bound-2\"><span class=\"toc-item-num\">2&nbsp;&nbsp;</span>Lower Bound</a></span></li><li><span><a href=\"#Upper-Bound\" data-toc-modified-id=\"Upper-Bound-3\"><span class=\"toc-item-num\">3&nbsp;&nbsp;</span>Upper Bound</a></span></li><li><span><a href=\"#Search-Insert-Position\" data-toc-modified-id=\"Search-Insert-Position-4\"><span class=\"toc-item-num\">4&nbsp;&nbsp;</span>Search Insert Position</a></span></li><li><span><a href=\"#Floor-and-Ceil-Value\" data-toc-modified-id=\"Floor-and-Ceil-Value-5\"><span class=\"toc-item-num\">5&nbsp;&nbsp;</span>Floor and Ceil Value</a></span></li><li><span><a href=\"#First-and-Last-Position-of-an-Element-In-Sorted-Array\" data-toc-modified-id=\"First-and-Last-Position-of-an-Element-In-Sorted-Array-6\"><span class=\"toc-item-num\">6&nbsp;&nbsp;</span>First and Last Position of an Element In Sorted Array</a></span></li><li><span><a href=\"#Number-of-Occurences\" data-toc-modified-id=\"Number-of-Occurences-7\"><span class=\"toc-item-num\">7&nbsp;&nbsp;</span>Number of Occurences</a></span></li><li><span><a href=\"#Search-In-Rotated-Sorted-Array\" data-toc-modified-id=\"Search-In-Rotated-Sorted-Array-8\"><span class=\"toc-item-num\">8&nbsp;&nbsp;</span>Search In Rotated Sorted Array</a></span></li><li><span><a href=\"#Search-in-Rotated-Sorted-Array-II\" data-toc-modified-id=\"Search-in-Rotated-Sorted-Array-II-9\"><span class=\"toc-item-num\">9&nbsp;&nbsp;</span>Search in Rotated Sorted Array II</a></span></li><li><span><a href=\"#Find-Minimum-in-Rotated-Sorted-Array\" data-toc-modified-id=\"Find-Minimum-in-Rotated-Sorted-Array-10\"><span class=\"toc-item-num\">10&nbsp;&nbsp;</span>Find Minimum in Rotated Sorted Array</a></span><ul class=\"toc-item\"><li><span><a href=\"#For-Unique-Values\" data-toc-modified-id=\"For-Unique-Values-10.1\"><span class=\"toc-item-num\">10.1&nbsp;&nbsp;</span>For Unique Values</a></span></li><li><span><a href=\"#For-Duplicate-Values\" data-toc-modified-id=\"For-Duplicate-Values-10.2\"><span class=\"toc-item-num\">10.2&nbsp;&nbsp;</span>For Duplicate Values</a></span></li></ul></li><li><span><a href=\"#Find-out-how-many-times-has-an-array-been-rotated\" data-toc-modified-id=\"Find-out-how-many-times-has-an-array-been-rotated-11\"><span class=\"toc-item-num\">11&nbsp;&nbsp;</span>Find out how many times has an array been rotated</a></span></li><li><span><a href=\"#Single-element-in-a-Sorted-Array\" data-toc-modified-id=\"Single-element-in-a-Sorted-Array-12\"><span class=\"toc-item-num\">12&nbsp;&nbsp;</span>Single element in a Sorted Array</a></span><ul class=\"toc-item\"><li><span><a href=\"#Coding-Ninja\" data-toc-modified-id=\"Coding-Ninja-12.1\"><span class=\"toc-item-num\">12.1&nbsp;&nbsp;</span>Coding Ninja</a></span></li><li><span><a href=\"#LeetCode-(Same-Solution)\" data-toc-modified-id=\"LeetCode-(Same-Solution)-12.2\"><span class=\"toc-item-num\">12.2&nbsp;&nbsp;</span>LeetCode (Same Solution)</a></span></li></ul></li><li><span><a href=\"#Find-peak-element\" data-toc-modified-id=\"Find-peak-element-13\"><span class=\"toc-item-num\">13&nbsp;&nbsp;</span>Find peak element</a></span></li><li><span><a href=\"#Square-Root-Of-a-Number\" data-toc-modified-id=\"Square-Root-Of-a-Number-14\"><span class=\"toc-item-num\">14&nbsp;&nbsp;</span>Square Root Of a Number</a></span></li><li><span><a href=\"#Find-Nth-Root-Of-M\" data-toc-modified-id=\"Find-Nth-Root-Of-M-15\"><span class=\"toc-item-num\">15&nbsp;&nbsp;</span>Find Nth Root Of M</a></span><ul class=\"toc-item\"><li><span><a href=\"#Naive-Approach\" data-toc-modified-id=\"Naive-Approach-15.1\"><span class=\"toc-item-num\">15.1&nbsp;&nbsp;</span>Naive Approach</a></span></li><li><span><a href=\"#Efficient-Appraoch\" data-toc-modified-id=\"Efficient-Appraoch-15.2\"><span class=\"toc-item-num\">15.2&nbsp;&nbsp;</span>Efficient Appraoch</a></span></li></ul></li><li><span><a href=\"#Koko-Eating-Bananas\" data-toc-modified-id=\"Koko-Eating-Bananas-16\"><span class=\"toc-item-num\">16&nbsp;&nbsp;</span>Koko Eating Bananas</a></span><ul class=\"toc-item\"><li><span><a href=\"#Naive-Approach\" data-toc-modified-id=\"Naive-Approach-16.1\"><span class=\"toc-item-num\">16.1&nbsp;&nbsp;</span>Naive Approach</a></span></li><li><span><a href=\"#Efficient-Approach\" data-toc-modified-id=\"Efficient-Approach-16.2\"><span class=\"toc-item-num\">16.2&nbsp;&nbsp;</span>Efficient Approach</a></span></li></ul></li><li><span><a href=\"#Minimum-Number-of-Days-to-Make-m-Bouquets\" data-toc-modified-id=\"Minimum-Number-of-Days-to-Make-m-Bouquets-17\"><span class=\"toc-item-num\">17&nbsp;&nbsp;</span>Minimum Number of Days to Make m Bouquets</a></span><ul class=\"toc-item\"><li><span><a href=\"#Naive-Approach\" data-toc-modified-id=\"Naive-Approach-17.1\"><span class=\"toc-item-num\">17.1&nbsp;&nbsp;</span>Naive Approach</a></span></li><li><span><a href=\"#Efficient\" data-toc-modified-id=\"Efficient-17.2\"><span class=\"toc-item-num\">17.2&nbsp;&nbsp;</span>Efficient</a></span></li></ul></li><li><span><a href=\"#Capacity-to-ship-within-D-Days\" data-toc-modified-id=\"Capacity-to-ship-within-D-Days-18\"><span class=\"toc-item-num\">18&nbsp;&nbsp;</span>Capacity to ship within D Days</a></span></li></ul></div>"
1212
]
1313
},
14+
{
15+
"cell_type": "code",
16+
"execution_count": 2,
17+
"id": "11b6c634",
18+
"metadata": {
19+
"ExecuteTime": {
20+
"end_time": "2024-02-04T16:23:30.787489Z",
21+
"start_time": "2024-02-04T16:23:30.777189Z"
22+
}
23+
},
24+
"outputs": [],
25+
"source": [
26+
"from typing import *"
27+
]
28+
},
1429
{
1530
"cell_type": "markdown",
1631
"id": "cae90622",
@@ -1558,7 +1573,7 @@
15581573
},
15591574
{
15601575
"cell_type": "markdown",
1561-
"id": "b3b5868c",
1576+
"id": "5773eebb",
15621577
"metadata": {},
15631578
"source": [
15641579
"## Capacity to ship within D Days\n",
@@ -1582,28 +1597,15 @@
15821597
},
15831598
{
15841599
"cell_type": "code",
1585-
"execution_count": 1,
1586-
"id": "5c12e790",
1600+
"execution_count": 3,
1601+
"id": "43220477",
15871602
"metadata": {
15881603
"ExecuteTime": {
1589-
"end_time": "2024-02-04T16:23:16.323994Z",
1590-
"start_time": "2024-02-04T16:23:15.631855Z"
1604+
"end_time": "2024-02-04T16:23:35.640953Z",
1605+
"start_time": "2024-02-04T16:23:35.625869Z"
15911606
}
15921607
},
1593-
"outputs": [
1594-
{
1595-
"ename": "NameError",
1596-
"evalue": "name 'List' is not defined",
1597-
"output_type": "error",
1598-
"traceback": [
1599-
"\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
1600-
"\u001b[1;31mNameError\u001b[0m Traceback (most recent call last)",
1601-
"Cell \u001b[1;32mIn[1], line 1\u001b[0m\n\u001b[1;32m----> 1\u001b[0m \u001b[38;5;28;01mclass\u001b[39;00m \u001b[38;5;21;01mSolution\u001b[39;00m:\n\u001b[0;32m 2\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mshipWithinDays\u001b[39m(\u001b[38;5;28mself\u001b[39m, weights: List[\u001b[38;5;28mint\u001b[39m], days: \u001b[38;5;28mint\u001b[39m) \u001b[38;5;241m-\u001b[39m\u001b[38;5;241m>\u001b[39m \u001b[38;5;28mint\u001b[39m:\n\u001b[0;32m 3\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mfindVal\u001b[39m(cap, weights, days):\n",
1602-
"Cell \u001b[1;32mIn[1], line 2\u001b[0m, in \u001b[0;36mSolution\u001b[1;34m()\u001b[0m\n\u001b[0;32m 1\u001b[0m \u001b[38;5;28;01mclass\u001b[39;00m \u001b[38;5;21;01mSolution\u001b[39;00m:\n\u001b[1;32m----> 2\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mshipWithinDays\u001b[39m(\u001b[38;5;28mself\u001b[39m, weights: \u001b[43mList\u001b[49m[\u001b[38;5;28mint\u001b[39m], days: \u001b[38;5;28mint\u001b[39m) \u001b[38;5;241m-\u001b[39m\u001b[38;5;241m>\u001b[39m \u001b[38;5;28mint\u001b[39m:\n\u001b[0;32m 3\u001b[0m \u001b[38;5;28;01mdef\u001b[39;00m \u001b[38;5;21mfindVal\u001b[39m(cap, weights, days):\n\u001b[0;32m 4\u001b[0m days \u001b[38;5;241m=\u001b[39m \u001b[38;5;241m1\u001b[39m\n",
1603-
"\u001b[1;31mNameError\u001b[0m: name 'List' is not defined"
1604-
]
1605-
}
1606-
],
1608+
"outputs": [],
16071609
"source": [
16081610
"class Solution:\n",
16091611
" def shipWithinDays(self, weights: List[int], days: int) -> int:\n",
@@ -1626,7 +1628,7 @@
16261628
{
16271629
"cell_type": "code",
16281630
"execution_count": null,
1629-
"id": "cee21475",
1631+
"id": "e5ca0765",
16301632
"metadata": {},
16311633
"outputs": [],
16321634
"source": []

0 commit comments

Comments
 (0)