icsa

12 ms·

91.
by icsa 5y ago
I have a smartphone without the SIM card installed phone. When I leave home, I use exercise, clock/alarm, and flashlight apps. At home I use Google Voice on my laptop for Voice/SMS service. The level of interruption is quite minim
92.
by icsa 5y ago
+1
93.
by icsa 5y ago
Yes, I forgot Depth-First Search/Traversal and Breadth-First Search/Traversal. Those two algorithms are the workhorses of graph algorithms. Advanced graph algorithms include Dijkstra's algorithm, Minimum Spanning Tree, Strong
94.
by icsa 5y ago
> Also the 'metrics' being used to make the final decision are secret The metrics are known. However, their weights may be unknown. What is missing from the interview process is actionable feedback. Some firms provide practice
95.
by icsa 5y ago
> It feels very standard, don't all language have it in their standard libs? Many do. However, ease of use is an issue. Some interviews don't allow you to look up the names of types & methods nor use IDEs that provide pop-u
96.
by icsa 5y ago
Absolutely! You get fired if you don't. The hiring firm wants a quantitative & unbiased comparison of all candidates.
97.
by icsa 5y ago
> So... how does rejecting on that basis serve the company trying to hire someone? One way to describe the rationale is that the hiring firm is hiring for 2-sigma capabilities versus 0-sigma or 1-sigma capabilities. The ability of a soft
98.
by icsa 5y ago
Data structures: vector/list dictionary/hashmap/hash table queue priority queue heap Methods/Algorithms: min/max insert/delete contains key list comprehension N.B. I've done most of my interviews in C and
99.
by icsa 5y ago
IMO, the reasons for algorithm testing are the following, but not limited to: Unbiased assessment of candidates for "apples to apples" comparisons See if the candidate has skills deeper than typical day-today skills that can calle
100.
by icsa 5y ago
I was referring these common interview skills: Understanding the problem Stating one's assumptions Verifying one's assumptions Selecting a data structure appropriate for the problem Selecting or describing an algorithm appropriate
101.
by icsa 5y ago
The technical interview is designed to be a small-scale exercise in delivering code. Some firms provide take-home problems/projects - typically with a time limit. Their objective is to provide a more realistic scenario for writing code
102.
by icsa 5y ago
> This is so wrong. Headhunters are acting like typical bureaucrats and instead of adapting their approach to make it better at finding the actual talent (the whole point of their job), they push for developers to fit their stereotype te
103.
by icsa 5y ago
For additional information regarding current technical interviews please refer to this class offered by the Stanford University Computer Science department: CS 9: Problem-Solving for the CS Technical Interview https://web.stanfor
104.
by icsa 5y ago
> How does this serve the company trying to hire someone? The interviews are designed to evaluate algorithm & data structure knowledge and proficiency. Most experienced software engineers have not kept up to speed with such knowledge
105.
by icsa 5y ago
The churn rate of current software development practice is quite rapid. When you took several years off, you "fell out of the job market". In effect, you need to reboot your skill & tool set to make current. In addition, you
106.
by icsa 5y ago
Interestingly, two decades ago, Kx's k3/kdb had support for two query languages - i.e. ANSI SQL 92 and ksql (proprietary time-series SQL).
107.
by icsa 5y ago
Given that early versions of Erlang were implemented in Prolog and Erlang's syntax is derived from Prolog's syntax, this is quite ironic.
108.
by icsa 5y ago
I had a similar situation a few years back. Postgres has constructs that are optimization barriers. Once I understood this and reviewed the Postgres source code to determine the semantics of the relevant constructs, it was possible to get a
109.
by icsa 5y ago
Hint: It involves the term log(N).
110.
by icsa 5y ago
Once you look at the verbs as symbols for algorithms, it will make much more sense. Most languages make you create algorithms. k code is the composition of algorithms.
111.
by icsa 6y ago
Thanks! Is that requirement in the documentation?
112.
by icsa 6y ago
+ Compiler Explorer + Jasik Debugger (68000 Macintosh) - One of the best pieces of software that I have ever used. It could still compete today.
113.
by icsa 6y ago
VisiCalc, Turbo Pascal, WATCOM Compilers, Perl, Mathematica, C++ STL, Memory Mapping APIs, cURL, clang/LLVM
114.
by icsa 6y ago
With respect to wyrand, it seems that all prime numbers are not created equal. I implemented wyrand() using the two primes just below 2^64. The upper 53 bits of each 64-bit random deviate was used to generate a uniform [0,1) floating point
115.
by icsa 6y ago
Why do you necessarily want to work at a FAANG company? There are plenty of other fine organizations that pay reasonably well and don't have such a high interview bar. Perhaps you should consider a non-tech company (e.g. retail, health
116.
by icsa 6y ago
3 8#1. looks like algebra to me. similar to: 3x^2+8x+1 instead of something, in algo-like languages, such as: plus((mult(3,square(x))),plus(mult(3,x),1))) Even Java lets you write 3 x x+8*x+1, as a concession the value of algebraic notation
117.
by icsa 6y ago
Top research universities get their students closer to the state of the art than do teaching universities. For example, in recent years, freshmen students at Carnegie Mellon have learned more state of the art computer science knowledge than
118.
by icsa 6y ago
Have you tried the cmph (C Minimal Perfect Hash) library?
119.
by icsa 6y ago
The pliant language ( http://www.fullpliant.org/ ) by Hubert Tonneau has been using indented Lisp for some time.
120.
by icsa 6y ago
I was a big fan of Stratego/XT as well. Expressing optimizations was very straightforward.

More ›