Skip to main content

OnePlus 3 and 3T to get their last major update


Android O will be the only last major update for One plus 3 and 3T. Yes, Android 8.0 will be the part of one plus 3 and 3 T till they shut down. One Plus today confirmed it by itself.

As usual the update scenario of One Plus have not been such an attraction for their current users. And is still debatable. According to the company itself, these two devices will receive Android O as the latest and only update. They also tell about security patches, and these are not the flattering words.
It is obvious that two of the devices are more capable to support Android P although it is obvious that we may see these updates in the community.

There were some disagreements regarding the updates of OnePlus X an OnePlus 2 and the recent release of OnePlus 5. And now Users are asking certain questions from company like, Why One Plus have received more updates than OnePlus 3 and OnePlus 3T. 

The leader of OnePlus product section, Oliver, has responded and it was clear that Android O will be last major update for OnePlus 3 and 3T.

Oliver said, “When a new device is launched in market, the software team devotes one or two months to solve the bug or glitches in the phone”. It is too clear and reasonable to think like that. Being that OnePlus 5 is the most recent phone, it spends more time to level the updates. They also mentioned the reason behind the delay of August patch. According to them OxygenOS 4.5 is the main reason behind the delay.

Due to hardware difference the gestures and DCI-P3 screen calibrations were not be available in OnePlus 3 and OnePlus 3T. These features are well suitable for OnePlus 5. The real bad news arises with the question that “How long will software support the OnePlus 3 and 3T?”

The answer is that Android O is the last major update that these phones will receive. On future security patches, shortcuts are shown : “They will continue for the foreseeable future

Comments

Post a Comment

Popular posts from this blog

1235. Maximum Profit in Job Scheduling

Hi everyone, Today's post is little bit intriguing to me as it took me some time to get t the solution. I have been out of practice for a bit so I was not able to do it in the DP. I didn't want to copy the code. Though i understood the code after i checked its solution in the discussions. Anyways, i tried to do it with heap and with some thinking I was able to do it and with my surprise It performed real well. I would like to jump to the solution but first I would like to explain a little bit about heaps so you can get better understanding of the code. A heap is like a special type of list where the smallest (or largest) item is always at the front. Think of it like a priority line at a theme park, where the person with the highest priority goes to the front. There are two types of heaps: Min Heap: The smallest item is at the front. It's like standing in a line where the shortest person is always at the front. Max Heap: The largest item is at the front. It's like stand
2 comments
Read more

1456, Maximum Number of Vowels in a Substring of Given Length

Hi, folks today I am here with an interesting coding problem from Leetcode. *To directly go to the question please click here. So I will walk through the solution. It will be a brute force and an optimized way solution. I will be explaining the optimized way solutions in depth. # Intuition For any substring of length k, we need to find how many vowels are there in it and provide the highest count of all counts of vowels in a substring. Test Case 1 Input k = 2 and s='asjdee' Output - 2 Explanation: As for substring of length k=2, in the string 's' we have 'ee' when the length is k and the vowels count is 2 Test Case 2 Input k=3 and s='aasdiisdwe' Output - 2 Explanation - For all the substrings with length k = 3 we have 'aas' and 'dii' with 2 vowels each in it. Brute Force - Looping (twice) - Gives TLE (Not recommended) # Approach Create a hashmap (dictionary) with all the vowels in it. Loop through the string till len(s)-k element of strin
Post a Comment
Read more

1287. Element Appearing More Than 25% In Sorted Array

Hi, Today i bring you new Leetcode problem. Its an easy one :) The problem is - Element Appearing More Than 25% In Sorted Array As qs. explains itself we need to find a number that appears 25% times or more than the length of he array. So for example if array has length of 8 then the resultant number should appear 2 or more times. The constraints given are - 1 <= arr.length <= 100, 0 <= arr[i] <= 10 5 So, lets look at the cases which we may encounter. 1. if length is 1. then the number itself is the result. 2. if length is divisibe by 4 3. if length is not divisible by 4. Let's look at the code now...  class Solution : def findSpecialInteger ( self , arr : List[ int ]) -> int : n = len (arr) start = 0 end = n hm = defaultdict() for i in arr: hm[i] = hm.get(i, 0 )+ 1 for i in hm: if hm[i]>n// 4 : return i Now we will go through the code. Step 1: Initializatio
Post a Comment
Read more