Coding Interview Preparation
описание
Coding interview preparation for software engineers Interview questions, DSA, clean solutions. Join 👉 https://rebrand.ly/bigdatachannels Buy ads: https://telega.io/c/coding_interview_preparation DMCA: @disclosure_bds Contact: @mldatascientist
5 893
подписчиков
Охват к подписчикам
2,8%
ERR
Реакции к просмотрам
0,17%
10 на 28 постов
Пересылки к просмотрам
0,41%
24
Постов в день
1,9
всего 28
Где отзываются чаще
доля реакций к просмотрам- 12 авг.👋Hello Everyone One of our Member asked for Quantum Cryptography Resources a while ago... … and here they are! These free university notes and slides break down quantum cryptography in a clear, practical way: covering the classic BB84 protocol, how eavesdropping gets detected, key reconciliation, privacy amplification, and the main variants like B92 and E91. These are great quick-reference materials if you want to understand how quantum key distribution actually works without going through dense textbooks.1,26%
- 6 авг.🕵️ RECRUITER SECRETS #4 - What Actually Happens After Your Interview Ever wondered what happens the moment you leave that Zoom call? Here's the real process at most mid-to-large companies: 1️⃣ Each interviewer independently writes feedback and a rating (usually a scale like "Strong Hire / Hire / No Hire / Strong No Hire") before discussing with anyone else - this is intentional, to avoid groupthink. 2️⃣ These are compiled into a packet for a hiring committee or debrief meeting - often people who never even met you. 3️⃣ One "no hire" from a single round can sometimes be overridden by strong signal elsewhere, but a "strong no hire" is very difficult to recover from, even with great other rounds. 4️⃣ The single biggest factor in close calls: whether interviewers can point to specific examples in their notes, not vague impressions. This is why articulating your thinking clearly matters so much - a vague "good vibes" interview generates a vague, easily-overruled recommendation. Here's the actionable part: at the end of every round, briefly summarize what you just demonstrated. "Just to recap, I approached this with a hash map for O(1) lookups, handled the edge cases we discussed, and we walked through the complexity together." This gives the interviewer an easy, concrete sentence to write down - literally doing their job for them. Did this change how you think about what happens after you leave the interview? 👇0,92%
- 14 авг.🗣️ BEHAVIORAL INTERVIEW #4 - "Why Do You Want to Work Here?" The laziest possible answer: "I've heard great things about the culture and I'm excited about the growth opportunities." Every interviewer has heard this exact sentence a thousand times, and it signals you didn't actually research the company. ✅ What separates a great answer: 1️⃣ Reference something SPECIFIC about the company - a product decision, an engineering blog post, a technical challenge unique to their scale. 2️⃣ Connect it to YOUR specific experience or interests - not generically "I'm passionate about tech." 3️⃣ Show you've thought about what you'd actually be doing day-to-day, not just the brand name. Example: "I read your engineering blog post about migrating from a monolith to microservices, and the challenges you described around data consistency really matched what I worked through in my current role, just at a much smaller scale. I'm excited about tackling that same problem at 10x the complexity, and learning from a team that's already been through it." This takes 15 minutes of research beforehand and instantly puts you ahead of 80% of candidates who show up unprepared for this exact question. Do you research the company's engineering blog before interviews? If not, put it on your prep checklist right now 😉0,87%
- 1 февр.без подписи0,49%
- 2 авг.hiring-without-whiteboards A list of companies (or teams) that don't have a broken hiring process. The companies and teams listed here use interview techniques and questions that resemble day-to-day work. Creator: poteto Stars ⭐️: 51,200 Forked by: 3,903 Github Repo: https://github.com/poteto/hiring-without-whiteboards ➖➖➖➖➖➖➖➖➖➖➖➖➖➖ Join @github_repositories_bds for more cool repositories. This channel belongs to @bigdataspecialist group0,46%
- 5 авг.🐛 SPOT THE BUG #4 Language: JavaScript (React) javascript function UserProfile({ userId }) { const [user, setUser] = useState(null); useEffect(() => { fetchUser(userId).then(data => setUser(data)); }); return <div>{user?.name}</div>; } What's the bug? 👇 . . . The bug: Missing dependency array in useEffect. Without [userId] (or even []), this effect runs after EVERY render - and since setUser triggers a re-render, and that re-render triggers the effect again, you get either an infinite fetch loop or, at minimum, wildly wasteful re-fetching. Fixed version: javascript useEffect(() => { fetchUser(userId).then(data => setUser(data)); }, [userId]); // only re-run when userId changes ⚠️ Bonus bug hiding here too: if userId changes quickly (user navigates between profiles fast), an OLDER fetch can resolve AFTER a newer one, overwriting fresh data with stale data ("race condition"). The fix is usually a cleanup function that ignores outdated responses: javascript useEffect(() => { let ignore = false; fetchUser(userId).then(data => { if (!ignore) setUser(data); }); return () => { ignore = true; }; }, [userId]); React hooks bugs are EXTREMELY common in frontend interviews right now. Have you been bitten by a missing dependency array before? 👇0,41%
- 15 авг.без подписи0,00%
- 15 авг.без подписи0,00%
- 14 авг.🐛 SPOT THE BUG #5 Language: SQL sql SELECT customer_id, COUNT(*) as order_count FROM orders WHERE order_date > '2024-01-01' GROUP BY customer_id ORDER BY order_count DESC LIMIT 1; Goal: find the customer with the most orders after Jan 1st, 2024. Looks right at first glance - what's the subtle issue? 👇 . . . The bug: LIMIT 1 silently drops any ties. If TWO customers are tied for the most orders, this query arbitrarily returns just one of them (and which one is returned isn't guaranteed to be consistent across database engines or even across runs). If the actual requirement is "find ALL customers tied for the most orders," this query quietly gives a wrong (incomplete) answer that LOOKS correct. Fixed version (handles ties): sql WITH ranked AS ( SELECT customer_id, COUNT(*) as order_count, RANK() OVER (ORDER BY COUNT(*) DESC) as rnk FROM orders WHERE order_date > '2024-01-01' GROUP BY customer_id ) SELECT customer_id, order_count FROM ranked WHERE rnk = 1; 💡 This is a great example of why clarifying requirements matters even in SQL questions - "top 1" and "all customers tied for the top spot" are genuinely different problems, and a query that's correct for one is silently wrong for the other. Have you ever shipped a query that "worked" but quietly handled ties incorrectly? 👇0,00%
- 14 авг.🕵️ RECRUITER SECRETS #5 - The Truth About "Overqualified" Ever been told you're "overqualified" for a role? Here's what's actually going on behind that phrase, because it's rarely about your skills: 🔹 Flight risk concern: they're worried you'll leave the moment something better comes along, wasting their onboarding investment. 🔹 Salary concern: they assume you'll ask for more than the role is budgeted for. 🔹 Team dynamics concern: they worry you'll be frustrated reporting to someone more junior, or bored by the scope of work. ✅ How to address it directly, if you actually want the role: "I understand the concern - I'm specifically looking for [genuine reason: better work-life balance / a switch to a domain I'm passionate about / a smaller team where I have more ownership], and I'm fully aligned with the scope and comp for this level. I'm not looking at this as a stepping stone." Naming the concern directly and addressing it head-on is far more effective than hoping it doesn't come up. Vague reassurance ("no really, I just want this job!") without addressing WHY they're worried usually doesn't land. If it's genuinely not the right fit level for you, that's okay too - but going in with a real, honest answer to "why would you take a step back" beats dodging the question every time. Has "overqualified" ever come up for you? How'd you handle it? 👇0,00%
- 13 авг.🎯 CODING CHALLENGE #8 - Course Schedule (Detect Cycle in a Graph) Difficulty: Medium-Hard | Asked at: Google, Meta, Uber You have numCourses courses, and a list of prerequisite pairs [a, b] meaning "to take course a, you must first take course b." Determine if it's possible to finish all courses (i.e., there's no cyclic dependency). Input: numCourses = 2, prerequisites = [[1,0]] Output: true Input: numCourses = 2, prerequisites = [[1,0],[0,1]] Output: false (cycle: 0 needs 1, 1 needs 0) 💡 Hint: This is cycle detection in a directed graph. Topological sort (Kahn's algorithm using in-degrees) is the cleanest approach. Solution: python from collections import deque def can_finish(num_courses, prerequisites): graph = {i: [] for i in range(num_courses)} in_degree = [0] * num_courses for course, prereq in prerequisites: graph[prereq].append(course) in_degree[course] += 1 queue = deque([i for i in range(num_courses) if in_degree[i] == 0]) completed = 0 while queue: node = queue.popleft() completed += 1 for neighbor in graph[node]: in_degree[neighbor] -= 1 if in_degree[neighbor] == 0: queue.append(neighbor) return completed == num_courses Complexity: O(V + E) time and space, where V is courses and E is prerequisite pairs. Common mistake: Trying to solve this with plain DFS + a visited set, without tracking the CURRENT recursion path separately. You need to distinguish "visited overall" from "visited in this current path" - otherwise you can't actually detect a cycle, only whether a node's been seen at all. This "can this graph be finished/ordered" pattern (topological sort) shows up under many disguises - build systems, task scheduling, spreadsheet formula dependencies. Recognize the shape and you'll spot it fast. Kahn's algorithm or DFS-based cycle detection - which do you find more intuitive? 👇0,00%
- 12 авг.без подписи0,00%