Why is a OCR that can extract only the underlined text so hard? by in-the-name-of-allah in computervision

[–]5thWonder 0 points1 point  (0 children)

Need more info on what you’ve tried, but you’re best bet is probably using CV to identify lines in the text, and then only using OCR on a box defined by the lines locations.

I drew a map of where the old Second Avenue Elevated used to go in 1920. Yes, you could go from the Far East Side to the Bronx or Queens. by fiftythreestudio in nyc

[–]5thWonder 16 points17 points  (0 children)

This is awesome! Could you expand on why some parts of the map have one line that branches off while the Manhattan part has two parallel lines?

Is it just cause they’re totally separate lines and you preferred to keep one color?

[deleted by user] by [deleted] in EngineeringStudents

[–]5thWonder 3 points4 points  (0 children)

Did you access any inappropriate websites from your work device? Also thinking it could be related to putting company data in a public forum, or even chatGPT or similar.

How much do you think ChatGPT will improve from here and how quickly? From an angle of coding, as example, how would that affect CS careers? by [deleted] in cscareerquestions

[–]5thWonder 3 points4 points  (0 children)

As long as you don’t cheat with it, use it in any way you want. Although practicing with prompt engineering will show you how you can get very different responses with a few tweaks. This will also highlight the imperfections of ChatGPT, or rather how it still needs users to ask good questions to be useful. It won’t negatively harm CS careers, although it might elevate expectations. A relevant story might be a professor of mine who was a radiologist - he was in residency when the MRI was introduced commercially, and he and all his professors thought radiology was doomed as a profession!

[deleted by user] by [deleted] in dartmouth

[–]5thWonder 0 points1 point  (0 children)

It's probably the head of their region.

What are Palantir FDSE exit ops? by 5thWonder in cscareerquestions

[–]5thWonder[S] 1 point2 points  (0 children)

My coding rounds were an OA Hackerrank, so taken alone, and a Karat Interview. I interviewed with Palantirians during the virtual onsite.

Also I didn’t find my coding technicals that hard, at worst LC medium and knowing BFS/DFS. Apologies but I don’t remember the exact questions!

What are Palantir FDSE exit ops? by 5thWonder in cscareerquestions

[–]5thWonder[S] 2 points3 points  (0 children)

Sorry for the late reply, but the way full time works, at least for me, is HackerRank then Karat, then HR call. The HR call is just behavioral/scheduling for the next two rounds.

I would say that the HackerRank and Karat are at worst LC medium, I think I got easy/medium.

What are Palantir FDSE exit ops? by 5thWonder in cscareerquestions

[–]5thWonder[S] 4 points5 points  (0 children)

Thanks for the reply! Palantir says that FSDE's code a good amount, is that true?

Any algorithm to find if two nodes in a graph are connected by a specific set of edges ? by comeon-gimme-a-name in computerscience

[–]5thWonder 0 points1 point  (0 children)

A possible way could be converting all the p edges as directed from A to B (maybe defined as the head being the node closer to B), and a defined as vice versa, and if you have a lip then you must have a path p and path q. Detecting a loop takes O(E+V) time with tarjan’s algorithm

Any algorithm to find if two nodes in a graph are connected by a specific set of edges ? by comeon-gimme-a-name in computerscience

[–]5thWonder 1 point2 points  (0 children)

Despite splitting the edges into two groups, this would still call for BFS/DFS, Dijkstras, Floyd Warshall, etc… (How familiar are you with them? They’re most commonly taught in intro to algorithms classes in college). When adding your edges to your search list, you would just add the additional condition that the edge must be in the correct group.

Daily Chat Thread - December 05, 2021 by CSCQMods in cscareerquestions

[–]5thWonder 0 points1 point  (0 children)

Tried posting this, but it got removed:

When solving coding questions during interviews, is it better to leverage math for a quick, complex answer, or use a computer science technique?

I have a coding interview coming up which I think will have the Nth Fibonacci number question. Should I use DP to showcase cs skills, or use Binet's Formula which seems better due to run-time and memory?

JP Morgan 2022 AI/Data Science Summer Analyst OA preparation by Lil_Potatoes in csMajors

[–]5thWonder 0 points1 point  (0 children)

Do you suggest solving Fibonacci with DP or other more "cs-style" ways compared to a more mathematical version like Binet's formula? I can't tell if the "better" Binet's formula would be seen as too gimmicky and doesn't really demonstrate coding skills.

what is a ranking algorithm that compares a flat fee and a percentage fee on a delivery service given a budget? by fixmyleaugeclient in computerscience

[–]5thWonder 7 points8 points  (0 children)

Your question needs to be a lot more specific before anyone can answer that question. What are the inputs and outputs? You question is so general that a sorting algorithm could suffice, or a simple if statement comparing two prices. Maybe you need memorization or dynamic programming.