... XML schemas to maintain. Resource based. Simple to understand. Only 4 HTTP Verbs (GET, POST, PUT, DELETE) and the URI resource path is needed to understand what the general behavior will be.
0 CommentsDon'ts Don'ts Don't put raw passwords in the database Don't put encoded passwords in the database (i.e. Base64) Don't put simple hashed passwords in the database (i.
0 CommentsJVM Java is a statically typed language that is compiled into bytecode (i.e. with javac) and understood only by the JVM, or Java Virtual Machine. The JVM is an interpreter that reads the Java bytecode and translates them into machine code before execution.
0 CommentsCheat Engine (CE) is an open source memory scanner/hex editor/debugger that works for Windows applications. Another way to put it is that CE is used to explore the memory that is dynamically allocated (by Windows) in games.
0 CommentsContext Depth-first search (DFS) is a common searching algorithm for graphs, alongside Breadth-first search (BFS). DFS is useful for finding ways to solve mazes. It is also a vital ingredient for topological sorting.
0 CommentsThere are a few ways to search for a string in Python (3+): String operations str.find(sub[, start[, end]])] "shadow walker".find('w') => 5 This gives you the index of the first match. While the index might be nice to have, do remember that strings are immutable.
0 CommentsWhat is Virtual Memory? Virtual Memory is best described as a swap file on your hard disk that holds memory information for your running applications. Memory is structured and managed in two different ways; paging and segmentation.
0 CommentsThere are already so many articles and Quora/Reddit/Blind posts out there on how to interview prep to get into big companies. So instead of covering that in detail, I want to focus more on the angle of common misconceptions.
0 CommentsHOC React HOC (Higher Order Components) are basically a function that takes a component and returns a new component. props are passed in as an argument to this function. React HOCs are generally used for: Components that share a common layout Components that need to be connected to some middleware (i.
0 CommentsA set data structure uses a hashing function to store values and to verify if a value exists. Bloom filters are similar in that it uses multiple hashing functions to store values and to verify if a value exists.
0 CommentsNotes Apache isn't that great at serving static content for a large number of requests vs. NetScaler load balancing Python is fast enough There are many other bottlenecks such as waiting for calls from DB, cache, etc.
0 CommentsOpen-ended Mutual Fund The fund manager registers their fund to the SEC The fund manager markets the funds to bring in more investors/shareholders Shareholders can buy and sell shares directly with the fund manager The fund manager takes 1% of total earnings as management fees * The fund manager has to keep some money on-hand if the shareholders want to sell their shares back (i.
0 CommentsThis is an array/list trick that saves about O(n) in space complexity by taking advantage of a given array with integers representing indices. For this example problem, suppose that we want to apply some permutation P to an array A.
0 CommentsProblem Detect a cycle in a linked list and return the node that represents the start of the cycle. Input head: a pointer to the linked list Approach First, lets concentrate on how to detect a cycle in a linked list.
0 Comments