Skip to main content

JioPhone Next Specifications Tipped, May Get Qualcomm QM215 SoC, 13-Megapixel Single Rear Camera

JioPhone Next, made as a team with Google, will pass the discount in India on September 10. 

jio phone next

JioPhone Next, the forthcoming section stages the Android cell phone plan with the guide of Reliance Jio in organization with Google, transformed into reported in June. The phone is planned to head marked down in September and appears as though its particulars have spilled. JioPhone Next is expressed to run Android eleven (Go Edition) and element a solitary back camera, along with an HD+ show. At the forty-fourth Reliance Industries Annual General Meeting (AGM) where the phone becomes first presented, Reliance Chairman and Managing Director Mukesh Ambani had said the JioPhone Next could be the most extreme low-evaluated cell phone not just in India, but rather all around the world. 


The specs of the JioPhone Next had been shared by utilizing Mishaal Rahman, the Editor-in-Chief at XDA Developers on Twitter, along with a screen capture of the phone's boot show which says "JioPhone Next Created with Google". The telephone is expressed to have the form assortment LS-5701-J and run on Android eleven (Go Edition). It may likewise work a 720x1,440 pixels show and be fueled through a Qualcomm QM215 SoC. It is a 64-bit, quad-focus portable processor with the Qualcomm Adreno 308 GPU. It is intended for low-stop gadgets and is inferred with an inherent Qualcomm Snapdragon X5 LTE modem with a guide for Bluetooth v4.2, GPS, up to 1080p video recording, LPDDR3 RAM, and eMMC 4.5 capacity. 


Rahman also asserted that the JioPhone Next will get a solitary 13-megapixel camera at the again and an 8-megapixel digicam on the front for selfies and video calls. Furthermore, the cell phone is expressed to return pre-set up with 'DuoGo' that could have a couple of low RAM improvements. A more modern model of Google Camera Go is moreover pre-snared on the phone with Snapchat reconciliation. 


With respect to the value, Rahman makes reference to that the partnerships are focusing on a sub $50 rate label which shows the telephone should cost underneath Rs. 4,000 in India. It is booked to go at a bargain on September 10 anyway Jio has not shared value at this point.

I have this youtube channel called Road2geeks in here you'll be seeing various tutorials along with some knowledge that I have voiceover so do also check our channel Road2geeks so that's all for this blog friends thank you very much for reading this blog, meet you in the next blog until then stay safe Jai hind.

Labels:

Comments

Post a Comment

Share your views on this blog😍😍

Popular posts from this blog

LeetCode 88 Explained: Four Approaches, Mistakes, Fixes & the Final Optimal Python Solution

Evolving My Solution to “Merge Sorted Array” A practical, beginner-friendly walkthrough showing four versions of my code (from a naive approach to the optimal in-place two-pointer solution). Includes explanations, complexity and ready-to-paste code. Problem Summary You are given two sorted arrays: nums1 with size m + n (first m are valid) nums2 with size n Goal: Merge nums2 into nums1 in sorted order in-place . Version 1 — Beginner Approach (Extra List) I merged into a new list then copied back. Works, but not in-place and uses extra memory. class Solution: def merge(self, nums1, m, nums2, n): result = [] p1 = 0 p2 = 0 for _ in range(m+n): if p1 >= m: result.extend(nums2[p2:n]) break elif p2 >= n: result.extend(nums1[p1:m]) break elif nu...
Post a Comment
Read more

Product of Array Except Self in Python | Prefix & Suffix Explained (LeetCode 238)

Problem Overview The Product of Array Except Self is a classic problem that tests your understanding of array traversal and optimization. The task is simple to state but tricky to implement efficiently. Given an integer array nums , you need to return an array such that each element at index i is equal to the product of all the elements in nums except nums[i] . The challenge is that: Division is not allowed The solution must run in O(n) time Initial Thoughts At first glance, it feels natural to compute the total product of the array and divide it by the current element. However, this approach fails because division is forbidden and handling zeroes becomes messy. This pushed me to think differently — instead of excluding the current element, why not multiply everything around it? That’s where the prefix and suffix product pattern comes in. Key Insight: Prefix & Suffix Products For every index i : Prefix product → product of all elements to t...
Post a Comment
Read more

Best Time to Buy and Sell Stock – LeetCode 121

Best Time to Buy and Sell Stock – LeetCode 121 (O(n) One-Pass Solution) The Best Time to Buy and Sell Stock problem from LeetCode 121 is a classic array and greedy problem frequently asked in coding interviews. The goal is to maximize profit by choosing a single day to buy and a later day to sell. Problem Statement You are given an array prices , where prices[i] represents the price of a stock on day i . You may complete at most one transaction (buy once and sell once). Input: prices = [7,1,5,3,6,4] Output: 5 Input: prices = [7,6,4,3,1] Output: 0 If no profit is possible, return 0 . Key Observations You must buy before you sell Only one transaction is allowed The selling day must come after the buying day Approach 1: Brute Force (Not Optimal) The brute force approach checks every possible pair of buying and selling days and calculates the profit. for i in range(n): for j in range(i+1, n): profit = max(profit, prices[j] - prices...
Post a Comment
Read more