Skip to main content

ola cab booking

ola cab booking


ola cab booking- ola ek indain online transportation company hai jo online services provide karati hai aap iss blog pe aaye ho to aap logo ke mann mai ola cab booking ko lekar sawal honge to aaj hum iss article mai ola cab booking  step by step hi baat karenge. 


2017 ki  ek report ke hisaab se ola company  ki value 3 billion $ ki ho chuki hai  ola 3 december 2010 ko launch hui thi dosto ola company
ke  founder bhavish aggrawal aur ankit bhati hai jinhone ola jaise company India ko di.

ola aapko kafi achi services provide krti hai jaise ki  ola cab mai aapko AC  aur music system bhi milta hai jis se aapki ride aur bhi suvidha janak ho jati  hai
lekin bhut se cities mai ola ki services abi chalu nhi hai ye kuch hi main main city mai hai jaise ki delhi, mumbai , chandigarh etc.

agar aap kahi anjaan jagah mai fas jate hain aur aapko rasta ka bilkul bhi anumaan nhi hai to aise mai aap ola cab  ka istemaal kr skte hain aise wqt mai ola cab aapke bhut kaam aa skti hai

aaj ka yeh article unn logo ke liye hai jo phle baar ola cab use kar rhe hai to chaliye suru krte hain ola cab booking

step 1- sbse phle ola cab app play store se  download kar le. ya iss diye daye link se download kr le
https://hello.ola.app/refer/?referral_code=A7DZHMU


ola cab


step 2- ab aapko uss ola cab application  ko open krna  hai aur uspe apna phone number dalna hai aur aapke number pe ek OTPaayega usse verify krna hoga.

ola cab number varify



step 3-ab aapke samne location and phone ki permission aayegi usse aapko allow krna hai.
bina location aur phone ki permission allow kiye aap ola ki service ka fyda nhi utha skte.

ola cab

ola cab


also read- how google map work
step 4- bas ab aapka app ready hai istemaal ke liye ab aapko pickup location dalni hai jaha se aapko ride book krni hai.

ola cab booking

step-5 usse ke niche aapko drop location dalni hai jaha aapko jana hai.

ola cab booking


step 6- aapko kis pe ride krni hai  isske bhi  bhut sare option mil jayenge jaise ki mini,
micro, prime,auto ya share, lux etc inme se aap koi bhi select kr sakte ho.

ola cab booking


step 7- itna sbkuch krne ke baad aapko apni ride ka rate display hoga agar aapko
thik rate lgta hai to ride now pe click kare.


step 8- ab apke screen pe driver ki details and OTP display hoga jo aapko ride krne se phle driver ko btana
hoga.bas kuch hi time baad ola cab aapke pass pahunch jayegi.





please share this post with your friends and follow us.
also read-how to use paytm

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