Sign up to save your podcastsEmail addressPasswordRegisterOrContinue with GoogleAlready have an account? Log in here.
Software Engineering Best Practices, System Design, High Scale, Algorithms, Math, Programming Languages, Statistics, Machine Learning, Databases, Front Ends, Frameworks, Low Level Machine Structure, P... more
FAQs about Programmers Quickie:How many episodes does Programmers Quickie have?The podcast currently has 361 episodes available.
July 05, 2020Vim CheatSheetVim is an extremely powerful editor. Not only you can use it from command line but also from IntelliJ, Visual Studio Code, and for actual command line manipulation....more11minPlay
July 01, 2020DateTime and ISO 8601ISO 8601 Data elements and interchange formats – Information interchange – Representation of dates and times is an international standard covering the exchange of date- and time-related data. It was issued by the International Organization for Standardization and was first published in 198...more14minPlay
June 27, 2020Vim for developers - Let's TalkShould you invest time in using Vim for software development? What should you do with Vim? How do you search for files? What about syntax coloring? Loading files from history, autocomplete and more. As it turns out you don't need plugins for all this....more17minPlay
June 24, 2020Google's Monorepo Research PaperWhy Google Stores Billions of lines of code in a single repository - this is a brief summary of a research paper published by google....more24minPlay
June 09, 2020Research Paper Review - Auto Distributed Systems Code CorrectorIn a paper named Fixed it for you. Protocol repair using lineage graphs it is described how machine can autocorrect programming error....more17minPlay
June 05, 2020Dijkstra Vs Bellman Ford AlgorithmThe Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph....more16minPlay
May 29, 2020Edsger Dijkstra's Shortest Path AlgorithmDijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants...more15minPlay
May 24, 2020Linux Performance for Software DevelopersAs developers, we sometimes want to check the performance of our server, we are not system administrators so we do not run these commands on a daily basis but here is a quick overview of it....more17minPlay
May 22, 2020Selection SortIn computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort...more11minPlay
May 20, 2020Containers - cgroups, namespaces, hypervisor, vm'scgroups is a Linux kernel feature that limits, accounts for, and isolates the resource usage of a collection of processes. Engineers at Google started the work on this feature in 2006 under the name "process containers"....more14minPlay
FAQs about Programmers Quickie:How many episodes does Programmers Quickie have?The podcast currently has 361 episodes available.