Skip to main content

WhatsApp with its new feature coming up soon.


The most popular instant messaging app, WhatsApp have got a new update. The update will allow the user to add up to 3 people in the video call. The current version only allows video call with single contact by restriction you to contact another user while in the video call. This update is exclusively available for Android users. This update is yet under test and the feature will be used in Beta version 2.18.39 anytime soon. After the update release, users will be able to contact members at the same time during an ongoing video call. This means there will be conference video call in total of 4 members.

The layout decided is to split the screen into 4 equals. The one who is admin of the WhatsApp account will be in top left following by other members. When you are on a video call with a single person you will be provided with Add Person icon on the top right and you can click on the button to add another person. This feature is yet to be tested, so it will be bit soon to think that ‘conference calling’ will be available during voice calls too. But for sure, video conferencing is ‘ON’.


With this feature, Whatsapp most probably will be competing with Skype as well. Recent reports states that WhatsApp might provide group voice calling just like Hike Messenger but adding group video calling will prove to be an interesting step. A month ago, WhatsApp launched its ‘WhatsApp Business’ app which provides interface for small business owner to communicate with their customers easily. According to recent reports, Mark Zukerberg said, “There are more than 1.5 billion user out of which 200 million users are Indians.” This proves how much popular this messaging app is in India. Currently,  WhatsApp is also testing WhatsApp pay and WhatsApp Stickers features. 

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