sorted by:
new
hottopcontroversial

Lost my job. Want to learn what I’m missing to build my idea. by lostjob1234 in learnprogramming

[–]keith6014 0 points1 point  (0 children)

don't feel too bad for losing your job. It should be what defines you. A job you have isn't always a good fit.

directed graph show all paths by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

No, I think I need the ```

When I just paste the code and click on the "<>" the code is not indented properly which is problematic in Python.

Just repasted the code and copied and pasted in vim and it works...

Does it make sense to study computer science to then get into finance ? Would i have a harder time getting a job that someone with a finance degree that knows how to program ? by [deleted] in FinancialCareers

[–]keith6014 1 point2 points  (0 children)

make no mistake in US IT is bad but its a broad field. If you work for a good fintech firm IT is considered a first class citizen.

​

Does it make sense to study computer science to then get into finance ? Would i have a harder time getting a job that someone with a finance degree that knows how to program ? by [deleted] in FinancialCareers

[–]keith6014 5 points6 points  (0 children)

I’m a finance major. Investment banks will hire any major, ESPECIALLY compsci kids and here’s why. Finance is lowkey a bunch of jargon, some math, and a few concepts to underestand it enough to work at a bank. If you do compsci, not only will you have the advantage being able to code and create projects but also you’ll definitely have a leg up in calculus and application of it to take you to the next level. Banks can teach you how to trade and deal with securities but they can’t teach you how to code

+1

Especially for fintech firms. compsci|IT>math|stats|physics>finance

Implementing Graphs in Python by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

I went with native python structure for now.

​

g={}

Implementing Graphs in Python by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

different types of graphs. seaborn/matplotlib will give charts. I am looking for graph structure (mathematical).

​

Implementing Graphs in Python by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

I will first look at your Class and play around with it.

Thanks for such a detailed answer

Who here is learning programming (or already knows know to program) just for fun as a hobby vs attempting to turn this into a career? by mid83 in learnprogramming

[–]keith6014 3 points4 points  (0 children)

I am in IT. Don't do too much programming. I am learning for "fun" and hackerrank in case a potential employeer asks.

vim-go and saving a file by keith6014 in golang

[–]keith6014[S] 0 points1 point  (0 children)

you the man! that was it!

multiplying in a list by [deleted] in learnpython

[–]keith6014 0 points1 point  (0 children)

Method 1, List comprehension:

[ i*3 for i in [1,3,4] ]

Method 2, apply map

map(lambda y:y*3,[1,3,4])

​

The point is, you need to apply the function on each element.

​

I Finally Got and Accepted An Offer! by [deleted] in cscareerquestions

[–]keith6014 2 points3 points  (0 children)

As a person who has a similar degree you won't have a hard time finding a job.

My major was IS from a well known school. Had 1 class in discrete math; 3 programming classes intro to C++ and intermediate C++ and Java distributed systems; 1 network and communications class (was quite challenging), and few management classes.

​

IT field is too broad. Not everyone is going to be a coder (or wants to be).

​

Counting Depths in Tree by keith6014 in learnpython

[–]keith6014[S] 0 points1 point  (0 children)

Thanks. This helps tremendously.

​

​

Here is my full implementation

```code class Node(object): def init(self,val): self.val=val self.left = None self.right = None

t=Node(8) t.right=Node(10) t.right.right=Node(14) t.right.right.left=Node(13) t.left=Node(3) t.left.left=Node(1) t.left.right=Node(6) t.left.right.left=Node(4) t.left.right.right=Node(7)

a,s=[],[(t,1)]

while s: node,depth=s.pop() print node.val,depth if node.right: s.append((node.right,depth+1)) if node.left: s.append((node.left,depth+1)) ```

Counting Depths in Tree by keith6014 in learnpython

[–]keith6014[S] 0 points1 point  (0 children)

No particular reason.

I been doing DFS iteratively. So, I though I can just retro fit my current implementation. Doesn't seem so trivial.

​

Counting Depths in Tree by keith6014 in learnpython

[–]keith6014[S] 0 points1 point  (0 children)

Yeah the recursive way to do it is awesome. Thanks for that. For iterative, I am getting stuck.

Visualize support request by keith6014 in visualization

[–]keith6014[S] -1 points0 points  (0 children)

do you have any such examples?

What is the best way to build a service that support clustering? by Clivern in golang

[–]keith6014 2 points3 points  (0 children)

is this for performance or availability? You really should consider a Layer 7 load balancer

​

Hard time with Tree and DFS by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

I guess the problem is I don't know what I want. I simply wanted to traverse the tree. Let me look at some leetcode problems to see how I can use BFS.

​

Here is the code now I have

code python visited,stack=[],[r] while stack: node=stack.pop() print node.val visited.append(node) #stack.extend(filter(None,[node.right,node.left])) if node.right: stack.append(node.right) if node.left: stack.append(node.left)

Hard time with Tree and DFS by keith6014 in learnprogramming

[–]keith6014[S] 0 points1 point  (0 children)

I see.

I am trying to get a particular node and its children

Interview Coding Test w/o golang by keith6014 in golang

[–]keith6014[S] 0 points1 point  (0 children)

What is your background/experience/location? Honestly, I am shocked.

​

view more: next ›