Skip to content

Instantly share code, notes, and snippets.

View anudeepreddy's full-sized avatar
💻
Building

Anudeep Reddy anudeepreddy

💻
Building
View GitHub Profile
@anudeepreddy
anudeepreddy / maintainance.html
Last active April 16, 2020 07:25 — forked from pitch-gist/gist:2999707
HTML: Simple Maintenance Page
<!doctype html>
<title>Site Maintenance</title>
<style>
body { text-align: center; padding: 150px; }
h1 { font-size: 50px; }
body { font: 20px Helvetica, sans-serif; color: #333; }
article { display: block; text-align: left; width: 650px; margin: 0 auto; }
a { color: #dc8100; text-decoration: none; }
a:hover { color: #333; text-decoration: none; }
</style>
@anudeepreddy
anudeepreddy / app.css
Created February 23, 2020 14:34
print \n in new line css
div {
white-space: pre-wrap;
}
@anudeepreddy
anudeepreddy / activity.java
Created November 18, 2019 17:08
Android programming
package com.example.activity;
import android.os.Bundle;
import android.app.*;
import android.content.*;
import android.view.*;
import android.view.View.*;
import android.widget.*;
public class MainActivity extends Activity {
#include<bits/stdc++.h>
using namespace std;
double n,d,e,phi;
int modInverse(int a, int m)
{
a = a%m;
for (int x=1; x<m; x++)
if ((a*x) % m == 1)
return x;
return 1;

Keybase proof

I hereby claim:

  • I am anudeepreddy on github.
  • I am anudeepc (https://keybase.io/anudeepc) on keybase.
  • I have a public key ASB33HGQx77sAaxyxxkz4F5Css7svlYHsaakJlDkJjOhzQo

To claim this, I am signing this object:

#include<iostream>
using namespace std;
void traverse(int m,int n,void *_a,int _i,int _j){
int *a[m];
for(int i=0;i<m;i++)
a[i]=(int *)_a+n*i;
/*for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
cout<<a[i][j]<<" ";
package week10;
import java.io.*;
import java.util.Hashtable;
import java.util.Set;
import java.util.Iterator;
public class PhoneDirectory {
//this is the main function to search for data
public static void main(String []args){
Hashtable<String,String> data=readfile("phone.txt");
pkg install git -y
pkg install python -y
git clone https://github.com/An0nUD4Y/SocialFish.git
cd SocialFish
pip install -r requirements.txt
#include<iostream>
using namespace std;
struct node{
node *l;
int data;
node *r;
};
node *last;
node* create(node *root,int ele){
node* New=new node;
@anudeepreddy
anudeepreddy / BST.cpp
Last active November 8, 2018 00:40
Externals
#include<stdlib.h>
#include<iostream>
using namespace std;
struct node{
struct node *l;
int data;
struct node *r;
};
//findmin
struct node * findmin(node *root){