Skip to main content

smartphone under 13k in india


smartphone under 13k in india

Hello guys
स्वागत है आपका technicalkeeda.in पर।
जैसा कि आप जानते हैं आजकल 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) ने बाजार मे धूम मचा के रखी है
Features
RAM- 6 GB
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 से खरीद सकते हैं इस फोन को खरीदने के लिए लिंक नीचे दिया गया है।
Link-

आने वाले नए  फ़ोन के review के लिए हमें follow करें।
Visit also hindi tech website -https://www.techzyan.com

Comments

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

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

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi