Skip to main content

smartphone under 13k in india

smartphone under 13k in india

Hello guys
स्वागत है आपका पर।
जैसा कि आप जानते हैं आजकल smartphone का जमाना है और हर किसी के पास smartphone तो जरूर होता है लेकिन जब आप बाज़ार मे smartphone लेने जाते हैं तो ऐसे मे
आपके मन मे जरूर प्रश्न उठते होंगे कि कौनसा फ़ोन बेहतर रहेगा ? Camera कितने MP का BEST रहेगा? RAM कितनी होनी चाहिए? ऐसे मे   आपको smartphone का चुनाव करते समय परेशानी जरूर होती होगी
आज हम बात करेंगे  best smartphone under 13k in india

smartphone under 13k in india

आपके बजट के हिसाब से सबसे बेहतरीन smartphone under 13k in india

Realme smartphone review

1- realme का बेहतरीन फ़ोन Realme 1 (Solar Red, 6GB RAM, 128GB Storage) ने बाजार मे धूम मचा के रखी है
ROM- 128 GB
Androids and processor-
Android v8.1 Oreo based Color operating system 5.0 with 8-cores CPU and 2-cores AI CPU 2GHz Helio P60 AI processor
Camera- 13 MP Rear camera + 8MP front camera
Display- 6 inch full HD display with 2160×1080 pixels
Battery backup-
Battery: 3410 mAH lithium ion AI battery providing talk-time of 30 hours with stand by upto 380 hours
Weight- 156gm

With 256GB expandable memory, Dual 4G supportable and 1 year manufacturer warranty and 6 month manufacturer warranty for in box accessories
इतने फीचर्स  के बाद तो आपको इस फोन को लेने का मन जरूर हुआ होगा
मेरे हिसाब से Realme का इतना बेहतर फ़ोन इतने सस्ते कीमत मे नहीं मिलने वाला अगर आप smartphone लेने की सोच रहे हैं तो realme के इस फोन के अलावा कोई दूसरा विकल्प नही अगर आप खरीदना चाहते हैं तो amazon से खरीद सकते हैं इस फोन को खरीदने के लिए लिंक नीचे दिया गया है।

आने वाले नए  फ़ोन के review के लिए हमें follow करें।
Visit also hindi tech website -


Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1