DevBrainiac Web Image
Articles
Blogs
MCQ
SQL
Q&A
Creatives
Tools
Tags
Jobs
Community
LogIn
I don't have account.

Oracle Interview Experience (Senior Applications Engineer)

Landing an interview with Oracle was both exciting and challenging. I recently went through the complete process for the Senior Applications Engineer role, which involved three rounds from a screening call to in-person interviews. Here's a detailed account of my Oracle interview experience, including the type of questions asked, difficulty level and some preparation tips that helped me throughout. Round 1 : Initial Screening (Easy) Mode: Remote Duration: 55 minutes Focus: Java core concepts, OOP principles and basic problem-solving ...

~ Ashutosh Verma

⏱️05 October 2025

4 Sum | Find Quads that add up to a target value

Given an array nums of integers and an integer target, return all unique quadruplets a, b, c, d] such that: a + b + c + d == target The result must not contain duplicate quadruplets and the quadruplets can be in any order. Example 1 Input: nums = [1, 0, -1, 0, -2, 2] target = 0 Output: [[-2, -1, 1, 2],...

~ HackFury

⏱️05 October 2025

Top 50 Most Frequently Asked String Coding Problems (Interview Preparation )

String manipulation is one of the most important topics in coding interviews. From reversing strings to solving dynamic programming-based problems like Edit Distance, mastering string algorithms helps you stand out in technical rounds at companies like Google, Amazon, Microsoft and Meta. This guide covers 50 of the most frequently asked string problems, categorized by difficulty level (Easy, Medium, and Hard) each with a short description, core concepts and key ideas to help you prepare smarter. Easy Level String Problems 1. Reverse String Description: Reverse the characters of a given string in-place. Concepts: Two-pointer swap, in-place modification. Example: Input: "hello" -> Output: "olleh"...

~ HackFury

⏱️05 October 2025

Intersection of Two Sorted Arrays

Given two sorted arrays, return their intersection (the common elements). If an element appears more than once in both arrays, it should appear the same number of times in the intersection. Result must also be in sorted order. Example 1...

~ HackFury

⏱️05 October 2025

Sort an Array of 0s and 1s

Given an array consisting of only 0s and 1s, sort the array in ascending order (all 0s first, followed by all 1s). The sorting must be done in-place without using built-in sort. Example 1 Input: arr = 0, 1, 1, 0, 1, 0, 0, 1] Output: [0, 0, 0, 0, 1, 1, 1, 1] Example 2 Input: arr = [1, 1, 1, 0, 0, 0]...

~ HackFury

⏱️05 October 2025

Move all Zeros to the end of the array

Given an integer array nums, move all 0's to the end of the array while maintaining the relative order of the non-zero elements. Example 1 Input: nums = [0, 1, 0, 3, 12] Output: [1, 3, 12, 0, 0] Explanation: All non-zeros [1,3,12] keep their order, zeros move to the end. Example 2 Input: nums = [0, 0, 1] Output: [1, 0, 0] ...

~ HackFury

⏱️05 October 2025

Remove Duplicates from Sorted Array (In-Place)

Given an integer array sorted in non-decreasing order, remove the duplicates in-place so that each unique element appears only once. The relative order of elements must be preserved. Return the number of unique elements k. The first k elements of the array should store the unique values. Values beyond the first k positions don’t matter....

~ HackFury

⏱️03 October 2025

Remove N-th Node from the End of a Linked List | Java

Given the head of a singly linked list and an integer n, remove the n-th node from the end of the list and return the head of the resulting list. Removing the N-th node from the end of a singly linked list is a classic interview/algorithm problem. It tests your understanding of pointers, edge-case handling (removing the head) and different trade-offs between time/space approaches. Example 1 Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Explanation: The 2nd node from the end is 4, so remove it. Example 2 Input: head = [1], n = 1 Output: []...

~ HackFury

⏱️03 October 2025

Sliding Window Patterns in DSA: Complete Guide with Examples

Sliding window is a fundamental technique in Data Structures and Algorithms (DSA) for solving array and string problems efficiently. Recognizing the right sliding window pattern can transform a brute-force O(n²) solution into an elegant O(n) implementation. This guide covers all common sliding window patterns, their use cases and real interview examples. What is Sliding Window? A sliding window is a subarray or substring that moves through the main array/string. Instead of repeatedly recalculating values for overlapping subarrays, we “slide” the window and update results incrementally. Benefits of Sliding Window: Reduces time complexity from O(n²) → O(n) Efficiently solves subarray/subsequence problems...

