Algorithms Interview Questions

I recently went through a lot of interviews. I was very fortunate to get these many opportunities. I would love to share my learnings and experience with you. Grace Hopper...

I recently went through the interview process at **Walmart Global Tech India** for the Software Development Engineer-2 role (it's their entry-level position). The initial stage consisted of an MCQ cha

Hey there, here are steps I went through: 1. I applied it on May, 2023. Completed Assessment on same day. 2. After 5 days, was asked for first round Zoom interview. It was technical questions from 6 d

Round 1 Technical Round 2 Coding question 2.1 Prefix Xor question(https://leetcode.com/problems/find-the-original-array-of-prefix-xor/) 2.2 Question related to map and 2 pointers 3. OS Realted MCQ\'s 4. Questions Related to input and...

Total Rounds - One Online Assessment - Two Technical Interview - Hiring Manger Round Online Assessment: Topics: DSA - 4 Question - 70 Minutes - Q1. Leetcode easy array question. - Q2. Given...

I recently had an online assessment for Netflix. It was hosted on Code Signal. Status: CS masters student with 3+ years of backend development work ex at a startup, Top 50...

Example 1: Input: [1, 0, 0, 1, 0] Output: 0 Explanation: If you answer 0 questions (k = 0) your_result = 0 and your friend_result = -1 (2 correct answers and 3 wrong answers). Example...

<details> <summary> My Solution </summary> ``` public static List<Integer> getMinimumDifference(List<String> a, List<String> b) { // Write your code here List<Integer> result = new ArrayList<>(); for(int i=0;i<a.size();i++){ result.add(countDifference(a.get(i),b.get(i))); } return result; } public...

Status : New grad, B.Tech EEE, Tier 1.5 OR Tier 2 (Depends on site to site). Position : SWE Samsung R&D Bangalore. Location : Bangalore Coding Round 1 (Cocubes Round) Date 15th July...

There were 4 questions and time given was 75 mins and on HackerRank Platform. q1 : Birthday Card collection : Given nums and threshold d. Find the smallest set of numbers...

Here\'s the question below, similar to Magic Numbers. (If this problem is listed in Leetcode problems please do let me know) ## Scrolling Numbers ### Programming challerge description: You have been given...

https://leetcode.com/problems/reaching-points/

Round 1: Online coding and aptitude test on hackerrank. Round 2: There were two interviewers asked me to introduce yourself and directly jumped into DS and algo questions. They asked me five DS...

Job Profile \u2013 Software Engineer Location \u2013 Bangalore The hiring process was as follows \u2013 First Round (Online Coding Round) \u2013 2 hours \uF0B7 4 coding questions on Recursion, BST, Number arithmetic and simple...

Interview Experience: # During the interview, the discussion began with a deep dive into my internship project at Samsung R&D, Bangalore. The interviewer asked about potential single points of failure in...

Microsoft SDE: Round 1: print a 2D matrix m x n in a spiral form. https://leetcode.com/problems/spiral-matrix/ The time complexity of the code. print a 2D matrix m x n in a spiral form excluding diagonal...

Current Status: Undergraduate Student, Bachelor\'s in Computer Science and Engineering. Postion: Software Engineering Intern @ Twitter, San Francisco. Location: San Francisco, California, USA. I came to know about the opening from their careers...

I have applied to Nvidia through on-campus in February 2024. There will be a total of 3 rounds where 1 is the OA round and 2 technical interview rounds. Round 1:...

The question is:- Given an array of size n, where n<=50, divide this array into 2 sub array, such that the difference of their sum is is minimal and should be...

<details> <summary>My Solution</summary> ``` public static int balancedSum(List<Integer> sales) { // Write your code here \t\tint sum =0; for(int i=0;i<list.size();i++){ sum += list.get(i); } int curr =list.get(0); for(int i=1;i<list.size();i++){ if(curr == sum -...

In the month of Januray Sumsung came to our university. Eligibilty: 7.5 CGPA Branchs:- 1. Computer Science 2. IT 3. Electrical Engineering 4. Electronics Engineering 5. Mechanical Engineering Round 1: It was a online round in cocubes platform.There were 3...

I applied through a referral and received the mail for getting shortlisted within 3 days. Total number of rounds = 3. 1. Online Assessment Round (Samsung SWC Advanced Test) 2. Technical Round 3. HR...

Got this question in a phone screen. I could only come up with a O(2n) soln. Was my time complexity + soln correct? I didn\'t get any feedback at the...

Solution 3 def countMoves(numbers): # Write your code here numbers.sort(reverse=True) if len(numbers)==1: return 0 res=0 for i in range(1,len(numbers)): res+=-(numbers[i]-numbers[i-1]) *i return res

PS: Weirdly - noniterative DP solution won\'t work - I guess it\'s because of using a large size array for sum. <details> <summary>My Solution </summary> ``` static boolean isSubsetSum(Integer set[], int n,...