├── README.md └── UNLICENSE /README.md: -------------------------------------------------------------------------------- 1 | # Full-stack Developer Interview Questions and Answers 2 | 3 | ## Table of Contents 4 | 5 | * [Architecture](#architecture) 6 | * [Concurrency](#concurrency) 7 | * [Java](#java) 8 | * [General Questions](#general) 9 | * [WEB](#web) 10 | * [SQL](#sql) 11 | * [NoSQL](#nosql) 12 | * [Transactions](#transcations) 13 | * [Scalability](#scalability) 14 | * [Load balancing](#load-balancing) 15 | * [Cloud computing](#cloud-computing) 16 | * [Distributed](#distributed) 17 | * [Cache](#cache) 18 | * [Networking](#networking) 19 | * [Operating system](#os) 20 | * [Compilers](#compilers) 21 | * [C++](#cpp) 22 | * [Javascript](#javascript) 23 | * [Python](#python) 24 | * [Go](#go) 25 | * [Code writing](#codewriting) 26 | * [Functional programming](#functional-programming) 27 | * [Reactive programming](#reactive-programming) 28 | * [Git](#git) 29 | * [DevOps](#devOps) 30 | * [QA](#qa) 31 | * [Agile, Scrum, XP](#agile) 32 | * [Algorithms](#algorithms) 33 | * [UML](#uml) 34 | * [Other](#other) 35 | * [Machine learning](#machine-learning) 36 | * [Big Data](#big-data) 37 | * [Image processing](#image-processing) 38 | * [Cryptography](#cryptography) 39 | * [Security](#security) 40 | * [Android](#android) 41 | * [Books](#books) 42 | 43 | #### [[⬆]](#toc) Architecture: 44 | * *Design principles*. ([*DRY*](https://en.wikipedia.org/wiki/Don%27t_repeat_yourself), [*KISS*](https://en.wikipedia.org/wiki/KISS_principle), [*YAGNI*](https://en.wikipedia.org/wiki/You_aren%27t_gonna_need_it), [*Occam's razor*](https://en.wikipedia.org/wiki/Occam%27s_razor), [*Worse is better*](https://en.wikipedia.org/wiki/Worse_is_better), [*convention over configuration*](https://en.wikipedia.org/wiki/Convention_over_configuration), [*separation of concerns*](https://en.wikipedia.org/wiki/Separation_of_concerns), [*Law of Demeter (principle of least knowledge)*](https://en.wikipedia.org/wiki/Law_of_Demeter), boy scout rule, [*single source of truth*](https://en.wikipedia.org/wiki/Single_source_of_truth), [*single version of truth*](https://en.wikipedia.org/wiki/Single_version_of_the_truth), [*principle of least astonishment*](https://en.wikipedia.org/wiki/Principle_of_least_astonishment), [*let it crash principle*](https://en.wikipedia.org/wiki/Crash-only_software), [*inversion of control*](https://en.wikipedia.org/wiki/Inversion_of_control)) 45 | * [*SOLID*](https://en.wikipedia.org/wiki/SOLID_(object-oriented_design)) 46 | 47 | |Rule|Description| 48 | |:--|:--| 49 | |[**S**ingle responsibility principle](https://en.wikipedia.org/wiki/Single_responsibility_principle)|A module should be responsible to one, and only one, actor.| 50 | |[**O**pen/closed principle](https://en.wikipedia.org/wiki/Open/closed_principle)|A software artifact should be open for extension but closed for modification.| 51 | |[**L**iskov substitution principle](https://en.wikipedia.org/wiki/Liskov_substitution_principle)|It should be possible to substitute base class with derived class.| 52 | |[**I**nterface segregation principle](https://en.wikipedia.org/wiki/Interface_segregation_principle)|Many client-specific interfaces are better than one general-purpose interface.| 53 | |[**D**ependency inversion principle](https://en.wikipedia.org/wiki/Dependency_inversion_principle)|Depend upon Abstractions but not on concretions. This means that each module should be separated from other using an abstract layer which binds them together. Source code dependency points in the opposite direction compared to the flow of control.| 54 | 55 | * [*The Clean Architecture*](https://8thlight.com/blog/uncle-bob/2012/08/13/the-clean-architecture.html) 56 | * [*Clean Code Cheat Sheet*](https://www.planetgeek.ch/wp-content/uploads/2014/11/Clean-Code-V2.4.pdf) 57 | * [*One key abstraction*](http://wiki3.cosc.canterbury.ac.nz/index.php/One_key_abstraction) 58 | * [*Aspect-oriented programming*](https://en.wikipedia.org/wiki/Aspect-oriented_programming) 59 | * [*The Twelve-Factor App*](http://12factor.net) 60 | * [*Domain-driven design*](https://en.wikipedia.org/wiki/Domain-driven_design) 61 | * [*Microservices*](https://en.wikipedia.org/wiki/Microservices) are a style of software architecture that involves delivering systems as a set of very small, granular, independent collaborating services. 62 | * Pros of *microservices* (The services are easy to replace, Services can be implemented using different programming languages, databases, hardware and software environment, depending on what fits best) 63 | * *Design patterns*. 64 | * **Creational**: [*Builder*](https://refactoring.guru/design-patterns/builder), [*Object Pool*](https://en.wikipedia.org/wiki/Object_pool_pattern), [*Factory Method*](https://refactoring.guru/design-patterns/factory-method), [*Singleton*](https://refactoring.guru/design-patterns/singleton), [*Multiton*](https://en.wikipedia.org/wiki/Multiton_pattern), [*Prototype*](https://refactoring.guru/design-patterns/prototype), [*Abstract Factory*](https://refactoring.guru/design-patterns/abstract-factory) 65 | * **Structural**: [*Adapter*](https://refactoring.guru/design-patterns/adapter), [*Bridge*](https://refactoring.guru/design-patterns/bridge), [*Composite*](https://refactoring.guru/design-patterns/composite), [*Decorator*](https://refactoring.guru/design-patterns/decorator), [*Facade*](https://refactoring.guru/design-patterns/facade), [*Flyweight*](https://refactoring.guru/design-patterns/flyweight), [*Proxy*](https://refactoring.guru/design-patterns/proxy) 66 | * **Behavioral**: [*Chain of Responsibility*](https://refactoring.guru/design-patterns/chain-of-responsibility), [*Command*](https://refactoring.guru/design-patterns/command), [*Interpreter*](https://en.wikipedia.org/wiki/Interpreter_pattern), [*Iterator*](https://refactoring.guru/design-patterns/iterator), [*Mediator*](https://refactoring.guru/design-patterns/mediator), [*Memento*](https://refactoring.guru/design-patterns/memento), [*Observer*](https://refactoring.guru/design-patterns/observer), [*State*](https://refactoring.guru/design-patterns/state), [*Strategy*](https://refactoring.guru/design-patterns/strategy), [*Template Method*](https://refactoring.guru/design-patterns/template-method), [*Visitor*](https://refactoring.guru/design-patterns/visitor) 67 | * [*Enterprise integration patterns*](https://en.wikipedia.org/wiki/Enterprise_Integration_Patterns), [*SOA patterns*](www.soapatterns.org). 68 | * [*3-tier architecture*](https://en.wikipedia.org/wiki/Multitier_architecture) (Presentation tier, Application tier, Data tier) 69 | * *3-layer architecture* (DAO (Repository), Business (Service) layer, Controller) 70 | * [*REST*](https://en.wikipedia.org/wiki/Representational_state_transfer) (Representational state transfer), [*RPC*](https://en.wikipedia.org/wiki/Remote_procedure_call) 71 | * [*Idempotent operation*](https://en.wikipedia.org/wiki/Idempotence) (The PUT and DELETE methods are referred to as idempotent, meaning that the operation will produce the same result no matter how many times it is repeated) 72 | * *Nullipotent operation* (GET method is a safe method (or nullipotent), meaning that calling it produces no side-effects) 73 | * [*Naked objects*](https://en.wikipedia.org/wiki/Naked_objects), [*Restful objects*](https://en.wikipedia.org/wiki/Restful_Objects). 74 | * Why do you need *web server* (tomcat, jetty)? 75 | * [*Inheritance*](https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)) vs [*Composition*](https://en.wikipedia.org/wiki/Object_composition) (Inheritance - is-a relationship, whether clients will want to use the subclass type as a superclass type. Composition - has-a or part-of relationship). 76 | * [*Multiple inheritance (diamond) problem*](https://en.wikipedia.org/wiki/Multiple_inheritance#The_diamond_problem) 77 | * Advantages of using *modules*. (reuse, decoupling, namespace) 78 | * Drawbacks of not using [*separation of concerns*](https://en.wikipedia.org/wiki/Separation_of_concerns) 79 | * Adding new features will take an order of magnitude longer 80 | * Impossible to optimize 81 | * Extremely difficult to test 82 | * Fixing and debugging can be a nightmare (fixing something in one place can lead to something else breaking that seems completely unrelated). 83 | * What is [*uniform access principle*](https://en.wikipedia.org/wiki/Uniform_access_principle)? (client code should not be affected by a decision to implement an attribute as a field or method) 84 | * [Conway's law](https://en.wikipedia.org/wiki/Conway%27s_law) (organizations which design systems ... are constrained to produce designs which are copies of the communication structures of these organizations) 85 | * [GRASP](https://en.wikipedia.org/wiki/GRASP_(object-oriented_design)) 86 | 87 | #### [[⬆]](#toc) Concurrency: 88 | * What is [*deadlock*](https://en.wikipedia.org/wiki/Deadlock), [*livelock*](https://en.wikipedia.org/wiki/Deadlock#Livelock)? (Deadlock is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does. A livelock is similar to a deadlock, except that the states of the processes involved in the livelock constantly change with regard to one another, none progressing.) 89 | * [*Deadlock Prevention*](https://www.geeksforgeeks.org/deadlock-prevention). (prevention, detection, avoidance (Mutex hierarchy), and recovery) 90 | * [*Deadlock Avoidance*](https://www.scaler.com/topics/operating-system/deadlock-avoidance-in-os/). (Deadlock is a situation that occurs in Operating System when any Process enters a waiting state because another waiting process is holding the demanded resource.) 91 | * What is [*starvation*](https://en.wikipedia.org/wiki/Starvation_(computer_science))? (a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work) 92 | * What is [*race condition*](https://en.wikipedia.org/wiki/Race_condition)? (Behavior of software system where the output is dependent on the sequence or timing of other uncontrollable events) 93 | * What is [*happens-before*](https://en.wikipedia.org/wiki/Happened-before) relation? 94 | * What is [*thread contention*](https://stackoverflow.com/questions/1970345/what-is-thread-contention)? (Contention is simply when two threads try to access either the same resource or related resources in such a way that at least one of the contending threads runs more slowly than it would if the other thread(s) were not running). Contention occurs when multiple threads try to acquire a lock at the same time 95 | * What is a [*thread-safe*](https://en.wikipedia.org/wiki/Thread_safety) function? (Can be safely invoked by multiple threads at the same time) 96 | * [*Publish/Subscribe*](https://en.wikipedia.org/wiki/Publish%E2%80%93subscribe_pattern) pattern 97 | * What is [*2-phase locking*](https://en.wikipedia.org/wiki/Two-phase_locking)? (Growing phase, shrinking phase. Guarantees serializablity for transactions, doesn't prevent deadlock). 98 | * What is the difference between *thread* and *process*? (Threads (of the same process) run in a shared memory space, while processes run in separate memory spaces) 99 | * What is [*false sharing*](https://en.wikipedia.org/wiki/False_sharing), [*cache pollution*](https://en.wikipedia.org/wiki/Cache_pollution), *cache miss*, [*thread affinity*](https://en.wikipedia.org/wiki/Processor_affinity), [*ABA-problem*](https://en.wikipedia.org/wiki/ABA_problem), [*speculative execution*](https://en.wikipedia.org/wiki/Speculative_execution)? 100 | * What is a 101 | * [*obstruction-free*](https://en.wikipedia.org/wiki/Non-blocking_algorithm#Obstruction-freedom) - if all other threads are paused, then any given thread will complete its operation in a bounded number of steps 102 | * [*lock-free*](https://en.wikipedia.org/wiki/Non-blocking_algorithm#Lock-freedom) - if multiple threads are operating on a data structure, then after a bounded number of steps one of them will complete its operation 103 | * [*wait-free*](https://en.wikipedia.org/wiki/Non-blocking_algorithm#Wait-freedom) - every thread operating on a data structure will complete its operation in a bounded number of steps, even if other threads are also operating on the data structure 104 | 105 | algorithm? 106 | * What is [*sequential consistency*](https://en.wikipedia.org/wiki/Sequential_consistency)? (The result of any execution is the same as if the operations of all the processors were executed in some sequential order, and the operations of each individual processor appear in this sequence in the order specified by its program). 107 | * What is a [*memory barrier*](https://en.wikipedia.org/wiki/Memory_barrier)? (A memory barrier, also known as a membar, memory fence or fence instruction, is a type of barrier instruction that causes a CPU or compiler to enforce an ordering constraint on memory operations issued before and after the barrier instruction) 108 | * Synchonization aids in Java 109 | * CountDownLatch 110 | * CyclicBarrier 111 | * Phaser 112 | * ReentrantLock 113 | * Exchanger 114 | * Semaphore 115 | * LinkedTransferQueue 116 | * What is *data race*? (When a program contains two conflicting accesses that are not ordered by a [happens-before](https://docs.oracle.com/javase/specs/jls/se12/html/jls-17.html#jls-17.4.5) relationship, it is said to contain a data race. Two accesses to (reads of or writes to) the same variable are said to be conflicting if at least one of the accesses is a write. But see [this](https://stackoverflow.com/questions/16615140/is-volatile-read-happens-before-volatile-write/16615355#16615355)) 117 | * Java [*memory model*](https://docs.oracle.com/javase/specs/jls/se12/html/jls-17.html#jls-17.4) 118 | * A program is correctly synchronized if and only if all sequentially consistent executions are free of data races 119 | * Correctly synchronized programs have sequentially consistent semantics. If a program is correctly synchronized, then all executions of the program will appear to be sequentially consistent 120 | * Causality requirement for incorrectly synchronized programs: [link](https://pdfs.semanticscholar.org/c132/11697f5c803221533a07bd6db839fa60b7b8.pdf) 121 | * What is *monitor* in Java? (Each object in Java is associated with a monitor, which a thread can lock or unlock) 122 | * What is *safe publication*? 123 | * What is *wait*/*notify*? 124 | * [*Amdahl's law*](https://en.wikipedia.org/wiki/Amdahl%27s_law)? (Speedup = 1 / (1 - p + p / n)) 125 | * [*Dining philosophers problem*](https://en.wikipedia.org/wiki/Dining_philosophers_problem) (Resource hierarchy (first take lower-indexed fork), arbitrator, communication (dirty/clean forks)). 126 | * [*Produces/consumer*](https://en.wikipedia.org/wiki/Producer%E2%80%93consumer_problem) problem. 127 | * [*Readers/writers*](https://en.wikipedia.org/wiki/Readers%E2%80%93writers_problem) problem. 128 | * [*Transactional memory*](https://en.wikipedia.org/wiki/Software_transactional_memory) 129 | * [*Coroutine*](https://en.wikipedia.org/wiki/Coroutine) 130 | 131 | #### [[⬆]](#toc) Java: 132 | * [*PhantomReference*](https://en.wikipedia.org/wiki/Phantom_reference), [*WeakReference*](https://en.wikipedia.org/wiki/Weak_reference), [*SoftReference*](https://en.wikipedia.org/wiki/Soft_reference), *finalize()*, *ReferenceQueue*. 133 | * How to correctly stop a thread? (Thread.interrupt()) 134 | * What is *Spring*? (Spring Framework is an application container for Java that supplies many useful features, such as Inversion of Control, Dependency Injection, abstract data access, transaction management, and more) 135 | * Spring is a framework for dependency injection: a design pattern that allows the developer to build very decoupled systems by injecting dependencies into classes. 136 | * It elegantly wraps Java libraries and makes then much easier to use in your application. 137 | * Included in the framework are implementations of commonly used patterns such as REST and MVC web framework which are predominately use by in web applications. 138 | * What is *Spring-Boot*? 139 | * What is *Hibernate* and JPA (Caches, lazy-loading)? 140 | * *Garbage collection*. (G1, Young/Old generation collectors combination examples: PS Scavenge/PS MarkSweep, Copy/MarkSweepCompact) 141 | * How to write *benchmarks*? ([jmh](http://openjdk.java.net/projects/code-tools/jmh/)) 142 | * What are Java 9 modularity? 143 | * What is OSGI? (Specification describes a modular system and a service platform for the Java programming language that implements a complete and dynamic component model. Each bundle has its own classpath. Dependency hell avoidance. META-INF/MANIFEST.MF contains OSGI-info) 144 | * Serializable / Externalizable 145 | * What is a *servlet* (versions of servlet api, Servlet 4.0)? 146 | * What is a *servlet filter*? How to implement *GZipFilter*? (ResponseWrapper) 147 | * What is *generics* and PECS (producer extends and consumer super)? 148 | * What is the difference between , \, and no generic type? [link1](http://stackoverflow.com/questions/8055389/whats-the-difference-between-and-extends-object-in-java-generics) [link2](http://stackoverflow.com/questions/678822/what-is-the-difference-between-and-object-in-java-generics) 149 | * Explain method signature for [Collections.max(...)](https://docs.oracle.com/javase/8/docs/api/java/util/Collections.html#max-java.util.Collection-), [Collections.fill(...)](https://docs.oracle.com/javase/8/docs/api/java/util/Collections.html#fill-java.util.List-T-), [Collections.copy(...)](https://docs.oracle.com/javase/8/docs/api/java/util/Collections.html#copy-java.util.List-java.util.List-), [Collections.sort(...)](https://docs.oracle.com/javase/8/docs/api/java/util/Collections.html#sort-java.util.List-java.util.Comparator-) 150 | * Why are arrays covariant but generics are invariant? [link](http://stackoverflow.com/questions/18666710/why-are-arrays-covariant-but-generics-are-invariant) 151 | * Major specs: JAX-RS, JAX-WS, JMS, JAXB, XSLT, XPATH, JNDI, JMX, JDBC, XML(SAX, DOM, StAX) 152 | * [*Performance Diagnostic Methodology*](https://dzone.com/articles/how-to-solve-your-java-performance-problems-part-2) 153 | 154 | #### [[⬆]](#toc) General Questions: 155 | * [*Polymorphism*](https://en.wikipedia.org/wiki/Polymorphism_(computer_science)) (Variable of type Shape could refer to an object of type Square, Circle... Ability of a function to handle objects of many types) 156 | * [*Encapsulation*](https://en.wikipedia.org/wiki/Encapsulation_(computer_programming)) (Packing of data and functions into a single component) 157 | * [*Virtual function*](https://en.wikipedia.org/wiki/Virtual_function) (Overridable function) 158 | * [*Virtual method table*](https://en.wikipedia.org/wiki/Virtual_method_table) 159 | * [*Dynamic binding*](https://en.wikipedia.org/wiki/Late_binding) (Actual method implementation invoked is determined at run time based on the class of the object, not the type of the variable or expression) 160 | * How does [*garbage collector*](https://en.wikipedia.org/wiki/Garbage_collection_(computer_science)) work? (Mark and sweep: mark: traverse object graph starting from root objects, sweep: garbage collect unmarked objects. Optimizations: young/old generations, incremental mark and sweep) 161 | * [*Tail recursion*](https://en.wikipedia.org/wiki/Tail_call) (A tail call is a subroutine call performed as the final action of a procedure) 162 | * [*Semantic versioning*](http://semver.org) 163 | 164 | #### [[⬆]](#toc) WEB: 165 | * WEB security vulnerabilities ([*XSS*](https://en.wikipedia.org/wiki/Cross-site_scripting), [*CSRF*](https://en.wikipedia.org/wiki/Cross-site_request_forgery), [*session fixation*](https://en.wikipedia.org/wiki/Session_fixation), [*SQL injection*](https://en.wikipedia.org/wiki/SQL_injection), [*man-in-the-middle*](https://en.wikipedia.org/wiki/Man-in-the-middle_attack), [*buffer overflow*](https://en.wikipedia.org/wiki/Buffer_overflow)) 166 | * *CSRF prevention* (CSRF-token) 167 | * What is [*JSONP*](https://en.wikipedia.org/wiki/JSONP), [*CORS*](https://en.wikipedia.org/wiki/Cross-origin_resource_sharing)? (A communication technique used in JavaScript programs running in web browsers to request data from a server in a different domain, something prohibited by typical web browsers because of the same-origin policy) 168 | * [*HTTPS*](https://en.wikipedia.org/wiki/HTTPS) negotiation steps. 169 | * What is HTTP Strict Transport Security ([*HSTS*](https://en.wikipedia.org/wiki/HTTP_Strict_Transport_Security))? (Prevents Man in the Middle attacks) 170 | * Browser-server communication methods: WebSocket, EventSource, Comet(Polling, Long-Polling, Streaming) 171 | * [*Character encoding*](https://en.wikipedia.org/wiki/Character_encoding) 172 | * What is [*role-based access control*](https://en.wikipedia.org/wiki/Role-based_access_control) and [*access control list*](https://en.wikipedia.org/wiki/Access_control_list)? 173 | * What is session and persistent cookies, sessionStorage and [localStorage](https://en.wikipedia.org/wiki/Web_storage#Local_and_session_storage)? 174 | * How to implement *remember-me*? (http://jaspan.com/improved_persistent_login_cookie_best_practice) 175 | * Authentication using cookies, [*JWT*](https://en.wikipedia.org/wiki/JSON_Web_Token) (JSON Web Tokens). 176 | 177 | #### [[⬆]](#toc) SQL: 178 | * *SQL join types* (inner join, left/right outer join, full outer join, [cross join](https://www.scaler.com/topics/cross-join-in-sql/)) 179 | ![Join types](https://habrastorage.org/files/7ff/b2c/3a2/7ffb2c3a25b74dcf9eec013282b9cfb4.png "Join types")) 180 | * *SQL normal forms* 181 | 1. The domain of each attribute contains only atomic values, and the value of each attribute contains only a single value from that domain 182 | 1. No non-prime attribute in the table is functionally dependent on a proper subset of any candidate key 183 | 1. Every non-prime attribute is non-transitively dependent on every candidate key in the table. BCNF.Every non-trivial functional dependency in the table is a dependency on a superkey.) 184 | * *Isolation levels* and Anomalies 185 | 186 | |Isolation_level\Anomaly|Lost_update (because of rollback)|Dirty_read|Non_repeatable_reads second_lost_update|Phantoms|Write_skew| 187 | |:---------------|:-------:|:-------:|:-------:|:-------:|:-------:| 188 | |Read Uncommitted|- |may occur|may occur|may occur|may occur| 189 | |Read Committed |- |- |may occur|may occur|may occur| 190 | |Repeatable Read |- |- |- |may occur|may occur| 191 | |Snapshot |- |- |- |- |may occur| 192 | |Serializable |- |- |- |- |- | 193 | 194 | #### [[⬆]](#toc) NoSQL: 195 | * Types of NoSQL databases? 196 | * Document Stores (MongoDB, Couchbase) 197 | * Key-Value Stores (Redis, Volgemort) 198 | * Column Stores (Cassandra) 199 | * Graph Stores (Neo4j, Giraph) 200 | 201 | #### [[⬆]](#toc) Transactions: 202 | * [*ACID*](https://en.wikipedia.org/wiki/ACID) 203 | * [*2-phase commit protocol*](https://en.wikipedia.org/wiki/Two-phase_commit_protocol) 204 | * [*3-phase commit protocol*](https://en.wikipedia.org/wiki/Three-phase_commit_protocol) 205 | * What is *pessimistic* / [*optimistic*](https://en.wikipedia.org/wiki/Optimistic_concurrency_control) locking? 206 | 207 | #### [[⬆]](#toc) Scalability: 208 | * Horizontal and vertical scaling. 209 | * How to scale database? (Data partitioning, sharding(vertical/horizontal), replication(master-slave, master-master)). 210 | * *Denormalization*. 211 | * What is *synchronous multimaster replication*? (Each server can accept write requests, and modified data is transmitted from the original server to every other server before each transaction commits) 212 | * What is *asynchronous multimaster replication*? (Each server works independently, and periodically communicates with the other servers to identify conflicting transactions. The conflicts can be resolved by users or conflict resolution rules) 213 | * When to use messaging queue? 214 | * MongoDB, Redis. 215 | * Hadoop basics. 216 | 217 | #### [[⬆]](#toc) Load balancing: 218 | * sticky/non-sticky sessions 219 | * *Sticky sessions* vs storing sessions in Redis. 220 | 221 | #### [[⬆]](#toc) Cloud computing: 222 | * What is [*cloud computing*](https://en.wikipedia.org/wiki/Cloud_computing)? (Cloud computing platform is a fully automated server platform that allows users to purchase, remotely create, dynamically scale, and administer system) 223 | * [*Amazon web services*](https://en.wikipedia.org/wiki/Amazon_Web_Services) 224 | * [*Google Cloud Platform*](https://en.wikipedia.org/wiki/Google_Cloud_Platform) 225 | * [*Microsoft Azure*](https://en.wikipedia.org/wiki/Microsoft_Azure) 226 | 227 | #### [[⬆]](#toc) Distributed: 228 | * [*Consensus*](https://en.wikipedia.org/wiki/Consensus_(computer_science)) 229 | * [*Raft*](https://en.wikipedia.org/wiki/Raft_(computer_science)) ([In Search of an Understandable Consensus Algorithm](https://raft.github.io/raft.pdf)) 230 | * [*Paxos*](https://en.wikipedia.org/wiki/Paxos_(computer_science)) 231 | * What is [*CAP theorem*](https://en.wikipedia.org/wiki/CAP_theorem)? [Illustrated proof](https://mwhittaker.github.io/blog/an_illustrated_proof_of_the_cap_theorem/). [CAP-FAQ](http://www.the-paper-trail.org/page/cap-faq) (It is impossible for a distributed computer system to simultaneously provide all three of the following guarantees: *consistency*, *availability*, *partition tolerance*). [Gilbert and Lynch's paper](https://users.ece.cmu.edu/~adrian/731-sp04/readings/GL-cap.pdf). ["Please stop calling databases CP or AP"](https://martin.kleppmann.com/2015/05/11/please-stop-calling-databases-cp-or-ap.html)). 232 | ![CAP theorem](http://guide.couchdb.org/draft/consistency/01.png "CAP theorem") 233 | * What is *map-reduce*? (Word count example) 234 | * *Sharding counters*. 235 | * Distributed software: 236 | * Distributed streaming platforms: **kafka** 237 | * Distributed key-value store: **zookeeper**, **etcd**, **Consul** 238 | * Map-reduce: **hadoop**, **spark** 239 | * Distributed file system: **hbase** 240 | * Cluster management: **kubernetes**, **docker-swarm**, **mesos** 241 | * [Herlihy’s consensus hierarchy](https://en.wikipedia.org/wiki/Read-modify-write). Every shared object can be assigned a consensus number, which is the maximum number of processes for which the object can solve wait-free consensus in an asynchronous system. 242 | ``` 243 | 1 Read-write registers 244 | 2 Test-and-set, swap, fetch-and-add, queue, stack 245 | ⋮ ⋮ 246 | ∞ Augmented queue, compare-and-swap, sticky byte 247 | ``` 248 | * [*Consistency models*](https://en.wikipedia.org/wiki/Consistency_model): 249 | * [*Sequential consistency*](https://en.wikipedia.org/wiki/Sequential_consistency) 250 | * [*Causal consistency*](https://en.wikipedia.org/wiki/Causal_consistency) 251 | * [*Eventual consistency*](https://en.wikipedia.org/wiki/Eventual_consistency) 252 | * [*Monotonic Read Consistency*](https://en.wikipedia.org/wiki/Consistency_model#Monotonic_Read_Consistency) 253 | * [*Monotonic Write Consistency*](https://en.wikipedia.org/wiki/Consistency_model#Monotonic_Write_Consistency) 254 | * [*Read-your-writes Consistency*](https://en.wikipedia.org/wiki/Consistency_model#Read-your-writes_Consistency) 255 | * [*Writes-follows-reads Consistency*](https://en.wikipedia.org/wiki/Consistency_model#Writes-follows-reads_Consistency) 256 | * *Consensus number*. Maximum number of threads for which objects of the class can solve consensus problem. 257 | * [*Logical clock*](https://en.wikipedia.org/wiki/Logical_clock) 258 | * [*Vector clock*](https://en.wikipedia.org/wiki/Vector_clock) 259 | 260 | #### [[⬆]](#toc) Cache: 261 | * What is *write-through* and *write-behind* caching? (write-through (synchronous), write-behind (asynchronous)) 262 | * HTTP cache options? 263 | 264 | #### [[⬆]](#toc) Networking: 265 | * OSI model (Physical, Data link, Network, Transport, Session, Presentation, Application) 266 | * Multithreading vs select 267 | * [*Switch*](https://en.wikipedia.org/wiki/Network_switch), [*hub*](https://en.wikipedia.org/wiki/Ethernet_hub), [*router*](https://en.wikipedia.org/wiki/Router_(computing)) 268 | * [*TCP congestion*](https://en.wikipedia.org/wiki/TCP_congestion_control) 269 | * *TCP back-pressure* 270 | 271 | #### [[⬆]](#toc) Operating system: 272 | * What is [*memory mapped*](https://en.wikipedia.org/wiki/Memory-mapped_file) file and its benefits? 273 | * *Interprocess communication* methods. (Pipes, Events, Mailboxes/Ports (can be implemented by using shared memory and semaphores), Direct Message Passing). 274 | * [*Virtual memory*](https://en.wikipedia.org/wiki/Virtual_memory) organization. 275 | * [*Process Scheduling Algorithm*](https://www.scaler.com/topics/operating-system/scheduling-algorithms-in-os/) 276 | 277 | #### [[⬆]](#toc) Compilers: 278 | * [*Recursive descent parser*](https://en.wikipedia.org/wiki/Recursive_descent_parser) 279 | * [*LL parser*](https://en.wikipedia.org/wiki/LL_parser) 280 | * [*LR parser*](https://en.wikipedia.org/wiki/LR_parser) 281 | * [*Context-free grammar*](https://en.wikipedia.org/wiki/Context-free_grammar) 282 | * [*Chomsky hierarchy*](https://en.wikipedia.org/wiki/Chomsky_hierarchy) 283 | 284 | #### [[⬆]](#toc) C++: 285 | * [*C++ standard*](http://eel.is/c++draft/) 286 | * [*Memory model*](https://en.cppreference.com/w/cpp/language/memory_model) 287 | * *Data race*. When an evaluation of an expression writes to a memory location and another evaluation reads or modifies the same memory location, the expressions are said to conflict. A program that has two conflicting evaluations has a data race unless 288 | * both evaluations execute on the same thread or in the same signal handler, or 289 | * both conflicting evaluations are atomic operations (see std::atomic), or 290 | * one of the conflicting evaluations happens-before another (see std::memory_order) 291 | 292 | If a data race occurs, the behavior of the program is undefined. 293 | * [*SFINAE*](https://en.cppreference.com/w/cpp/language/sfinae) [1](https://cpppatterns.com/patterns/function-template-sfinae.html) 294 | * [*PImpl*] https://en.cppreference.com/w/cpp/language/pimpl 295 | 296 | #### [[⬆]](#toc) Javascript: 297 | * this keyword 298 | * How *prototypes* work? 299 | * inheritance 300 | * differences between == and === (http://dorey.github.io/JavaScript-Equality-Table/) 301 | * closures 302 | * recursion 303 | * What is *MVC*, *MVP*, *MVVM*? 304 | * What is *promise*? 305 | * What is event *bubbling* and *capturing*? (target.addEventListener(type, listener[, useCapture])) 306 | * What is *AMD*(Asynchronous Module Design) and *CommonJS*? 307 | * What is *jQuery*? 308 | 309 | #### [[⬆]](#toc) Python: 310 | * [Slice notation](https://stackoverflow.com/questions/509211/understanding-slice-notation/509295#509295) 311 | 312 | #### [[⬆]](#toc) Go: 313 | * [Go interview questions](https://www.fullstack.cafe/blog/go-interview-questions) 314 | * [Language Specification](https://golang.org/ref/spec) 315 | * [Memory Model](https://golang.org/ref/mem) 316 | 317 | #### [[⬆]](#toc) Codewriting: 318 | * Implement binary search 319 | ```java 320 | int binarySearch(int[] a, int fromInclusive, int toExclusive, int key) { 321 | int low = fromInclusive; 322 | int high = toExclusive - 1; 323 | while (low <= high) { 324 | int mid = (low + high) >>> 1; 325 | int midVal = a[mid]; 326 | if (midVal < key) 327 | low = mid + 1; 328 | else if (midVal > key) 329 | high = mid - 1; 330 | else 331 | return mid; // key found 332 | } 333 | return -(low + 1); // key not found 334 | } 335 | ``` 336 | * Implement quick sort 337 | ```java 338 | void qSort(int[] a, int fromInclusive, int toInclusive) { 339 | int i = fromInclusive; 340 | int j = toInclusive; 341 | if (i >= j) return; 342 | int separator = a[i + random.nextInt(j - i + 1)]; 343 | do { 344 | while (a[i] < separator) ++i; 345 | while (a[j] > separator) --j; 346 | if (i > j) break; 347 | int t = a[i]; 348 | a[i] = a[j]; 349 | a[j] = t; 350 | ++i; 351 | --j; 352 | } while (i <= j); 353 | qSort(a, fromInclusive, j); 354 | qSort(a, i, toInclusive); 355 | } 356 | ``` 357 | 358 | #### [[⬆]](#toc) Functional programming: 359 | * [*Referential transparency*](https://en.wikipedia.org/wiki/Referential_transparency) 360 | * What is [*Monad*](https://en.wikipedia.org/wiki/Monad_(functional_programming))? 361 | 362 | #### [[⬆]](#toc) Reactive programming: 363 | * [*The Reactive Manifesto*](http://www.reactivemanifesto.org) (responsive, resilient, elastic, message driven) 364 | * [Reactive extensions](http://reactivex.io) 365 | * What is *asynchronous* and *non-blocking*? [link](https://www.linkedin.com/pulse/java-servlets-asynchronous-non-blocking-aliaksandr-liakh) 366 | 367 | #### [[⬆]](#toc) Git: 368 | * *Git* workflow? (Master: production-ready state; Develop: latest delivered development changes for the next release; Feature Branches; Release Branches; Hotfixes) ![Git workflow](http://nvie.com/img/git-model@2x.png "Git workflow") http://nvie.com/posts/a-successful-git-branching-model/ 369 | * What is a rebase? 370 | 371 | #### [[⬆]](#toc) DevOps: 372 | * What is *Blue-green Deployment*, *Canary release*, *A/B testing*? [link](https://www.javacodegeeks.com/2016/02/blue-green-deployment.html) 373 | * What is *Docker*? 374 | 375 | #### [[⬆]](#toc) QA: 376 | * What is *unit test*? (A test that purely tests a single unit of functionality) 377 | * What is *component test*? 378 | * What is *integration test*? (Examine several parts of a system to make sure that when integrated, these parts behave as expected) 379 | * What is *user acceptance test*? BDD? 380 | * Unit tests advantages? 381 | * Types of tests: acceptance testing, functional testing, smoke testing, regression testing, unit testing, integration testing, stress testing, (Load, Performance, Sanity, Stability, Security, Feature, Progression, Installation, Business). 382 | * Differences between stub and mock? (A stub is a test double with preprogrammed behavior. Mocks are stubs with preprogrammed expectations) 383 | * Selenium tests and webdriver. 384 | * How to test multithreading code? 385 | * What is *Consumer Driven Contract*? [link](https://cloud.spring.io/spring-cloud-contract/spring-cloud-contract.html) 386 | * [Types of tests](https://stackify.com/ultimate-guide-performance-testing-and-software-testing) 387 | 388 | #### [[⬆]](#toc) Agile: 389 | * What is Agile? (http://agilemanifesto.org/principles.html) 390 | * Individuals and interactions over Processes and tools 391 | * Working software over Comprehensive documentation 392 | * Customer collaboration over Contract negotiation 393 | * Responding to change over Following a plan 394 | * What is Scrum? (Roles: product owner, development team, scrum master. Events: sprint) 395 | * What are the differences between Scrum and Waterfall? ( http://www.leanagiletraining.com/agile/waterfall-versus-scrum-how-do-they-compare/) 396 | * What is XP? () 397 | * What is Kanban? 398 | * What is Lean development? 399 | 400 | #### [[⬆]](#toc) Algorithms: 401 | * What Ο(n), Ω(n), Θ(n)? 402 | * What is NP, NP-completeness, NP-hardness with examples? 403 | 404 | #### [[⬆]](#toc) Other: 405 | * How to find memory leak. (Memory snapshot diff). 406 | * Profiling: sampling and instrumentation. 407 | * Regular expressions. (Examples) 408 | * What are your goals to work in our company? (3 categories: professional, financial, social) 409 | * What is *virtualization*? 410 | * What is total/partial order? 411 | * How to work with legacy code? (http://programmers.stackexchange.com/a/122024) 412 | 413 | #### [[⬆]](#toc) Machine learning: 414 | * [*Bayes' theorem*](https://en.wikipedia.org/wiki/Bayes%27_theorem): 415 | 416 | ![equation](http://latex.codecogs.com/svg.latex?\inline&space;\fn_cs&space;P(A|B)&space;=&space;\dfrac{P(B|A)\times&space;P(A)}{P(B)},P(B)&space;=&space;\sum\limits_{i}{P(Ai)\times&space;P(B|Ai)}) 417 | * [*Confidence interval*](https://en.wikipedia.org/wiki/Confidence_interval) 418 | * [*p-value*](https://en.wikipedia.org/wiki/P-value) 419 | * [*Overfitting*](https://en.wikipedia.org/wiki/Overfitting) 420 | * [*Bias–variance tradeoff*](https://en.wikipedia.org/wiki/Bias–variance_tradeoff) 421 | * [*Backpropagation*](https://en.wikipedia.org/wiki/Backpropagation) 422 | * [*Reinforcement learning*](https://en.wikipedia.org/wiki/Reinforcement_learning) 423 | * [*Curse of dimensionality*](https://en.wikipedia.org/wiki/Curse_of_dimensionality) 424 | * [*Cross-validation*](https://en.wikipedia.org/wiki/Cross-validation_(statistics)) 425 | * [*Bag-of-words*](https://en.wikipedia.org/wiki/Bag-of-words_model), [*Stop words*](https://en.wikipedia.org/wiki/Stop_words), [*n-gram*](https://en.wikipedia.org/wiki/N-gram), [*tf–idf*](https://en.wikipedia.org/wiki/Tf%E2%80%93idf), [*Latent semantic analysis*](https://en.wikipedia.org/wiki/Latent_semantic_analysis) 426 | * [*Linear regression*](https://en.wikipedia.org/wiki/Linear_regression) 427 | * [*Logistic regression*](https://en.wikipedia.org/wiki/Logistic_regression) 428 | * [*Naive Bayes classifier*](https://en.wikipedia.org/wiki/Naive_Bayes_classifier) 429 | * [*Support vector machine*](https://en.wikipedia.org/wiki/Support_vector_machine) 430 | * [*Principal component analysis*](https://en.wikipedia.org/wiki/Principal_component_analysis) 431 | * [*Deep learning*](https://en.wikipedia.org/wiki/Deep_learning) 432 | 433 | #### [[⬆]](#toc) Big Data: 434 | * [*Lambda architecture*](https://en.wikipedia.org/wiki/Lambda_architecture) 435 | * [*HyperLogLog*](https://en.wikipedia.org/wiki/HyperLogLog) 436 | * [*Event sourcing*](http://microservices.io/patterns/data/event-sourcing.html) 437 | 438 | #### [[⬆]](#toc) Image processing: 439 | 440 | #### [[⬆]](#toc) Cryptography: 441 | * [*Public-key cryptography*](https://en.wikipedia.org/wiki/Public-key_cryptography) 442 | * [*Public key certificate*](https://en.wikipedia.org/wiki/Public_key_certificate) 443 | * [*Blockchain*](https://en.wikipedia.org/wiki/Blockchain) 444 | * [*Proof-of-work system*](https://en.wikipedia.org/wiki/Proof-of-work_system) 445 | * [*Secret sharing*](https://en.wikipedia.org/wiki/Secret_sharing) 446 | * [*RSA*](https://en.wikipedia.org/wiki/RSA_(cryptosystem)) 447 | ``` 448 | select 2 primes: p,q 449 | n = p*q 450 | phi(n) = (p-1)*(q-1) 451 | select 1Security: 460 | * What is *OpenID and OAuth2.0 and OpenID Connect*? 461 | * Four main actors in an OAuth system (clients, resource owners, authorization servers, and protected resources) 462 | * What is *access_token, refresh_token, SAML token, JWT token*? 463 | * *Sticky session vs Session Replication*. 464 | * What is hash [*salt*](https://en.wikipedia.org/wiki/Salt_(cryptography))? 465 | * What is *Federated Authentication* ? 466 | * What is *CSP* and *SRI hash* ? 467 | * What is *Clickjacking* and *Cursorjacking* ? How to prevent it ? 468 | 469 | #### [[⬆]](#toc) Android: 470 | 471 | #### [[⬆]](#toc) Books: 472 | ##### C++ programming 473 | * [The C++ Programming Language, 4th Edition](https://www.amazon.com/C-Programming-Language-4th/dp/0321563840) 474 | * [Effective Modern C++: 42 Specific Ways to Improve Your Use of C++11 and C++14](https://www.amazon.com/Effective-Modern-Specific-Ways-Improve/dp/1491903996) 475 | ##### Java programming 476 | * [Effective Java (3rd Edition)](https://www.amazon.com/Effective-Java-3rd-Joshua-Bloch/dp/0134685997) 477 | ##### Algorithms 478 | * [Introduction to Algorithms, 4th Edition](https://www.amazon.ca/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X) 479 | * [The Art of Computer Programming](https://www.amazon.co.uk/Art-Computer-Programming-Volumes-1-4a/dp/0321751043) 480 | * [Network Flows: Theory, Algorithms, and Applications](https://www.amazon.com/Network-Flows-Theory-Algorithms-Applications/dp/013617549X) 481 | * [Computational Geometry: Algorithms and Applications](https://www.amazon.com/Computational-Geometry-Applications-Mark-Berg/dp/3540779736) 482 | * [Algorithms on Strings, Trees, and Sequences](https://www.amazon.com/Algorithms-Strings-Trees-Sequences-Computational/dp/0521585198) 483 | * [Compilers: Principles, Techniques, and Tools](https://www.amazon.com/Compilers-Principles-Techniques-Tools-2nd/dp/0321486811) 484 | * [How to Solve It: Modern Heuristics](https://www.amazon.com/How-Solve-Heuristics-Zbigniew-Michalewicz/dp/3540224947) 485 | * [Scheduling Algorithms](https://www.amazon.com/Scheduling-Algorithms-Peter-Brucker/dp/354069515X) 486 | ##### Concurrent programming 487 | * [Java Concurrency in Practice](https://www.amazon.com/Java-Concurrency-Practice-Brian-Goetz/dp/0321349601) 488 | * [C++ Concurrency in Action, 2nd Edition](https://www.amazon.com/C-Concurrency-Action-Anthony-Williams/dp/1617294691) 489 | * [The Art of Multiprocessor Programming 2nd Edition](https://www.amazon.com/Art-Multiprocessor-Programming-Maurice-Herlihy/dp/0124159508) 490 | ##### Statistics 491 | * [Introductory Statistics](https://www.amazon.com/Introductory-Statistics-10th-Neil-Weiss/dp/0321989171) 492 | * [All of Statistics: A Concise Course in Statistical Inference](https://www.amazon.com/All-Statistics-Statistical-Inference-Springer/dp/1441923225) 493 | ##### Machine Learning 494 | * [Applied Machine Learning](https://www.amazon.com/Applied-Machine-Learning-David-Forsyth/dp/3030181138) 495 | * [Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems 2nd Edition](https://www.amazon.com/Hands-Machine-Learning-Scikit-Learn-TensorFlow/dp/1492032646) 496 | * [The Elements of Statistical Learning: Data Mining, Inference, and Prediction](https://web.stanford.edu/~hastie/Papers/ESLII.pdf) 497 | * [Machine Learning: a Concise Introduction](https://www.amazon.com/Machine-Learning-Introduction-Probability-Statistics/dp/1119439191) 498 | * [Learning From Data](https://www.amazon.com/Learning-Data-Yaser-S-Abu-Mostafa/dp/1600490069) 499 | * [Generative Deep Learning: Teaching Machines to Paint, Write, Compose, and Play](https://www.amazon.com/Generative-Deep-Learning-Teaching-Machines/dp/1492041947) 500 | * [Foundations of Machine Learning, second edition](https://www.amazon.com/Foundations-Machine-Learning-Mehryar-Mohri/dp/0262039400) 501 | ##### Digital Signal Processing 502 | * [Digital Signal Processing: A Practical Approach, 2nd Edition](https://www.amazon.com/Digital-Signal-Processing-Practical-Approach/dp/0201596199) 503 | ##### Digital Image Processing 504 | * [Digital Image Processing, 4th Edition](https://www.amazon.com/Digital-Image-Processing-Rafael-Gonzalez/dp/0133356728) 505 | * [The Image Processing Handbook, 7th Edition](https://www.amazon.com/Image-Processing-Handbook-John-Russ/dp/1138747491) 506 | ##### Other 507 | * [Software Engineering at Google: Lessons Learned from Programming Over Time](https://www.amazon.com/Software-Engineering-Google-Lessons-Programming/dp/1492082791) 508 | * [Site Reliability Engineering: How Google Runs Production Systems](https://www.amazon.com/Site-Reliability-Engineering-Production-Systems/dp/149192912X) 509 | * [Clean Code: A Handbook of Agile Software Craftsmanship](https://www.amazon.com/Clean-Code-Handbook-Software-Craftsmanship/dp/0132350882) 510 | * [Design Patterns: Elements of Reusable Object-Oriented Software](https://www.amazon.com/Design-Patterns-Elements-Reusable-Object-Oriented/dp/0201633612) 511 | * [Big Data: Principles and best practices of scalable realtime data systems](https://www.amazon.com/Big-Data-Principles-practices-scalable/dp/1617290343) 512 | * [Designing Data-Intensive Applications](https://www.amazon.com/Designing-Data-Intensive-Applications-Reliable-Maintainable/dp/1449373321) 513 | * [Kafka: The Definitive Guide](https://www.amazon.com/Kafka-Definitive-Real-Time-Stream-Processing/dp/1491936169) 514 | * [Cassandra: The Definitive Guide](https://www.amazon.com/Cassandra-Definitive-Guide-Distributed-Scale/dp/1491933666) 515 | * [The Linux Programming Interface](https://www.amazon.com/Linux-Programming-Interface-System-Handbook/dp/1593272200) 516 | * [Hibernate in Action](https://www.amazon.com/Hibernate-Action-Christian-Bauer/dp/193239415X) 517 | * [The Garbage Collection Handbook](https://www.amazon.com/Garbage-Collection-Handbook-Management-Algorithms/dp/1420082795) 518 | * [Pro Git](https://git-scm.com/book/en/v2) 519 | * [Learning JavaScript](https://www.amazon.com/Learning-JavaScript-Essentials-Application-Development/dp/1491914912) 520 | * [Release It!: Design and Deploy Production-Ready Software](https://www.amazon.com/Release-Design-Deploy-Production-Ready-Software/dp/1680502395) 521 | * [Reactive Programming with RxJava](https://www.amazon.com/Reactive-Programming-RxJava-Asynchronous-Applications/dp/1491931655) 522 | * [Gödel, Escher, Bach: An Eternal Golden Braid](https://www.amazon.com/G%C3%B6del-Escher-Bach-Eternal-Golden/dp/0465026567) 523 | -------------------------------------------------------------------------------- /UNLICENSE: -------------------------------------------------------------------------------- 1 | This is free and unencumbered software released into the public domain. 2 | 3 | Anyone is free to copy, modify, publish, use, compile, sell, or 4 | distribute this software, either in source code form or as a compiled 5 | binary, for any purpose, commercial or non-commercial, and by any 6 | means. 7 | 8 | In jurisdictions that recognize copyright laws, the author or authors 9 | of this software dedicate any and all copyright interest in the 10 | software to the public domain. We make this dedication for the benefit 11 | of the public at large and to the detriment of our heirs and 12 | successors. We intend this dedication to be an overt act of 13 | relinquishment in perpetuity of all present and future rights to this 14 | software under copyright law. 15 | 16 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 17 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 18 | MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 19 | IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR 20 | OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, 21 | ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR 22 | OTHER DEALINGS IN THE SOFTWARE. 23 | 24 | For more information, please refer to 25 | --------------------------------------------------------------------------------