~ Marcus Johnson

⏱️03 October 2025

Convert Markdown to HTML and HTML to Markdown

Whether you're building a blog, content management system (CMS) or a documentation site, converting between Markdown and HTML is a common task in modern web development. In this guide, we'll show you how to easily convert Markdown to HTML and HTML back to Markdown using JavaScript libraries like unified, remark, rehype, and turndown. Why Convert Between Markdown and HTML? Markdown to HTML: Needed for rendering Markdown content in browsers. HTML to Markdown: Useful when editing previously rendered content or importing HTML from external sources. ...

~ Janhavi Rajput

⏱️27 September 2025

How to Efficiently Use LINQ Intersect in C# with Large Collections

Why This is Important When you work with large datasets in C#, performance and memory can quickly become a concern. The LINQ Intersect method might look straightforward, but the way you use it can make a big difference. Depending on which list you call it on, your code can either run smoothly or end up using more time and memory than necessary. By understanding how Intersect works, you can write faster, more efficient C# code that handles big collections with ease. Understanding this helps you: Write efficient code for large collections. Avoid hidden performance pitfalls. Make better design decisions in real-world applications. ...

~ Kamal Reddy

⏱️17 September 2025

Microsoft SDE-2 Interview Experience | Selected

I recently gave the Microsoft SDE-2 interview and honestly it was a mix of DSA, some low-level/system design and a lot of focus on problem-solving. I'm just sharing my round-by-round experience here, hoping it helps anyone who's preparing for something similar. Round 1 – Technical (DSA Problem) Level: Medium Duration: 60 mins Mode: Remote ...

~ Harshit Kumar

⏱️14 September 2025

Adobe SDE 3 Interview Experience

I recently went through the interview process for Adobe SDE 3 and I thought it might be helpful to share my experience in detail. Hopefully, it’ll give you guys some clarity on what to expect and how to prepare for Adobe. DSA Round 1 Level: Medium Duration: 60 mins Mode: Remote This round was purely focused on problem-solving and coding efficiency. ...

~ Ekta chaudhary

⏱️12 September 2025

Apna Team Lead Interview Experience

I recently appeared for the Team Lead interview at Apna and the process was quite extensive, testing both my low-level design (LLD), high-level design (HLD), project knowledge and behavioral skills. Here’s a detailed breakdown of my interview journey: Round 1 – Low-Level Design (LLD) Topic: BookMyShow System Design The interviewer asked me to design the complete flow of BookMyShow. The discussion covered:...

~ Shubham Verma

⏱️10 September 2025

How to Craft Advanced Prompts for Image Generation

Image generation with AI has become a powerful tool for designers, marketers, developers and content creators. But the secret to generating stunning, realistic and high-quality images isn't just the AI model. it's the prompt you write. Crafting a good prompt is not just about describing an object. Small details like lighting, camera angle, style, posture, mood and resolution can turn flat results into breathtaking, cinematic visuals. In this guide, we'll go beyond the basics. You'll learn **advanced prompt techniques, real examples with comparisons, reusable templates and pro tips** to help you craft professional-grade AI images. Why Prompt Quality Matters...

~ Marcus Johnson

⏱️10 September 2025

Adobe Software Engineer 2 Interview Experience

I recently interviewed for the Software Engineer 2 (SDE-2) role at Adobe, sharing question that was asked in Adobe interview are Round 1 – Technical Interview | Attribute | Details | |-----------|---------------| | Level | Medium | | Duration | 60 minutes | | Mode | Remote | ...

~ Janhavi Rajput

⏱️09 September 2025

Carwale SDE-1 Interview Experience

Round 1: DSA + Problem Solving (Technical Coding Round) Duration: 60 minutes Mode: Remote (Live Coding) Difficulty: Medium Questions Asked: Search in Rotated Sorted Array Print Top View of Binary Tree ...

~ Neeta Chakravorty

⏱️09 September 2025

Zoho Software Development Engineer 2 (SDE-2) Interview Experience

I recently interviewed for the Software Development Engineer (SDE) - Level 2 role at Zoho. Here’s a detailed breakdown of my experience across all rounds. Round 1: Online Assessment (Coding & Aptitude) Level: Medium Duration: 90 minutes Mode: Remote This was the first hurdle, consisting of two sections:...

~ Ashutosh Verma

⏱️09 September 2025

Goldman Sachs Round 2 Coding Interview

