| [ Web Proxy ] |
| Viewing: https://leakcode.dev/topic/algorithms | [Back] [Original] |
497+ real questions from verified interview reports across 12 companies.
Sourced from 1Point3Acres, Blind, Glassdoor, Reddit, and more. Translated and cleaned.
Adobe (4 rounds) F2F-1 You have a grid of size M cross N with negative and positive numbers with row and column wise sorted order (assume increasing order sorting). Find the count...
Twitter Phone Interview - Duration: 1 hr Platform: Hackerrank - codepair 1. Write a collection of data structure that is fast (should run in o(1) time amortized) for each of the follwoing operation...
Round 1: Aptitude TestMy Experience:The first round was an online aptitude test that lasted for about 90 minutes. It was divided into three sections: Quantitative Aptitude...
given an array of n integers,make the array positive with following operation: in 1 opr select any i(0<=i<n) and x(-10e8 <=x<= 10e8) and change arr[i] to x. an array is...
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...
Problem Statement First round was coding round of 3 hours with following question. It was on samsung own software SCS Given- 1). number of test cases each case as- ->size of matrix in rows and...
Given two arrays of equal length A and B. you can apply the following operation on A any number of times: Choose two index i and j with i=/=j and change...
Applied through Referral, Recruiter contacted after 3 weeks to be available for all the interviews on Friday (Hiring Drive) 1st Round (DSA - Positive) - Coin Change - Longest non repeated substring 2n
Problem Statement We have three candies of different taste. A candies of type 1 B candies of type 2 C candies of type 3. We can perform the following operation any number of...
Problem Statement Flow of Numbers Given a seq {a0,a1,a2,......,a n-1} of length n, a good seq is one with below conditions 1. a0 = 0 2. abs(ai-ai+1)<=1 i.e consecutive numbers can...
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...
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 applied through the career section of Morgan Stanley Official Website. There were three rounds: Round 1 (Online Aptitude and Coding test on AMCAT) (90 minutes): There were 3 sections: Aptitude Section:...
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...
Graduation: B.Tech. in IT from IIIT Allahabad Experience: 1 year 8 months Position: Technical Analyst at Goldman Sachs Location: Bengaluru, Karnataka, India Date: January 25, 2023 I recently applied for an MTS-2 role in VMWare...
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...
Status: 1+ yr work experience, Position: MTS-2 at VMWare Location: Bangalore, India Date: Apr 2021 The recruiter reached out to me a couple of days after applying that a team is interested in interviewing...
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...
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...
Similar to https://leetcode.com/problems/text-justification/ Implement a method split(example_text, limit); , where it takes 2 params - example_text and a limit, split the text into a list of strings which can contain atmost(nearest...
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...
Position: MTS-3 at VMware Location: Bengaluru, India Date: March 2022 The interview process and format of each interview: Round 1 (Coding): - Group Anagrams - LIS - DP followed by Recursive solution Round 2 (Coding): -...
I recently appeared for Coinbase Interviews and wanted to share my experience. OA: Leetcode easy/medium questions. I don\'t remeber the questions correctly but they were straightforward with each part building on...
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...
Full question text, interview context, and company-specific frequency data for subscribers.
Get AccessBuilt by Manifold. More dev tools at manifoldhub.com/store →
Real interview questions reported by candidates, aggregated from 10+ sources. Translated, cleaned, and accessible to everyone.
| Web Proxy Viewer | New URL | Original Page |