Coding You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. coding wallah March 22, 2023
Coding Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. coding wallah March 22, 2023
Coding You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading O's. Increment the large integer by one and return the resulting array of digits. coding wallah March 22, 2023
Coding Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity. coding wallah March 22, 2023
Coding Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. coding wallah March 22, 2023
![Learn Python With Data Science Challenge [ Day-1 ]](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhw_5yBusWCSjjKxsPM1_CARKgP-TrCfJlX3RWVGGQuySBf_GcC4CNktqYiUDU4_NTXUWlrliB7oRpdFfAEUtWcU_-ApLJl3F7350Z_bZTb1o_ZM22iaH0TKeIYDO6Zu5Xh8L9COf9GZV95ClT51XmoJumLxxr1HL7aDtk82SRrQ2MZorHg6u63r7mFjPg/w74-h74-p-k-no-nu/Pink%20Coffee%20Motto%20Minimalist%203D%20Instagram%20Post.png)
.png)
![You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgKj1j7xmvEO_qu0340WW9TT6MGL_7jrPvEOtsd7qJrhQOp1AtnwlrQ2yY5DZwWYIr89eP1XlNoR0blBPG-tnnCdch4X5RpXLVoBJlv6fWqGQBdGqvmV1EuwxXAp7JKfSDGKX65eSw_RrkL5LuDhz_hcyHH0xN5zy9ezT5y58RmyPRcez1CL8tcyUzl/w74-h74-p-k-no-nu/photo_6114100741921683658_y.jpg)
.jpg)
![You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading O's. Increment the large integer by one and return the resulting array of digits.](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgCouD8dj9cQTVBZ5xANJy86yinZoCeRjngjbgZULDWeHMHZlEbNckjGIF1hddC-AAVZqskWNOCqIwLihfwutnVgJz6w03PYaNv-L2sJ9P9lv9hCA1J8xCkrgzGQIcq-M3AJr_PEKcN6A8TbBu-k12PFgra-K0FsGHyC4cqlZwdtnAN3jK3udzPk8Ky/w74-h74-p-k-no-nu/photo_6114100741921683656_y.jpg)
