Skip to content

Instantly share code, notes, and snippets.

View kalyandechiraju's full-sized avatar
🎯
Focusing

Kalyan Dechiraju kalyandechiraju

🎯
Focusing
35 followers · 29 following
View GitHub Profile
@kalyandechiraju
kalyandechiraju / Example.kt
Created March 20, 2019 06:54 — forked from jonasbark/Example.kt
https://github.com/airbnb/epoxy/issues/164
fun addDecoration() {
recyclerView.addItemDecoration(
StickyHeaderItemDecoration(
epoxyController,
listOf(
TitleBindingModel_().id("title 3").id(), // steal the conversion from the ID constructors to its long value
TitleBindingModel_().id("title 20").id()
)
)
)
@kalyandechiraju
kalyandechiraju / RxJava.md
Created April 9, 2018 02:09 — forked from cesarferreira/RxJava.md
Party tricks with RxJava, RxAndroid & Retrolambda

View Click

Instead of the verbose setOnClickListener:

RxView.clicks(submitButton).subscribe(o -> log("submit button clicked!"));

Filter even numbers

Observable
    .just(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
@kalyandechiraju
kalyandechiraju / GitCommitEmoji.md
Created February 22, 2018 12:37 — forked from parmentf/GitCommitEmoji.md
Git Commit message Emoji
@kalyandechiraju
kalyandechiraju / Fastfile
Created December 31, 2017 07:08 — forked from polbins/Fastfile
Fastlane script for Uploading to Slack and Play Store Alpha
default_platform :android
platform :android do
before_all do
ENV["SLACK_URL"] = "https://hooks.slack.com/services/ABC/123/XYZ"
end
######################### PUBLIC LANES #########################
desc "Deploy a new Prod APK version to Play Store Alpha"
@kalyandechiraju
kalyandechiraju / BSTDeletion_CPP.cpp
Created October 21, 2017 15:20 — forked from mycodeschool/BSTDeletion_CPP.cpp
/* Deleting a node from Binary search tree */
#include<iostream>
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
};
//Function to find minimum in a tree.
Node* FindMin(Node* root)
@kalyandechiraju
kalyandechiraju / PreorderInorderPostorder_CPP.cpp
Created October 21, 2017 12:28 — forked from mycodeschool/PreorderInorderPostorder_CPP.cpp
Binary tree traversal: Preorder, Inorder, Postorder
/* Binary Tree Traversal - Preorder, Inorder, Postorder */
#include<iostream>
using namespace std;
struct Node {
char data;
struct Node *left;
struct Node *right;
};
@kalyandechiraju
kalyandechiraju / LevelOrder_CPP.cpp
Created October 21, 2017 12:11 — forked from mycodeschool/LevelOrder_CPP.cpp
/* Binary tree - Level Order Traversal */
#include<iostream>
#include<queue>
using namespace std;
struct Node {
char data;
Node *left;
Node *right;
};
@kalyandechiraju
kalyandechiraju / Queue_LinkedList.c
Created October 21, 2017 07:16 — forked from mycodeschool/Queue_LinkedList.c
Linked List implementation of Queue.
/*Queue - Linked List implementation*/
#include<stdio.h>
#include<stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Two glboal variables to store address of front and rear nodes.
struct Node* front = NULL;
struct Node* rear = NULL;
@kalyandechiraju
kalyandechiraju / Queue_CircularArrayImplementation.cpp
Created October 21, 2017 07:03 — forked from mycodeschool/Queue_CircularArrayImplementation.cpp
Queue - Array Implementation
/* Queue - Circular Array implementation in C++*/
#include<iostream>
using namespace std;
#define MAX_SIZE 101 //maximum size of the array that will store Queue.
// Creating a class named Queue.
class Queue
{
private:
int A[MAX_SIZE];
@kalyandechiraju
kalyandechiraju / InfixToPostfix.cpp
Created October 21, 2017 06:23 — forked from mycodeschool/InfixToPostfix.cpp
Infix to Postfix conversion in C++ using stack. We are assuming that both operators and operands in input will be single character.
/*
Infix to postfix conversion in C++
Input Postfix expression must be in a desired format.
Operands and operator, both must be single character.
Only '+' , '-' , '*', '/' and '$' (for exponentiation) operators are expected.
*/
#include<iostream>
#include<stack>
#include<string>