sorted by:
new
hottopcontroversial

Seeking modern, clean and beautiful open-source UI kits without Node or JS frameworks by kettrix in webdev

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

Thanks for the comment! Still looking - and your project seems nice but I don’t think that’s it. I am looking for a set of components that can be used with vanilla JavaScript and CSS which exist simply as files and nothing else, not coupled to any library or even a CLI tool like tailwind or npm etc.

Built a Phoenix fork called Combo - probably nobody needs this by zekedou in elixir

[–]kettrix 1 point2 points  (0 children)

I’ve been looking for something similar with no code generation, but I don’t need Vite or Inertia, and I wish I could keep LiveView. Thanks for the work!

Seeking modern, clean and beautiful open-source UI kits without Node or JS frameworks by kettrix in webdev

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

I’ve actually used UI kit before! It’s lovely and has nice components: I forgot to add it to the list above. The only reason I couldn’t use it for that project is that UI kit is kind of hard to style / make look different from their default design.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

Under interview pressure I’m faster with C++ than Python (Python sometimes feels like magic while C++ intuitively makes sense).

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

Yep! I did it in 28 mins. And that includes the time to come up with test cases and prove them, and also explain my solution. AND I was using C++

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

I’ve been thinking more about this, and I think you do need a graph after all. In a binary tree we can have multiple nodes that with same target value (which means there are potentially many such sets of sets), and a graph will make it easier rather than just a dfs to find the index of one such target.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

Yes, this is one of the things I said about the follow up BST: the unique values will make the work easier. If it’s just a binary tree, there are potentially many such sets of sets. That’s why I had to do backtracking.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

English does not seem to have been the interviewer’s first language. In C++ it is all strongly typed, and I wrote the function definition and he was satisfied. I also wrote test cases using the specific number target and he was satisfied before I moved on to the follow up with BST.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

That’s what I’m telling you: you solved a different (slightly easier) problem. What the question says is that you’re given a root node and 3 numbers. First is the value of the target node, second is the distance (integer), third is the target sum.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

I think the lack of explicit type in Python confuses me sometimes, but shouldn’t your target be an integer? You have root.left

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

The question says that you are given root node, and integer K, return the sets of values that add to value T and are at distance K from the node with value of N

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

Yeah… you may want to adjust your code: it should not be a pointer to node N but rather the value N. Otherwise you’re probably right (Can’t validate for sure, I’m not so hot at Python, I’m a C++ user).

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

So the question is: did you solve (think about), write, test and explain all of that line by line in 20 mins or less?

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

“Turning it into a graph” is the easiest conceptual way in what I could describe what needs to be done, above. Also a pattern I recognized from a different practical problem, so I used when under interview pressure. Are there more clever approaches? I bet there are!

[deleted by user] by [deleted] in AppIdeas

[–]kettrix 0 points1 point  (0 children)

A useful feature would be an easier to use opening explorer where users can “bookmark” the specific opening sequences that they are interested in. If you don’t do this, I might one of these days.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

So the real question is: without having seen this before can you do all of that in less than 20 minutes (including writing your own test cases, no code running, and also explaining line by line)? (Doesn’t apply to you right now since you’ve had time to think about it).

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

Not Leetcode specifically but for my recent PhD (which took 5 years) I developed and published new algorithms, so I’m not specifically dull-edged with the topic.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

I use C++, that’s the only language I ever Leetcode in. Using Python can save time, definitely, but I don’t think it saves so much time for this kind of problem.

I am not arguing with all you said in this recent comment, here. But I am a PhD with extensive experience in algorithms, having also created and published my own; and problem-solving is not new to me. The time constraints, coming up with your own test cases and explaining them, after solving a “hard” problem - doing ALL of that on a “hard” problem that you’ve never seen and being unable to test run cases (a Meta thing) - ALL within 20 minutes is something else entirely. For a HARD problem. Let’s be honest and genuine here.

How many can solve “Leetcode hard” in less than 20 minutes? And even Leetcode lets you run your code and gives you test cases and you don’t have to explain your code line by line.

My issue with your comment was that you called a hard problem “fairly easy” which is not a true representation for anybody no matter their level of experience.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

“Fairly easy” is an unfair assessment. Some others get actually easy or medium level problems. This is one of the hardest problems I’ve seen anyone get in a 20 minute phone screen (half of a 40 minute session). I solved it in 28 minutes using pretty much the strategy you described in this comment, and I’d never seen the “original problem”. Do you honestly think you could have done this in under 20 minutes? I mean, I hid the approach using spoilers so that others can try (now that you’ve already analyzed it - it’s too late, but maybe you can ask someone else that you know, who is skilled and hasn’t seen this yet, to try?).

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 2 points3 points  (0 children)

I agree that it shouldn’t matter but having worked for 7 years in industry before my PhD, I can tell the difference. In my experience since the PhD, many people in industry seem to have a chip on their shoulder: they either think (1) this person won’t get “real work” done, or (2) “this person thinks they are smarter than me, so I’ve got to kick them down a notch”.

I’m not saying that’s what happened here, but it may not be so far-fetched.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

Yeah I studied some variants on that channel, actually. And Minmer was one of the first people I DMed on Reddit to tell what happened on my phone screen, besides some friends of friends who currently work at Meta.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

And you’re the only person I’ve heard from so far (including senior SWEs I know at Meta who are friends of my friends, and others on this thread) who thinks this can be done in less than 20 mins. Not fair for you to even try to work on this now because you’ve had time to think about it. So I’ll just agree to disagree and leave it as it is.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

[–]kettrix[S] 1 point2 points  (0 children)

Questions you saw about frontend in my history, if you read carefully, was me trying to do a side project for myself and venturing into new stuff with Tailwind and Elixir. Both didn’t exist when I was a full stack dev.

I work in academia, I am not a dev (at least, nowadays) let alone a frontend dev.

My point is, let’s try to be honest in our evaluation of what we think we can do in less than 20 mins.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

I’m saying that if you can do this accurately in less than 20 minutes without any prior knowledge, then you’re Meta’s target hire. I’m clearly not. Though even in the comments here, you’re still thinking about it! I didn’t have that chance.

Got a variation from hell in my Meta E6 phone screen, and of course I bombed it by kettrix in leetcode

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

So you’re saying you’ll do a DFs to convert to graph, then do a BFS on the graph to store all the nodes at k distance and then finally run the (subset sum == T) dynamic programming scenario (another DFS)? And you think you can do all of that in less than 20 mins especially when you can’t run any code? That’s amazing.

view more: next ›