Skip to content

Instantly share code, notes, and snippets.

import 'package:fl_chart/fl_chart.dart';
import 'package:flutter/material.dart';
class LineChartSample7 extends StatelessWidget {
const LineChartSample7({Key? key}) : super(key: key);
@override
Widget build(BuildContext context) {
return AspectRatio(
aspectRatio: 2.6,
@prajwal27
prajwal27 / wakelock.kt
Created September 23, 2021 12:22
Android native code for wakelock implementation for Flutter project
lateinit var wakeLock: PowerManager.WakeLock
private fun deactivateAutoScreenOffOnProximity() {
if(wakeLock.isHeld){
wakeLock.release()
}
}
@SuppressLint("WakelockTimeout")
private fun activateAutoScreenOffOnProximity() {
if(!wakeLock.isHeld) {
@prajwal27
prajwal27 / authentication_cubit.dart
Last active September 22, 2021 04:17
widget_testing_with_cubit
import 'dart:developer';
import 'package:bloc/bloc.dart';
import 'package:equatable/equatable.dart';
import 'package:mobility_one/repositories/accounts_repository.dart';
import 'package:mobility_one/repositories/authentication_repository.dart';
import 'package:mobility_one/util/api_client.dart';
import 'package:mobility_one/util/auth_util.dart';
import 'package:mobility_one/util/util.dart';
import 'package:oauth2/oauth2.dart' as oauth2;
@prajwal27
prajwal27 / no_sql.txt
Last active June 17, 2021 18:06
Instagram like Follow-Unfollow feature
Future<void> followUser(String userId, String username) async {
var batch = firebaseFirestore.batch();
var myDocument = firebaseFirestore
.collection('Users')
.doc(firebaseAuth.currentUser!.uid);
var myFDocument = firebaseFirestore
.collection('Follow')
.doc(firebaseAuth.currentUser!.uid);
#include<stdio.h>
#include<stdlib.h>
#define MAX 100
void create_graph();
void add(int vertex);
int del();
int isEmpty();
void c(vector<string> &A,int i,int j)
{
if(i<0 || j<0 || j>=A[0].size() || i >=A.size())
return;
if(A[i][j]=='O')
return;
A[i][j]='O';
c(A,i+1,j);
c(A,i-1,j);
c(A,i,j-1);
int Solution::trap(const vector<int> &a) {
int n = a.size(), ans = 0;
vector<int> l(n);
vector<int> r(n);
l[0] = a[0];
for (int i = 1; i < n; i++)
left[i] = max(l[i-1], a[i]);
r[n-1] = a[n-1];
#include <stdio.h>
int main(){
int i,j,k,n,a[10][10],indeg[10],flag[10],count=0;
printf("Enter the no of vertices:\n");
scanf("%d",&n);
printf("Enter the adjacency matrix:\n");
for(i=0;i<n;i++){
#include<stdio.h>
typedef struct node
{
int data;
struct node *left,*right;
int ht;
}node;
node *insert(node *,int);