Protocol Buffers (a.k.a, protobuf) are a mechanism for serializing structured data introduced by Google. It’s language-neutral and platform-neutral. It also provides runtime supports for several programming languages. Here we focus on how to use protocol buffers with Go.
When given a SQL query, the first job of query processing is to apply lexical
and syntax analysis.
Lexical analysis (or tokenization) converts the query statement into a sequence
of tokens.
Syntax analysis (or parsing) analyzes symbols conforming certain rules.
goyacc is the Go version of yacc, which helps to do syntax analysis easily.
Go is simple. For example, it has 25 keywords, which is less than C (37) and C++ (84). Let’s start using Go with a simple “Hello, World!” program.
React is an enhancement to the UI management. Traditional UI operations (DOM APIs) will need to work on too many details, whereas React applies a global refreshing to facilitate their management. React also helps to scale and maintain the application program status which can be distributed everywhere.
As its name suggests, GraphQL is a query language for APIs. It can be used to define data with fields and types, and then provide functions associated with each of them. Compared to REST (Representational State Transfer), which fetches one resource at a time identified by a URL, each GraphQL request can return multiple resources identified by fields and types.
JavaScript runs on the client side such as browsers. It enables dynamic interactions for web pages. With the support of Node.js, JavaScript can also run on the server or desktop side, which makes it a programming language crossing both front and back ends.
TypeScript is a superset of JavaScript. It basically enables the capability of building large applications with JavaScript by enhancing it with additional features/supports such as types, interfaces, and enumeration.
A palindrome is a word, phrase, or other sequence that reads the same backward as forward. One interesting example is “A man, a plan, a canal, Panama!”. Such property of palindromes leads to interesting problems and solutions.
A majority element over a collection is the one that occurs more than half of all the elements in the collection.
Combinations and permutations are two common operations applied to a collection of elements. There are also formulas to calculate the number of possible combinations or permutations, which sometimes can be leveraged to directly get answers which otherwise may require going through every possible case.