2021-drone-building-project

30-seconds-of-code

Short JavaScript code snippets for all your development needs

acdb_get

android-kernel-tools

AOSP (GCC 4.9 & Clang 13 ), Snapdragon Clang 8.0.6

android_bionic

android_bootable_bootloader_edk2

LA.UM.9.12.r1-00000-SMxx50.QSSI14.0

android_bootable_recovery

android_device_oplus_rmx3360

FORCE PUSH WARNING // Device tree for Realme GT Master Edition // A12 Vendor

android_device_oplus_sm8350-common

FORCE PUSH WARNING // Common tree for Oneplus9RT Realme and Oppo SM8350/SM7350/SM7325 devices // A12 Vendor

android_device_revengeos_sepolicy

android_frameworks_base

RevengeOS core

android_hardware_libhardware

Android HAL

android_hardware_qcom_audio

android_hardware_qcom_media

android_hardware_qcom_thermal

sdm660 QCOM thermal hal.

android_kernel_oneplus_sm7325

android_kernel_oneplus_sm8350

android_kernel_unisoc

android_packages_apps_settings

android_system_security

android_vendor_qcom_opensource_power

sdm660 QCOM PowerHAL with binderized service and dt2w feature.

android_vendor_revengeos

anykernel3

AnyKernel, Evolved

aosp_sounds

assignment-cpp

awesome-cheatsheets

👩‍💻👨‍💻 Awesome cheatsheets for popular programming languages, frameworks and development tools. They include everything you should know in one single file.

awesome-design-patterns

A curated list of software and architecture related design patterns.

awesome-interview-questions

:octocat: A curated awesome list of lists of interview questions. Feel free to contribute! :mortar_board:

backdoor-apk

backdoor-apk is a shell script that simplifies the process of adding a backdoor to any Android APK file. Users of this shell script should have working knowledge of Linux, Bash, Metasploit, Apktool, the Android SDK, smali, etc. This shell script is provided as-is without warranty of any kind and is intended for educational purposes only.

binary_trees

Binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root.