Microsoft to drop the update of Windows 10 S

Microsoft is dropping ‘Windows 10 S ‘and SKU mode in favor of the new S mode. The news is confirmed That it will be done for Windows 10 Home, Pro and Education. The step must be taken in accordance to avoid the confusion among its hardware partners and consumers alike.

Microsoft introduced Windows 10 S late year in May. It was designated as “Streamlined version “ of its Windows 10 operating system. It is a fully functional version of Windows version provided to compete with Google’s Chrome Operating System. Unlike other versions of Windows 10, Windows 10 S didn’t allow users to download apps from third party stores and sites. That was really troublesome. The Surface Laptops were the first commercial device to available to run Windows 10 S. Total fee of $49 is to be provided for upgrading full version so that you can enjoy full functions of Windows 10 S.

Now it looks like Microsoft’s windows 10 S hasn’t got the desired attention which company hoped for. This is the reason that they are introducing new “S Mode” that will e available to OEMs across Windows 10 Home, Pro and Educational SKUs. The S mode will not allow user to download apps from the third party source killing the purpose of having a standalone Windows 10 S.

According to the user review it was noticed that out of those who bought Windows 10 S OS, 40 % were not bothered with the OS and rest 60% changed to Windows 10 Pro within 24 hours of the purchase. This data excludes the Surface Laptop device users. Eventually, it is said that Windows 10 Home users can disable the S mode free of cost. Those with Windows 10 Pro have to pay $49 to enable the S mode on their devices to get full access to Windows 10 Pro.

Comments

1721 - Swapping Nodes in a Linked List.

Hi, Today we will be solving leetcode qs 1721 - Swapping Nodes in a Linked List. This qs is really simple. We need to swap the nodes placed at k distance from the start and end of the Linked List. So let's suppose you have a Linked List input as follows: 1 -> 2-> 4 -> 5 -> 7 -> 8 -> 10-> 9 and you are given a k = 2, so the output should be 1 -> 10 -> 4 -> 5 -> 7 -> 8 -> 2 -> 9 so how do we achieve it??? Intuition The most brute force solution one can think of is using Array data structure. For that, we will traverse through linked List and store all the elements in the Array, swap the two numbers and again insert it in theLinked List again. Not bad, but let's deal with it, it is not the optimal solution and far from being as an acceptable solution in interviews. So what can we done instead of that??? Let's try to look deep into the working of Linked List first and how do we traverse it. Linked List is a linear data structure that...

How to bypass Android pattern lock using CMD.

Many of you have encountered the situation where you forget your phone's pattern lock. This is totally common and we can't deny this. Then after trying all the combinations in mind and losing hope we just choose to reset our phone. But here I am providing you with the solution to this problem. You can just open up your phone following these few steps and without undergoing any trouble of losing your data and wasting your time. Yes, I am talking about bypassing the pattern lock you used to unlock your phone. This procedure will be done using CMD. CMD, also known as command prompt is an amazing tool provided in Windows OP. You can control your entire computer using CMD which includes copying files from one folder to another, hiding your files, checking details of connected wireless devices and even shutting down your PC. You just need to learn some easy commands. How to bypass Pattern lock on your Android Phone? Before trying to Bypass the pattern lock...

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...

TechGen

Search This Blog