Coding Interviews

Hey guys, it’s Morty here, and today we’re gonna be tackling LeetCode problem number #0001: Two Sum. This one’s all about finding the two numbers in an array that add up to a given target. …

I was recently asked to develop a program that would print all the files in a directory and subdirectory, including the path. This is how we could go about it. Simple using the recursive approach with jaav.io package. public static void main(String[] args) { final File folder = new File(“path of the DIR”); listFilesForFolder(folder); public static void listFilesForFolder(final File folder) { for (final File fileEntry : folder.listFiles()) {

What is bounded blocking queue? A bounded blocking queue is a thread-safe data structure that allows multiple threads to add or remove elements, with the added constraint that the queue has a fixed maximum capacity. Once the queue is full, any further attempts to add additional elements will be blocked, until space becomes available. Where is bounded blocking queue used? Bounded…

Before I get into this week’s topic of engineering leadership, I’d like to express my appreciation to the Educative learner community for their continued support over the years. I love receiving feedback that helps us expand our course selection because it says you trust us to deliver world-class learning resources. …

… and it’s time for another technical interview. I log into a Zoom meeting and the interviewer, a young bearded man in a t-shirt greets me. Interviewer: We’ll start with a relatively straightforward technical question. Do you know fizzbuzz? I: … Interviewer: for all integers from 0 to 100 print…

My first interview assessment didn’t go well, and I didn’t pass. I had considered myself prepared; I had done most of the practice that was suggested, coded while timing myself, completed problems well under time, did interview practice sessions (and volunteered as tribute during it). Still, No dice. It felt…