I recently interviewed for the Analyst (SDE) role at Goldman Sachs, Bangalore, sharing question that was asked ininterview are Gas Station Minimum Window Substring Problem 1: Gas Station You are given two integer arrays: ...

~ Ajeet Pawar

⏱️08 September 2025

Advanced Guide: How to Get Clear, Accurate and Actionable AI-Generated Responses

This guide outlines proven strategies to improve the quality, relevance and precision of AI-generated content. Apply these techniques to maximize the usefulness of every interaction and avoid vague or unfocused results. 1. Be Specific, Not Vague Why: AI performs best when given clear, detailed instructions with no ambiguity. How: Instead of: ...

~ Deepak Patel

⏱️08 September 2025

Goldman Sachs Interview Experience – Analyst (SDE) Role, Bangalore

I recently interviewed for the Analyst (SDE) role at Goldman Sachs, Bangalore. I applied through a referral, which helped fast-track my process. Currently, I work as a backend developer in a service-based company, mainly handling client projects. Here's a round-by-round breakdown of my experience. Round 1: Online Assessment (OA) | Difficulty | Duration | Mode | |------------|-------------|---------| | Medium | 60 minutes | Remote | ...

~ Ajeet Pawar

⏱️08 September 2025

Visa Interview Experience – SDE-1 Role

Interviewing at Visa was a mix of DSA challenges, graph-based reasoning and behavioral evaluation. The process tested not only coding ability but also how well you can model real-world problems and communicate your thought process. Here’s a detailed breakdown of my rounds. Round 1: Online Coding Assessment | Difficulty | Duration | Mode | |------------|-------------|--------------------| | Medium | 90 minutes | Remote (Codesignal) | ...

~ Ekta chaudhary

⏱️08 September 2025

Amazon Interview Experience – Online Assessment to System Design

Landing an interview with Amazon is exciting, but also challenging. The process is structured to test not only your DSA (Data Structures & Algorithms) skills but also your ability to adapt to real-world problems, apply leadership principles and design scalable systems. Below is my complete interview experience with Amazon, broken down round by round. Round 1: Online Assessment (Medium Level) Duration: 60 minutes Mode: Remote Coding Problems: 2 ...

~ Kamal Reddy

⏱️08 September 2025

Mastering the Sliding Window: Top 50 Problems Tiered & Explained

Sliding window is a powerful technique for optimizing contiguous subarray or substring challenges. This guide presents 50 curated problems—built from trusted sources each with a descriptive summary to highlight what’s being asked and how to think about it. Easy (Low Complexity) – Foundation Building Maximum Sum Subarray of Size K Compute the max sum over all subarrays of size k. Smallest Window Containing 0, 1, and 2 ...

~ Raj Verma

⏱️07 September 2025

Amazon Interview Drilldown: Reddit Questions

Based on real posts from Reddit users who underwent Amazon interviews and common problem lists on there, this guide presents authentic problems, structured explanations and sample walkthroughs to help you connect the dots for preparation. 1. Online Assessment: Attractive Number (Reddit OA Report) Problem: Given a number num as a string and integer k, define num as attractive if every digit is equal to the digit k positions ahead (num[i] == num[i+k]). Return the smallest attractive number ≥ num. Topic Hint: ...

~ Harshit Kumar

⏱️07 September 2025

Top 50 Most Frequently Asked String Coding Problems for Interviews

Strings are one of the most common topics in coding interviews because they combine data structure knowledge, algorithmic thinking and real-world scenarios (search, validation, parsing, compression). The key to cracking them? Pattern recognition. Most problems fall into common categories like two-pointers, sliding window, hashing, dynamic programming or backtracking. This blog lists the Top 50 String Problems with clear descriptions + topic hints so you know exactly what the problem is and which approach to apply. Use this as your study roadmap + tracking checklist ....

~ Raj Verma

⏱️07 September 2025

Essential DSA Patterns Cheat Sheet for Interview Preparation

When preparing for coding interviews, it’s easy to get lost in solving hundreds of random problems. But top candidates know a secret — most interview questions follow a handful of reusable problem-solving patterns. Instead of memorizing solutions, you should learn to recognize the underlying pattern in a problem. Once you spot the pattern, solving becomes a matter of applying the right template with slight modifications. 1️. Sliding Window When to use: Substrings, subarrays or sub-sequences with constraints (sum, length, distinct elements). Idea: Maintain a window and slide by adding/removing elements to meet constraints. ...

~ Jaya Vishwakarma

⏱️07 September 2025