Coding Interviews
Practice algorithms, data structures, and technical interview preparation
Navigate through content by publication date
Mon, Oct 19
10 items found
Must Do Leetcode Questions:
✅Binary Search — https://lnkd.in/d2g7aTX8 ✅Graph — https://lnkd.in/dRxPpFQt ✅Backtracking — https://lnkd.in/dpSEXTED ✅Fast & Slow Pointers…Continue reading on Medium »
Dynamic Programming: Save Time by Remembering What You’ve Already Solved
1. What Is Dynamic Programming?Continue reading on Medium »
Capital One Software Engineer Interview Guide 2026: CodeSignal, Power Day, Case Interviews, and…
Prepare for a Capital One software engineer interview in two modes: complete a correct coding task under time pressure, then explain a…Continue reading on Medium »
JPMorgan Chase 2027 Software Engineer Program OA: HackerRank, Code for Good, and Timeline
Updated August 17, 2026. You finish a JPMorgan Chase HackerRank, pass every visible test case, and then discover that the next step may not be a standard technical interview at all. For some 2027 candidates, the assessment is a gateway to Code for Good, the firm's team-based social-impact hackathon. For others, the sequence includes a recorded interview, a conventional interview process, or a different regional program. That is the central challenge of the JPMorgan Chase 2027 Software Engin...
5 Interview Mistakes You Only Notice When You Review the Recap
Most of us prepare for interviews the same way: read a list of common questions, write a few answers, and hope they come out right on the day. The problem is that you never find out how they actually came out. The call ends, you feel "okay-ish", and a week later you get a rejection with no feedback. A simple habit fixes this. After every interview and mock interview, write down three things: What was I asked? What did I actually say? What should I have said? Do this a few times and the ...
Generative AI & LLM Interview Questions: 30 Questions With Model Answers
These 30 generative AI and LLM interview questions cover what freshers and junior engineers are actually asked: transformer basics, training and fine-tuning, prompting and inference settings, and running LLMs safely in production. Each has a short model answer you can adapt. How these LLM interview questions are organised These LLM interview questions follow the order most interviews take: fundamentals of how the model works, how it is trained and adapted, how you control it when ...
Shortest Path Algorithms: Comparing Dijkstra, Bellman-Ford, and Floyd-Warshall
title: "Shortest Path Algorithms: Comparing Dijkstra, Bellman-Ford, and Floyd-Warshall" published: true published_at: "2027-01-16T09:00:00+05:30" description: "A practical engineering guide to Shortest Path Algorithms: Comparing Dijkstra, Bellman-Ford, and Floyd-Warshall. Learn core mechanics, production tradeoffs, and best practices." tags: [dsa, algorithms, computerscience, interviewprep] ai_disclosure_level: some_ai In modern software development, Shortest Path Algorithms: Comparing Dijks...
Segment Trees: Leveling Up Like a RPG Boss
The Quest Begins (The "Why") Ever stared at a coding interview question that asks for the sum of numbers between indices l and r… a hundred times? I have. The first time I saw it, I thought “just loop, it’s fine.” Then the tester dropped a follow‑up: “now do it with updates in between.” My naive O(n) per query solution started to feel like trying to defeat a final boss with a wooden sword. I spent a frustrating afternoon debugging off‑by‑one errors, and when the test suite finally turned gr...
Edit Distance or Levenshtein Distance in an Easy Recursion + Memoization Way
Edit Distance, also known as Levenshtein Distance, is a common problem where we need to find the minimum number of operations required to convert one string into another. The three allowed operations are: Insert a character Delete a character Replace a character For example: word1 = "horse" word2 = "ros" Output: 3 We can convert "horse" into "ros" using three operations: Replace h with r: "rorse" Delete r: "rose" Delete e: "ros" Let's solve this problem using recursio...
1569. Number of Ways to Reorder Array to Get Same BST
1569. Number of Ways to Reorder Array to Get Same BST Difficulty: Hard Topics: Principal, Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree, Fermat's Little Theorem, Weekly Contest 204 Given an array nums that represents a permutation of integers from 1 to n. We are going to construct a binary search tree (BST) by inserting the elements of nums in order into an initially empty BST. Find the number of differen...