This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function extractJobs(linkedInResponse) { | |
const jobs = []; | |
const jobElements = linkedInResponse?.data?.data?.searchDashClustersByAll?.elements?.[0]?.items || []; | |
const jobDetails = linkedInResponse?.included || []; | |
jobElements.forEach(({ item }) => { | |
const entityUrn = item?.["*entityResult"]; | |
if (!entityUrn) return; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Given n, i.e. total number of nodes in an undirected graph numbered | |
from 1 to n and an integer e, i.e. total number of edges in the | |
graph. Calculate the total number of connected components in the graph. | |
A connected component is a set of vertices in a graph that are linked | |
to each other by paths. | |
O(E^2 log E) | |
mine un-sorted: 15421ms | |
mine un-sorted and Set nodes: 41ms |
OlderNewer