/blog/images/avatar-icon.png

Python to Read Large Excel/CSV File Faster

Img Source: https://unsplash.com/photos/Wpnoqo2plFA Read a CSV with PyArrow In Pandas 1.4, released in January 2022, there is a new backend for CSV reading, relying on the Arrow library’s CSV parser. It’s still marked as experimental, and it doesn’t support all the features of the default parser—but it is faster.1 CSV parser Elapsed time CPU time (user+sys) Default C 13.2 seconds 13.2 seconds PyArrow 2.7 seconds 6.5 seconds 1 2 3 import pandas as pd pd.

(MSCI) ESG Rating Scraper - Example Inside Using Fund and ISIN by Selenium and The API

What is ESG ESG stands for environmental, social and governance. These are non-financial factors investors use to measure an investment or company’s sustainability. Environmental factors look at the conservation of the natural world, social factors examine how a company treats people both inside and outside the company and governance factors consider how a company is run. ESG Investing ESG investing is a form of sustainable investing that considers environmental, social and governance factors to judge an investment’s financial returns and its overall impact.

Sliding Window - LeetCode (Medium) Contest - Maximum Sum of Distinct Subarrays With Length K

Weekly Contest 318 This problem ate most of my time and not until a week after the contest did I realize my code wasn’t correct… So I lost 4 points which means I’ve only solved only 1 question in that weekly contest. Let’s dive right into this tricky but quite frankly easy problem. Maximum Sum of Distinct Subarrays With Length K Maximum Sum of Distinct Subarrays With Length K Maximum Sum of Distinct Subarrays With Length K - LeetCode Contest

Heap Queue (heapq) in Python | LeetCode Example Last Stone Weight

img source: https://unsplash.com/photos/n0CTq0rroso Heap Heap data structure is mainly used to represent a priority queue. In Python, it is available using the “heapq” module. The property of this data structure in Python is that each time the smallest heap element is popped(min-heap). Whenever elements are pushed or popped, heap structure is maintained. The heap[0] element also returns the smallest element each time. Let’s see various Operations on the heap in Python.

Mock Technology Consulting Case Interview (Case Study): Architecture Strategy

Tech Consulting from https://unsplash.com/photos/n8Qb1ZAkK88 Case Architecture Strategy: Federal Finance Agency Practice Case from Deloitte and Christine Wong1. Architecture Strategy: Federal Finance Agency Our client is a small division of a large Federal Finance Agency that is in charge of administering and enforcing economic and trade sanctions determined by US foreign policy and national security goals. BUSINESS SITUATION The agency’s office uses a number of software application systems to track and manage cases, applications, transactions, and other financial documents.

Topological Sorting | LeetCode Course Schedule I/II | Graph, DFS, BFS

What’s Topological Sorting Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.1 Note: Topological Sorting for a graph is not possible if the graph is not a DAG. (i.e. If there is a loop/cycle in the Graph) Below is the implementation of the above approach: Examples Course Schedule II LeetCode 210.