ZapTV Policy

Effective Date: 27/10/2023


Your privacy is important to us at ZapTV, the random video chat app. This Privacy Policy explains how we collect, use, and protect your personal information when you use our app. By using ZapTV, you consent to the practices described in this Privacy Policy.


1. Information We Collect


1.1. Google Authentication: When you log in to ZapTV, we use Google Authentication to verify your identity. We collect your email address associated with your Google account to create your ZapTV profile.


1.2. Camera and Microphone Permissions: To enable video chats, we request permission to access your device's camera and microphone. This allows you to see and be seen by other users during video chats.


2. How We Use Your Information


2.1. Profile Information: We use your email address from Google Authentication to create and manage your ZapTV account.


2.2. Video Chats: We use the camera and microphone permissions solely for the purpose of facilitating video chats on the app.


2.3. Communication: We may use your email address to communicate with you about app updates, notifications, or account-related matters.


3. Information Sharing


3.1. Other Users: When you engage in video chats on ZapTV, the information you share (e.g., video and audio) is visible to other users. Please be mindful of what you share during video chats.


3.2. Legal Compliance: We may disclose your information if required by law, such as responding to legal requests, protecting our rights, or ensuring the safety of users.


4. Data Security


4.1. We take reasonable measures to protect your personal information from unauthorized access, disclosure, alteration, or destruction.


4.2. While we make efforts to safeguard your data, no method of transmission over the internet or electronic storage is entirely secure, and we cannot guarantee absolute security.


5. Account Deletion


5.1. If you wish to delete your ZapTV account, please contact our support team. Once your account is deleted, your data will be removed from our system, subject to legal obligations.


6. Children's Privacy


ZapTV is not intended for children under the age of 18. We do not knowingly collect or maintain information from individuals under 18.


7. Changes to this Privacy Policy


7.1. We may update this Privacy Policy to reflect changes in our data practices or legal requirements. Any updates will be posted on the app.


7.2. Your continued use of ZapTV after any changes to the Privacy Policy indicates your acceptance of the revised policy.


8. Contact Information


If you have any questions or concerns regarding this Privacy Policy or how we handle your information, please contact us at soulunic7@gmail.com.


Thank you for using ZapTV. We value your trust and are committed to protecting your privacy during your random video chats.

Comments

Post a Comment

Popular posts from this blog

Write a program to implement Circular Queue using Array in c language  ChatGPT Certainly! Here's a simple implementation of a Circular Queue using an array in the C language: c Copy code #include <stdio.h> #define MAX_SIZE 5 // Structure to represent the Circular Queue struct CircularQueue {     int items[MAX_SIZE];     int front, rear; }; // Function to initialize the Circular Queue void initializeQueue(struct CircularQueue* queue) {     queue->front = -1;     queue->rear = -1; } // Function to check if the Circular Queue is empty int isEmpty(struct CircularQueue* queue) {     return (queue->front == -1 && queue->rear == -1); } // Function to check if the Circular Queue is full int isFull(struct CircularQueue* queue) {     return ((queue->rear + 1) % MAX_SIZE == queue->front); } // Function to enqueue an element into the Circular Queue void enqueue(struct CircularQueue* queue, int value) {     if (isFull(queue)) {         printf("Queue is full.
Read more

Code

 #include <stdio.h> #include <stdlib.h> // Function to merge two subarrays of arr[] void merge(int arr[], int left, int middle, int right) {     int i, j, k;     int n1 = middle - left + 1;     int n2 = right - middle;     // Create temporary arrays     int L[n1], R[n2];     // Copy data to temporary arrays L[] and R[]     for (i = 0; i < n1; i++)         L[i] = arr[left + i];     for (j = 0; j < n2; j++)         R[j] = arr[middle + 1 + j];     // Merge the temporary arrays back into arr[l..r]     i = 0; // Initial index of first subarray     j = 0; // Initial index of second subarray     k = left; // Initial index of merged subarray     while (i < n1 && j < n2) {         if (L[i] <= R[j]) {             arr[k] = L[i];             i++;         } else {             arr[k] = R[j];             j++;         }         k++;     }     // Copy the remaining elements of L[], if there are any     while (i < n1) {         arr[k] = L[i];         i++;        
Read more