Best 5 android phones to buy under 10000. Buy before sale ends. Best smart phones.

-

Here we bring you a list of  10 android phones that are best for you.

1.Tecno Spark 9 (Sky Mirror, 6GB RAM, 128GB Storage)| Upto 11GB Expandable RAM | 90Hz Refresh Rate | 6.6" HD+Display | 13MP Dual Camera | 5000mAh Battery | Helio G37 Gaming Processor

Techno Spark 9T

Techno Spark 9T is currently providing amazing specifications of  6GB RAM and 128GB Storage at just the price of ₹9,499.00. Such an amazing deal, go check it out by clicking here.

About this item

  • Up to 11GB larger RAM (6GB LPDDR4x + 5GB Virtual RAM) with the help of memory fusion technology | 37% improvement in app switching | 128GB eMCP ROM | No support for Africa's frequency bands
  • 90Hz Refresh Rate | 180Hz Touch Sampling Rate | 6.6" HD+ Dot Notch display | 269PPI Pixel Density for richer colors
  • 13MP rear Dual Camera and Dual Flashlight | 8MP Selfie camera with front flash| Multiple AI modes like Portrait, HDR, Smile Shot, AI Scene Detection | Shoot Clear 1080P Time-lapse, Slow Motion, Video Bokeh videos
  • MediaTek Helio G37 Gaming Processor | 64-bit 2.3GHz Max CPU Frequency | HiOS 8.6 based on Android 12 | DTS Powered Loud Speaker | Soplay 2.0 for Music composing
  • 5000mAh battery with up to 30 days long standby | 25 hours of Video playback or 26 hours of Calling or 133 hours of music playback | Ultra Battery saver mode for extreme backup

2. realme narzo 50i (Carbon Black, 4GB RAM+64GB Storage) - 6.5" inch Large Display | 5000mAh Battery

Realme Narzo 50i comes with great 6.5" inch large screen display, specifications of 4GB RAM and 64GB storage at an amazing cost of ₹8,999.00. Click here to buy.

About this item

  • 4 GB RAM | 64 GB ROM | Expandable Upto 256 GB
  • 16.51 cm (6.5 inch) HD+ Display
  • 8MP Primary Camera | 5MP Front Camera
  • 5000 mAh Battery
  • Octa-core Processor

 

4. Redmi 9A Sport (Coral Green, 3GB RAM, 32GB Storage) | 2GHz Octa-core Helio G25 Processor | 5000 mAh Battery


Well, This would sound unbelievable but Redmi 9A at the amazing specifications of 3GB Ram and 32GB Storage comes at the price of only ₹7,999.00. Go check it out by clicking here.

About this item

  • Processor: MediaTek Helio G25 Octa-core; Up to 2.0GHz clock speed
  • Camera: 13 MP Rear camera with AI portrait| 5 MP front camera
  • Display: 16.58 centimeters (6.53-inch) HD+ display with 720x1600 pixels and 20:9 aspect ratio
  • Battery: 5000 mAH large battery with 10W wired charger in-box
  • Memory, Storage & SIM: 3GB RAM | 32GB storage | Dual SIM (nano+nano) + Dedicated SD card slot
  • Form factor: Bar, Operating system:MIUI 12


5. OPPO A15s (Fancy White, 4GB RAM, 64GB Storage) 

Click here to check this out.

About this item

  • 13MP+2MP+2MP primary camera with Photo, Video, Panoramic, Portrait, Time-lapse | 8MP front facing camera
  • 16.55 centimeters (6.52-inch) HD+ capactive touchscreen with 1600 x 720 pixels resolution, 269 ppi pixel density and 16.7M color support
  • Memory, Storage & SIM: 4GB RAM | 64GB storage expandable up to 256GB | Dual nano SIM with dual standby (4G+4G)
  • Color OS 7.2 based on android version 10 operating system with 2.3GHz Mediatek Helio P35 octa core processor, GPU IMG GE8320
  • 4230 mAH battery providing talk-time of 29 hours and standby time of 323 hours
  • 1 year manufacturer warranty for device and 6 months manufacturer warranty for in-box accessories including batteries from the date of purchase
  • Box also includes: USB Cable, Adapter, Sim Tray Ejector, Protective Case, Booklet with Warranty Card and Quick Guide






Comments

Post a Comment

Popular posts from this blog

Multiply Strings Leetcode 43 question Correct Solution

-
 Question : Given two non-negative integers  num1  and  num2  represented as strings, return the product of  num1  and  num2 , also described as a string. Note:  You must not use any built-in BigInteger library or directly convert the inputs to integers. Constraints: 1 <= num1.length, num2.length <= 200 num1  and  num2  consist of digits only. Both  num1  and  num2  do not contain any leading zero, except the number  0  itself. /**  * @param {string} num1  * @param {string} num2  * @return {string}  */ var add = function ( a , b ){     // length of a should be smaller     if ( a . length > b . length ) return add ( b , a );     // iterate a     let i = a . length - 1 , j = b . length - 1 , carry = 0 , currAns = '' ;     while ( i >= 0 ){         // get nums        ...
Read more

In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute.

-
Image
Q1 (12 points) In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute. On the answer sheet, enter the values for nij, i = 1, 2, 3, j = 1, 2, 3, 4. Q1. Solution: Aim: Each entry denotes the largest integer n such that f(n) milliseconds do not exceed t. FIRST ROW........................................... i) Solving n11 :   Here , f(n) = 100n + 200 And t = 1 second. so,    where n is an integer   : [t = 1second = 1000ms]  Ans:  ii) Solving n12 Here , f(n) = 100n + 200 And t = 1minute = 60sec = 60000ms Ans :  iii) Solving n13 Here , ...
Read more

Longest Palindromic Substring Solution

-
Image
 Question:  Given a string  s , return  the longest palindromic substring  in  s . Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Solution : Let us create a Table. If the string size is n, then the table will have n rows and n columns. The element a(i, j) of the table will determine whether the substring from index i to j is a palindrome or not. So in this way, we will calculate the maximum length of the palindromic substring.  Now to fill this table we will use the following algorithm:  STEP 1: Create a Table, Where the Row index is the start of the palindrome substring and the column index is the end of the palindromic substring. STEP 2:  Fill the diagonal of the table with 1. Because (i, i) is itself a palindrome of length 1. STEP 3: Fill (i, i+1) by checking adjacent characters. If they are equal then 1, else 0. STEP 4: For every Distance other su...
Read more