My Adobe Interview Experience (Part - 1/2)
๐๐. ๐๐ก๐๐ญ ๐ฐ๐๐ฌ ๐ญ๐ก๐ ๐ก๐ข๐ซ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐๐ฌ๐ฌ? ๐๐จ๐ฐ ๐ฆ๐๐ง๐ฒ ๐ซ๐จ๐ฎ๐ง๐๐ฌ ๐ฐ๐๐ซ๐ ๐ญ๐ก๐๐ซ๐?
Adobe visited our campus(IGDTUW) for its annual on-campus pool drive in October
Branches allowed to sit for the assessment: BTech- CSE/IT/ECE and MTech- VLSI/ISM/MPC
Profile: Software Development Engineer
Job Location: Noida/Bangalore
Eligibility Criteria: PG candidates: 70% in post-graduation & graduation, 60% in 12th & 10th
UG candidates: 70% in graduation, 60% in 12th & 10th.
No current backlogs.
Platform: Cocubes
Format: Aptitude(30 mins) + Coding(2 questions & 30 minutes) with webcam enabled.
Total no. of rounds: 5( 1 online assessment + 3 technical + 1 HR)
๐๐. ๐๐ก๐๐ญ ๐๐ซ๐ ๐ญ๐ก๐ ๐๐จ๐ฆ๐ฆ๐จ๐ง ๐๐๐ญ๐ ๐ฌ๐ญ๐ซ๐ฎ๐๐ญ๐ฎ๐ซ๐๐ฌ ๐๐ฌ๐ค๐๐ ๐๐ฎ๐ซ๐ข๐ง๐ ๐ข๐ง๐ญ๐๐ซ๐ฏ๐ข๐๐ฐ๐ฌ?
I was asked questions from Arrays, LinkedList, Hashmap, HashSet, Binary Trees, String Builder, Stack & Queues, and Graphs.
You can expect questions based on any of the basic data structures that are taught in the โData Structures & Algorithmsโ course or the โAnalysis and Design of Algorithmsโ course.
๐๐. ๐๐ก๐๐ญ ๐ฐ๐๐ซ๐ ๐ญ๐ก๐ ๐ช๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ ๐๐ฌ๐ค๐๐ ๐ข๐ง ๐๐ข๐๐๐๐ซ๐๐ง๐ญ ๐ซ๐จ๐ฎ๐ง๐๐ฌ? ๐ข๐ ๐ซ๐๐ฆ๐๐ฆ๐๐๐ซ ๐๐ง๐ฒ.
๐๐๐ ๐๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ
โ๏ธ Given a singly linked list, reverse every k-nodes.
Clone a linked list next and a random pointer. (with and without using extra space)
โ๏ธ Zig-Zag traversal of a binary tree ( 2-3 approaches)
โ๏ธ Activity Selection problem
โ๏ธ Given a binary tree, determine if it is BST or not
โ๏ธ An array of size n has values 1-n with 1 element missing. The missing element is replaced by -1. Find the missing element.
โ๏ธ The internal implementation of Hashmap.
String immutability, string interning, and string matching concepts in Java.
โ๏ธ Discussion on some practical problems like Adhaar card and Passport Sewa requiring to override hashcode(), hasnext(), and next() build-in Java functions.
โ๏ธ Given an array, print all the pairs with the given sum. (2-3 approaches)
๐๐ ๐๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ
โ๏ธ A thorough discussion on OS topics like memory management, process synchronization, thread synchronization, deadlocks, segmentation, paging techniques, scheduling algorithms, etc.
๐๐๐๐ ๐๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ
โ๏ธ Several DBMS questions like various keys in DBMS, 1-2 SQL queries, normalization, etc.
The interviewers required proper (C++/Java) code, dry run, and stack trace.
All the best! โค๏ธ
P.S. - That's me attending Adobe's Diwali Mela ๐
-------------
Book a 1:1 mentorship session with me -ย https://lnkd.in/dBat2pfB
Twitter -ย https://lnkd.in/deHrAPcF
Instagram -ย https://lnkd.in/dFmiPh4G
#adobeย #interviewexperienceย #interviewquestionsย #linkedincreators
๐๐. ๐๐ก๐๐ญ ๐ฐ๐๐ฌ ๐ญ๐ก๐ ๐ก๐ข๐ซ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐๐ฌ๐ฌ? ๐๐จ๐ฐ ๐ฆ๐๐ง๐ฒ ๐ซ๐จ๐ฎ๐ง๐๐ฌ ๐ฐ๐๐ซ๐ ๐ญ๐ก๐๐ซ๐?
Adobe visited our campus(IGDTUW) for its annual on-campus pool drive in October
Branches allowed to sit for the assessment: BTech- CSE/IT/ECE and MTech- VLSI/ISM/MPC
Profile: Software Development Engineer
Job Location: Noida/Bangalore
Eligibility Criteria: PG candidates: 70% in post-graduation & graduation, 60% in 12th & 10th
UG candidates: 70% in graduation, 60% in 12th & 10th.
No current backlogs.
Platform: Cocubes
Format: Aptitude(30 mins) + Coding(2 questions & 30 minutes) with webcam enabled.
Total no. of rounds: 5( 1 online assessment + 3 technical + 1 HR)
๐๐. ๐๐ก๐๐ญ ๐๐ซ๐ ๐ญ๐ก๐ ๐๐จ๐ฆ๐ฆ๐จ๐ง ๐๐๐ญ๐ ๐ฌ๐ญ๐ซ๐ฎ๐๐ญ๐ฎ๐ซ๐๐ฌ ๐๐ฌ๐ค๐๐ ๐๐ฎ๐ซ๐ข๐ง๐ ๐ข๐ง๐ญ๐๐ซ๐ฏ๐ข๐๐ฐ๐ฌ?
I was asked questions from Arrays, LinkedList, Hashmap, HashSet, Binary Trees, String Builder, Stack & Queues, and Graphs.
You can expect questions based on any of the basic data structures that are taught in the โData Structures & Algorithmsโ course or the โAnalysis and Design of Algorithmsโ course.
๐๐. ๐๐ก๐๐ญ ๐ฐ๐๐ซ๐ ๐ญ๐ก๐ ๐ช๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ ๐๐ฌ๐ค๐๐ ๐ข๐ง ๐๐ข๐๐๐๐ซ๐๐ง๐ญ ๐ซ๐จ๐ฎ๐ง๐๐ฌ? ๐ข๐ ๐ซ๐๐ฆ๐๐ฆ๐๐๐ซ ๐๐ง๐ฒ.
๐๐๐ ๐๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ
โ๏ธ Given a singly linked list, reverse every k-nodes.
Clone a linked list next and a random pointer. (with and without using extra space)
โ๏ธ Zig-Zag traversal of a binary tree ( 2-3 approaches)
โ๏ธ Activity Selection problem
โ๏ธ Given a binary tree, determine if it is BST or not
โ๏ธ An array of size n has values 1-n with 1 element missing. The missing element is replaced by -1. Find the missing element.
โ๏ธ The internal implementation of Hashmap.
String immutability, string interning, and string matching concepts in Java.
โ๏ธ Discussion on some practical problems like Adhaar card and Passport Sewa requiring to override hashcode(), hasnext(), and next() build-in Java functions.
โ๏ธ Given an array, print all the pairs with the given sum. (2-3 approaches)
๐๐ ๐๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ
โ๏ธ A thorough discussion on OS topics like memory management, process synchronization, thread synchronization, deadlocks, segmentation, paging techniques, scheduling algorithms, etc.
๐๐๐๐ ๐๐ฎ๐๐ฌ๐ญ๐ข๐จ๐ง๐ฌ
โ๏ธ Several DBMS questions like various keys in DBMS, 1-2 SQL queries, normalization, etc.
The interviewers required proper (C++/Java) code, dry run, and stack trace.
All the best! โค๏ธ
P.S. - That's me attending Adobe's Diwali Mela ๐
-------------
Book a 1:1 mentorship session with me -ย https://lnkd.in/dBat2pfB
Twitter -ย https://lnkd.in/deHrAPcF
Instagram -ย https://lnkd.in/dFmiPh4G
#adobeย #interviewexperienceย #interviewquestionsย #linkedincreators
