Placements

Placementshttps://manasch.github.io/placements/Recent content on PlacementsHugo -- gohugo.ioenFri, 29 Sep 2023 17:58:06 +0530<link>https://manasch.github.io/placements/code/amadeus/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/amadeus/</guid><description>Amadeus Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 80% XII 80% UG 7.5 GPA Round 1 05/10/23 There were 2 sections and of 31 Questions and 90 min were given. Technical MCQ (29) Coding (2) Coding Questions Number of Sale Days: A shop operates for N days, an array of size N is given where each day the value can either be 1, 0, -1.</description></item><item><title/><link>https://manasch.github.io/placements/code/amazon_hackon/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/amazon_hackon/</guid><description>Amazon HackOn 2023 Details Job Status Hackathon. Winners offered internships/FTE and prize money. Criteria 6.5 CGPA Engineering students 2-4 members per team Prizes Winner - INR 1,00,000 1st runner-up - INR 75,000 2nd runner-up - INR 50,000 Mentorship for the Top 8 teams SWAG for the Top 8 teams The Titan - Top 50 coders - Exciting Prizes The Wonder Woman - Top 5 Female Coders - Exciting Prizes The Trailblazer - Top 5 Fastest Coders - Exciting Prizes The Zen Master - Top 5 Cleanest Coders - Exciting Prizes Round 1 28/09/2023</description></item><item><title/><link>https://manasch.github.io/placements/code/applied_materials/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/applied_materials/</guid><description>Applied Materials Details Job Status Full Time (Employment only) Criteria Study Cutoff X 70% XII 70% UG 7 GPA Round 1 29/08/23 There were no coding questions, just aptitude and analytical, math and technical questions</description></item><item><title/><link>https://manasch.github.io/placements/code/arista/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/arista/</guid><description>Arista Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7.5 GPA Round 1 17/08/23 Coding Questions Distances Between Nodes: Given a list of elements, create a BST out of the list of elements, and every time a new element is added to the BST, find the distance (the number of edges between every pair of nodes in the BST) of every possible pair and print the sum.</description></item><item><title/><link>https://manasch.github.io/placements/code/arm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/arm/</guid><description>ARM Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 70% XII 70% UG 7 GPA Round 1 01/10/23 There were no coding questions. 2 Mandatory sections and an optional section, 75 min Aptitude Technical Digital or Analogue</description></item><item><title/><link>https://manasch.github.io/placements/code/att/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/att/</guid><description>AT&T Details Job Status Internship + Performance Based Conversion Criteria Study Cutoff X 80% XII 80% UG 7.5 GPA 8.5+ GPA were selected Round 1 16/11/23 There were 3 sections: Technical MCQ (35) - 35 Min - 35 Marks Aptitude MCQ (10) - 10 Min - 10 Marks Coding (5) - 45 Min - 50 Marks Coding Questions Binary Search: Find the target element in a sorted array. Return -1 if not found.</description></item><item><title/><link>https://manasch.github.io/placements/code/aurva/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/aurva/</guid><description>Aurva Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 8 GPA 8 GPA or OpenSource contributor Lunch / Dinner provided at office. Round 1 14/10/23 The test was not on any platform, rather a document was provided and we were asked to code it locally and upload it to google drive and share them the link. Coding Questions Parking Slots: A parking lot has a number of parking slots.</description></item><item><title/><link>https://manasch.github.io/placements/code/baxter/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/baxter/</guid><description>Baxter Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7 GPA Round 1 25/08/23 There were multiple sections, aptitude, analytical, technical, electrical but no coding.</description></item><item><title/><link>https://manasch.github.io/placements/code/blue_yonder/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/blue_yonder/</guid><description>Blue Yonder Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 70% XII 70% UG 7 GPA Round 1 30/10/23 There were 4 sections in total, 90 min. Aptitude (20) - 20 min English (10) - 10 min Technical (15) - 20 min Coding (2) - 40 min Coding Questions Flip Array: Given a 2-d matrix, filled with either ‘R’ for Red or ‘B’ for Black, given a set of coordinates, flip the colour at the location.</description></item><item><title/><link>https://manasch.github.io/placements/code/british_telecom/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/british_telecom/</guid><description>British Telecom Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 - Coding Round 19/09/23 A total of 13 questions. Time - 120 min. MCQ (10) - Technical - (KMP and N-Queens TC was asked) Coding (3) - 1 SQL Coding Questions Maximum Friendship Power: There are N Cities and M Bi-Directional Roads. An array A of size N consists of the number of people in each group (there are N groups).</description></item><item><title/><link>https://manasch.github.io/placements/code/broadridge/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/broadridge/</guid><description>Broadridge Details Job Status Full Time (Employment + Internship Mandatory) - Member Technical Criteria Study Cutoff X % XII % UG 7 GPA Round 1 15/09/23 There were 6 sections, no coding. Test was for 65 min, not timed section-wise Cognitive Ability (27) Data Structures (4) Database Concepts (3) Networking (6) OOPS Concepts (4) Operating System (3)</description></item><item><title/><link>https://manasch.github.io/placements/code/cisco/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/cisco/</guid><description>Cisco Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 - Coding Round 29/08/23 A total of 41 questions were asked with 40 of them being MCQ’s based on C, Cpp, Java, Aptitude. 1 Coding question Coding Questions Snakes and Ladders Leetcode GFG Round 2 - Interview Technical based questions. Resume based projects discussion. Real world usage of data structures and algos.</description></item><item><title/><link>https://manasch.github.io/placements/code/cloudera/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/cloudera/</guid><description>Cloudera Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 8% XII 8% UG 8 GPA Cutoff was increased after initial registration. Round 1 21/08/23 3 Questions: SQL (1) Coding (2) Coding Questions Find the 2nd largest value: Write an SQL statement to print the second largest value from a column, if it doesn’t exist, then print null. SELECT DISTINCT PRICE FROM PRODUCTS ORDER BY PRICE DESC LIMIT 1, 1; Should have worked but didn’t.</description></item><item><title/><link>https://manasch.github.io/placements/code/commvault/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/commvault/</guid><description>Commvault Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 75% XII 75% UG 80% Round 1 - Coding Round 01/08/23 Two job roles were offered, QA and SDE, QA only had python as an option and SDE had an option between JAVA and CPP, I chose CPP. There were 2 sections timed separately. CPP Fundamentals and Generics MCQ (13) Coding (3) Coding Questions Reverse alternate K nodes in a Singly Linked List A function to reverse a linked list given head and apply this every other m nodes.</description></item><item><title/><link>https://manasch.github.io/placements/code/confluent/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/confluent/</guid><description>Confluent Details Job Status Internship + PPO Criteria Study Cutoff X % XII % UG GPA There were 3 Roles Data Infrastructure Intern Business Intelligence Intern Project Management Intern Round 1 09/10/23 Data Infrastructure Intern There were 3 coding questions to be solved in 75 min. Coding Questions Min Cost: Will update when I remember. Max Price: Given a tree which has nodes from 1-n which refer to the version of some product.</description></item><item><title/><link>https://manasch.github.io/placements/code/cred/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/cred/</guid><description>CRED Details Job Status Full Time (Employment + Internship) Criteria This was off-campus Round 1 18/11/23 There were 3 coding questions to be done in 90 min. Coding Questions Unique String: The input is a string consisting of lower case english alphabets. For any character that occurs more than once, it can be deleted. Given a string, delete the characters that occur more than once such that the resultant string consists of all the unique characters from the original string as well as is the lexicographically largest one.</description></item><item><title/><link>https://manasch.github.io/placements/code/cynlr/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/cynlr/</guid><description>CynLr Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 27/08/23 There were 5 sections and we had 3 hours. Practical Physics (4) Phsyics MCQ’s Aptitude Coding (1) Behavioural Coding Questions Number of triangles: Given a 2d matrix of 1’s and 0’s, find the total number of equilateral and isosceles triangles that can be formed taking any of the 1’s to be the vertices.</description></item><item><title/><link>https://manasch.github.io/placements/code/deloitte/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/deloitte/</guid><description>Deloitte Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 6.5 GPA Round 1 03/09/23 There were 4 sections: English Comprehension Aptitude Technical Coding (2) Coding Questions Matching Last Character: Given a list of words and a character to match, print the sorted position (1-index) of the word with the other words if the last letter of the word matches with the character to match.</description></item><item><title/><link>https://manasch.github.io/placements/code/deshaw/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/deshaw/</guid><description>DE Shaw Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7 GPA Round 1 19/11/23 There were 4 sections: Coding (20 min) Coding (30 min) Aptitude Technical Totally around 95 min. Coding Questions Min-Max Difference: Given a string of characters (only smaller case), find out the number of minimum number of characters to remove such that the difference between the max frequency of chars and the min frequency of chars is m which is given.</description></item><item><title/><link>https://manasch.github.io/placements/code/deutsche/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/deutsche/</guid><description>Deutsche Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7 GPA / 70% Round 1 11/08/23 There was only one coding section with 3 questions Coding Questions Minimum length of positive sum subarray: Given an array with both negative and positive integers, for each index, find the minimum length subarray such that the sum of all elements in that subarray is positive.</description></item><item><title/><link>https://manasch.github.io/placements/code/dish/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/dish/</guid><description>Dish Networks Technology Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7.5 GPA Round 1 30/08/23 No coding, just multiple sections of technical, aptitude, analytical.</description></item><item><title/><link>https://manasch.github.io/placements/code/egnyte/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/egnyte/</guid><description>Egnyte Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7.5 GPA Round 1 19/08/23 There was only one coding section with 2 questions, everyone had a combination of 2 from a pool of questions. Coding Questions Sum of total waiting time: REMOVED Examples: 1. 2. 3. 4. Create a queue, push all tasks to it, have a counter that is always increasing.</description></item><item><title/><link>https://manasch.github.io/placements/code/eli_lilly/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/eli_lilly/</guid><description>Eli Lilly Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 14/09/23 There were totally 4 sections and it was 2 hours. The sections were not times, could allocate how much ever time required for any section. Reasoning (24) Programming (8) - Basically all were SQL Quantitative (23) Coding (3) - Everyone got different questions. Coding Questions War Ships: Given two inputs, layers and modulus.</description></item><item><title/><link>https://manasch.github.io/placements/code/endor_labs/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/endor_labs/</guid><description>Endor Labs Details Job Status Internship Only (With possible conversion based on performance) Criteria Study Cutoff X % XII % UG 8 GPA Round 1 04/11/23 Coding Questions Log Files: A bank has transaction logs in the form of “sender_user_id receiver_user_id amount”. Given multiple such logs in an array and a threshold value of transactions, return a list of the user_id’s whose total transaction count is greater than the threshold in ascending order.</description></item><item><title/><link>https://manasch.github.io/placements/code/hiver/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/hiver/</guid><description>Hiver Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 80% XII 80% UG 8 GPA Round 1 07/10/23 There were only 7 questions, 5 MCQ and 2 Coding, in 1h15m Coding Questions Next Smallest Palindrome: Given a number as an array, find the next smallest palindrome. vector<int> solve(vector<int> num) { bool isPalin = false; int n = num.size(); auto helper = [&] () { int l = 0; int r = n - 1; int t, oldr, p; while (l < r) { oldr = num[r]; num[r] = num[l]; if (oldr > num[l]) { t = r - 1; while (t > 0) { p = num[t]; ++p; if (p < 10) { num[t] = p; break; } else { num[t] = 0; } --t; } --l; ++r; } ++l; --r; } if (l >= r) { isPalin = true; } }; while (!</description></item><item><title/><link>https://manasch.github.io/placements/code/hpe/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/hpe/</guid><description>HPE Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 80% XII 80% UG 7 GPA Round 1 06/09/23 There were 4 sections: Aptitude (15) - 20 min Technical (33) - 40 min Coding(2) - 30 min (language 1) Coding(2) - 30 min (language 2) The options for languages was - cpp, c, python, java Coding Questions CPP Coding Nuggets Palindrome Number: Given a number, a palindrome can be construced by add the reverse of the number to itself: 12 + 21 = 33.</description></item><item><title/><link>https://manasch.github.io/placements/code/hyperface/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/hyperface/</guid><description>Hyperface Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 8 GPA Round 1 - Coding Round 18/08/23 There was only 1 question and we were given 2 hours. Coding Questions Chef’s Dishes: A chef wants to cook dishes, he gets one new ingredient each day, and this ingredient can be one of 5 types. (Protein, Carb, Fibre, Fat, Seasoning), and each type has an expiry date.</description></item><item><title/><link>https://manasch.github.io/placements/code/ibm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/ibm/</guid><description>IBM Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 10/09/23 There was only one section with 2 coding questions. Everyone got 2 questions from a pool of questions. Coding Questions New Array: Given a list of integers and a list of intervals, for each interval, inverst the sign of the numbers with the interval, At the end return how the list would like like.</description></item><item><title/><link>https://manasch.github.io/placements/code/idfc/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/idfc/</guid><description>IDFC First Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 60% XII 60% UG 6 GPA Round 1 17/11/23 There were 3 sections. Aptitude (15) - 20 min Technical (25) - 25 min (Had MS Excel and Stats too for some reason) Coding (2) - 45 min Coding Questions Distribute Cookies: There are N people sitting in a circle, the people are numbered from 1…N. There’s a ball that player 1 holds and has to pass it on to other players.</description></item><item><title/><link>https://manasch.github.io/placements/code/idfy/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/idfy/</guid><description>IDfy Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 6 GPA Round 1 16/10/23 Coding Questions 3 Coding questions and 1 SQL Coding Preprocess Dates: Given a list of dates in the format 5-Mar-2023 convert it to 2023-03-05. unordered_map<string, string> months = { {"Jan", "01"}, {"Feb", "02"}, {"Mar", "03"}, {"Apr", "04"}, {"May", "05"}, {"Jun", "06"}, {"Jul", "07"}, {"Aug", "08"}, {"Sep", "09"}, {"Oct", "10"}, {"Nov", "11"}, {"Dec", "12"}, }; vector<string> preprocessDate(vector<string> dates) { vector<string> res; for (auto date: dates) { int i = 0; string day = ""; string month = ""; string year = ""; string t = ""; while (date[i] !</description></item><item><title/><link>https://manasch.github.io/placements/code/infibeam/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/infibeam/</guid><description>Infibeam Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 80% XII 80% UG 8GPA There was another cut off, probably 8.5 GPA Round 1 07/10/23 There was only 1 section, 22 questions of which 2 were coding, a total of 1h45m was given to complete the test. Coding Questions Height of a tree: Given a binary tree, find the height of the tree by skipping the nodes that have odd-valued data.</description></item><item><title/><link>https://manasch.github.io/placements/code/intel/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/intel/</guid><description>Intel Details There were two roles available: Data Science: ML and Data Handling 2 open positions Description: Work on automation of Data ETL for retail data Desired skills: Python, DL frameworks (PyTorch/TF), Data Engineering Deep Learning: Continuous Learning 1 open position Description: CL algorithm basket and methodology addressing combination of non-IID data and >100K SKU’s Desired skills: Python, DL frameworks (PyTorch/TF), DL Training experience for Image Job Status 6-month Internship only (1 Jan 24 - 30 Jun 24)</description></item><item><title/><link>https://manasch.github.io/placements/code/intuit/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/intuit/</guid><description>Intuit Details Job status FTE + Internship (mandatory) Criteria Study Cutoff X % XII % UG 8 GPA Round 1 27/07/23 Questions Lost in Woods String parsing basically. Input 12 S_**___*_**D ‘S’ - start ‘D’ - destination * - obstacle _ - path If path exists can walk (W) else if an obstacle exists, can jump(J) over all the obstacles. Output WJWWJJ Efficient Gardner Furious Dhoni N x M matrix and each cell contains a value ranging from -1000 to 1000, both N and M can range from 1 to 1000.</description></item><item><title/><link>https://manasch.github.io/placements/code/juniper_networks/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/juniper_networks/</guid><description>Juniper Networks Details Job Status Internship + PPO Criteria Study Cutoff X % XII % UG 7.5 GPA Round 1 26/10/23 There were 14 questions in total to be solved in 110 min. MCQ (11) - Comprehension, Aptitude, Technical Coding (3) Coding Questions Decorate Function: Write a single decorator for 3 functions, which have variable arguements and one key value arguement delay. There exists a global list execution_time which should include a number close to the delay_time for each query.</description></item><item><title/><link>https://manasch.github.io/placements/code/keysight/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/keysight/</guid><description>KeySight Details Job Status Internship Only With possible conversion based on performance and vacancy Criteria Study Cutoff X 75% XII 75% UG 8 GPA Round 1 07/11/23 40 MCQ’s on Aptitude, Networking and Programming in 60 min.</description></item><item><title/><link>https://manasch.github.io/placements/code/makemytrip/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/makemytrip/</guid><description>MakeMyTrip Details Job Status 6 Months Internship + PPO Criteria Study Cutoff X % XII % UG 7 GPA Round 1 16/09/23 There were 17 Questions to be solved in 1.5 hours MCQ (15) Coding (2) Coding Questions Telephone Lines: There are M houses and N localities, your job as a city planner is to design a plan such that atleast one house exists in a locality. In a locality, all the houses have a telephone line connected to each other (n*(n-1)/2).</description></item><item><title/><link>https://manasch.github.io/placements/code/microchip/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/microchip/</guid><description>Microchip Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 17/10/23 60 MCQ’s based on aptitude, technical and electrical knowledge in 70 min.</description></item><item><title/><link>https://manasch.github.io/placements/code/morgan_stanley/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/morgan_stanley/</guid><description>Morgan Stanley Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 8 GPA Round 1 17/09/23 There were 3 sections and a total of 100 min. Automata Fix (7) - 20min - (A debugging section, debug code such that it passes all test cases.) Quantitative and Logical Aptitude (10) - 20min Coding (3) - 60min Coding Questions Longest Common Prefix: Given an array of names, find the longest common prefix of all the names.</description></item><item><title/><link>https://manasch.github.io/placements/code/natwest/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/natwest/</guid><description>Natwest Group Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 6 GPA Round 1 - Coding Round 29/08/23 There were multiple sections, technical, aptitude, english, analytical. 2 Coding Everyone had different coding questions. Coding Questions Characters in same position: Given a string, find out the number of characters that will be in the same position once the string is reversed. Unique Elements: Given a list of integers, return the unique elements in the order they appear.</description></item><item><title/><link>https://manasch.github.io/placements/code/nvidia/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/nvidia/</guid><description>NVIDIA Details Job Status 6 Month Internship Criteria Study Cutoff X % XII % UG 8 GPA Round 1 20/09/23 3 Sections, 60 min and not timed by section. Analytical (15) Technical (12) Coding (2) Coding Questions Last Stone Weight int lastStoneWeight(vector<int>& stones) { priority_queue<int, vector<int>> q(stones.begin(), stones.end()); int s, t; while (q.size() > 1) { s = q.top(); q.pop(); t = q.top(); q.pop(); if ((s - t) != 0) { q.</description></item><item><title/><link>https://manasch.github.io/placements/code/pure_storage/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/pure_storage/</guid><description>Pure Storage Details Job Status FTE + Internship (Mandatory) Criteria Study Cutoff X % XII % UG 7GPA Round 1 02/08/23 The questions were different for everyone. Two sections MCQ (11) Coding (2) Coding Questions Minimum Operations to Make the Array Alternating This but the input array was just of 0’s and 1’s Python Requests Library Had to use python’s request module to fetch data from an api endpoint and give a summary</description></item><item><title/><link>https://manasch.github.io/placements/code/pwc/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/pwc/</guid><description>PwC Acceleration Centers Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 60%/6 GPA Cyber Security as Major or Elective Round 1: Cyber Recruit Boot Camp 08/08/23 There were 4 sections: Computer Fundamental MCQs (16) Cybersecurity MCQs (16) Coding Question - Easy (1) Coding Question - Novice (1) Coding Questions had a choice of C, Java and Python. Questions were different for everyone.</description></item><item><title/><link>https://manasch.github.io/placements/code/ring_central/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/ring_central/</guid><description>Ring Central Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 90% XII 90% UG 7.5 Round 1 06/08/23 Two sections MCQ (15) Coding (2) MCQ Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Coding Q16 House Robber on Leetcode Q17</description></item><item><title/><link>https://manasch.github.io/placements/code/sahaj/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/sahaj/</guid><description>Sahaj Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 24/08/23 Online test based on fundamentals - CN, OS, DBMS, OOPS. A total of 20 questions. Round 2 - Building in-memory DB for backend server. Problem statement We need a system to be able to manage data for employees. Requests will be accepted over HTTP (API contract). No databases/libraries can be used to store/maintain data.</description></item><item><title/><link>https://manasch.github.io/placements/code/samsung_rnd/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/samsung_rnd/</guid><description>Samsung Research Institute Details Job Status Internship Only Criteria Study Cutoff X % XII % UG 7 GPA Round 1 18/10/23 There were 3 coding questions to be solved in 80 min, everyone got 3 questions from a pool of questions. Coding Questions Christmas Gifts: There are N chocolates and M toys, a gift box can have either X chocolates and Y toys or X toys and Y chocolates. Find the maximum number of gift boxes that can be made.</description></item><item><title/><link>https://manasch.github.io/placements/code/samsung_semiconductor/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/samsung_semiconductor/</guid><description>Samsung Semiconductor India Research Details Job Status Internship Only Criteria Study Cutoff X % XII % UG 7 GPA No Backlogs Round 1 05/10/23 One section with 3 coding questions for 70 min. Coding Questions Alternate Levels: Given the root of a binary tree, return the sum of all the nodes in the alternate levels of a binary tree starting from the root. If the root is null then return 0.</description></item><item><title/><link>https://manasch.github.io/placements/code/sandvine/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/sandvine/</guid><description>Sandvine Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 7.5 GPA Full Time: Training Cost Recovery of Rs.2,00,000 if candidate leaves in one year of time Internship: Training Cost Recovery of Rs. 1,00,000 if candidate leaves in 6 months’ time Round 1 - Coding Round 22/08/23 3 Sections; Aptitude (15) MCQ (27?) Algorithm (3) Coding but no test cases, text box to type the algo or code Coding Questions Elevator: An elevator can go to any of 5 floors up at once, if it goes 5 floors up, then it has to go 3 down, find the minimum number of steps it requires to reach any particular floor.</description></item><item><title/><link>https://manasch.github.io/placements/code/schneider_electric/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/schneider_electric/</guid><description>Schneider Electric Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG GPA Round 1 28/08/23 Online Assessment MCQ’s based on aptitude, analytical, electronics, technical. Round 2 Technical Interview DSA question: How to detect a cycle in a linked list Rate yourself on a scale of 1 - 10 for a given techstack (MERN/MEAN), questions asked accordingly. Database design question Round 3 HR Interview HR Questions Resume Based.</description></item><item><title/><link>https://manasch.github.io/placements/code/societe_generale/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/societe_generale/</guid><description>Societe Generalte Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 60% XII 60% UG 6 GPA Round 1 06/09/23 Coding Questions Number of Pairs: Given a string of characters, find the total number of pairs that can be formed of the same character. Ex: aaaaabb can have 2 pairs of a and 1 pair of b. Min Swap Greatest Even Number: Given a number as a string, find the greatest even number that can be made with just one swap, it is given that atleast one even digit exists.</description></item><item><title/><link>https://manasch.github.io/placements/code/sprinklr/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/sprinklr/</guid><description>Sprinklr Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 6 GPA Round 1 02/09/23 MCQ (72) - Technical, Aptitude Coding (2) Coding Questions Smallest Common Substring: Given two strings, find the number of mappings of the common substrings between the two stirngs. Don’t have to consider subtrings, since they’re asking for smallest, it just becomes the individual characters. Create a charCount for both and multiply and add the count for each character.</description></item><item><title/><link>https://manasch.github.io/placements/code/swym/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/swym/</guid><description>Swym Details Job Status (Internship + Full Time Employment Mandatory) Criteria None mentiond Round 1 09/08/23 First round was conducted in 4 batches for Associate Software Engineer, Customer Experience Engineer was on 10/08/23. Each batch had different questions, some did repeat though. There were 4 sections. Scenario Based Questions (6) Aptitude MCQ Coding (3) Coding Questions Captcha Validity: Given N string, the captcha is valid if for each string, the frequence of each unique character in the string is the same.</description></item><item><title/><link>https://manasch.github.io/placements/code/tesco/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/tesco/</guid><description>Tesco Details Job Status Full Time (Employment only) Criteria Study Cutoff X % XII % UG 8 GPA Round 1 10/08/23 Had 3 sections Aptitude MCQ (25) - 30 min MCQ (10) - 20 min Coding (2) - 40 min Coding Questions Don’t print rows containing -1: Given a square 2D array of integers, don’t print rows that contain -1 Index at which it becomes greater: Given N and P, form a circle of all the primes under N (including) and start from 2 and keep adding values in clockwise manner till the sum becomes greater than P, return the index at which the sum crosses P.</description></item><item><title/><link>https://manasch.github.io/placements/code/thorogood/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/thorogood/</guid><description>Thorogood Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 75% XII 75% UG 7.5 GPA Round 1 16/09/23 3 Sections, no coding Communication Section Aptitude (5) About Thorogood</description></item><item><title/><link>https://manasch.github.io/placements/code/truminds/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/truminds/</guid><description>Truminds Details Job Status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X 80% XII 80% UG 8 GPA 45 People with 9+ were shortlisted Bonus Joining Bonus - 1,00,000 Retention Bonus - 4,00,000 Round 1 - Coding Round 10/09/23 18 MCQs and 1 coding. Questions were different for everyone. Coding Questions String selection: Given N strings where each string is given in the form of an array int of size 26, where the h’th element in the string array denotes the count of #h character of lowercase English alphabets in the string.</description></item><item><title/><link>https://manasch.github.io/placements/code/urban_company/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/urban_company/</guid><description>Urban Company Details Job status Full Time (Employment + Internship Mandatory) Criteria Study Cutoff X % XII % UG 8 GPA OA 31/07/23 Questions Black and White tree: Given a tree with N vertices labeled 1-N rooted at 1. The tree is an undirected graph with N-1 edges. Each edge i connects two vertices ai and bi. Each vertex i is colored either white (0) or black (1). The beauty of a vertex i is the number of paths in its subtree that have end vertices of the opposite color.</description></item><item><title/><link>https://manasch.github.io/placements/code/walmart/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/walmart/</guid><description>Walmart Details Job Status Internship Only Criteria Study Cutoff X % XII % UG 7 GPA Round 1 15/11/23 2 Sections MCQ (Technical) Coding (2) Coding Questions Mode Selection: You are given the scores of n students, a company wants to select students who have scored the mode of the n students. Return the number of students to reject. Example: 4 2 2 3 4 Output: 2 The mode is 2 and hence the other students who did not score 2 are rejected 6 3 4 3 4 5 6 Output: 4 The mode is either 3 or 4, hence you can reject (4 4 5 6) or (3 3 5 6) making it 4 in total.</description></item><item><title/><link>https://manasch.github.io/placements/code/zynga/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://manasch.github.io/placements/code/zynga/</guid><description>Zynga Details Job Status Internship Only Criteria Study Cutoff X % XII % UG GPA Round 1 13/10/23 Coding Questions Longest Increasing Subsequence Decode Ways Polynomial Addition</description></item><item><title>Calendarhttps://manasch.github.io/placements/calendar/Mon, 01 Jan 0001 00:00:00 +0000https://manasch.github.io/placements/calendar/July, 2023 Mon Tue Wed Thu Fri Sat Sun - - - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 - - - - - - August, 2023 Mon Tue Wed Thu Fri Sat Sun - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 - - - September, 2023 Mon Tue Wed Thu Fri Sat Sun - - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 - October, 2023 Mon Tue Wed Thu Fri Sat Sun - - - - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 - - - - - November, 2023 Mon Tue Wed Thu Fri Sat Sun - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 - - - December, 2023 Mon Tue Wed Thu Fri Sat Sun - - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 January, 2024 Mon Tue Wed Thu Fri Sat Sun 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 - - - - February, 2024 Mon Tue Wed Thu Fri Sat Sun - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 - - - March, 2024 Mon Tue Wed Thu Fri Sat Sun - - - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 April, 2024 Mon Tue Wed Thu Fri Sat Sun 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 - - - - - May, 2024 Mon Tue Wed Thu Fri Sat Sun - - 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 - -Schedulehttps://manasch.github.io/placements/schedule/Mon, 01 Jan 0001 00:00:00 +0000https://manasch.github.io/placements/schedule/May, 2024 10-05-2024, Friday Interview Coinswitch - Off Campus: - Process: Offline - Time: 09:00 Add to Google Calendar 07-05-2024, Tuesday Test Coinswitch - Off Campus: - Test Mode: Online - Test Time: Not Mentioned Add to Google Calendar 05-05-2024, Sunday Register Coinswitch - Off Campus: - Tier: Not Mentioned - Offer: FTE - Deadline: 09:00 Add to Google Calendar March, 2024 04-03-2024, Monday Interview ZScaler: - Process: Online - Time: 10:30 Add to Google Calendar February, 2024 03-02-2024, Saturday Test ZScaler: - Test Mode: Online - Test Time: 11:30 Add to Google Calendar January, 2024 24-01-2024, Wednesday Register Nike ITC: - Tier: Not Mentioned - Offer: Internship - Deadline: 11:00 Add to Google Calendar 17-01-2024, Wednesday Register ZScaler: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar 12-01-2024, Friday Test Anko: - Test Mode: Online - Test Time: Not Mentioned Add to Google Calendar 11-01-2024, Thursday Register AB InBev GCC: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: EOD Add to Google Calendar 10-01-2024, Wednesday Register Bizom: - Tier: Not Mentioned - Offer: Internship, PPO - Deadline: EOD Add to Google Calendar 09-01-2024, Tuesday Register Anko: - Tier: Not Mentioned - Offer: Internship - Deadline: 16:00 Add to Google Calendar 06-01-2024, Saturday Test Rakuten India: - Test Mode: Online - Test Time: 10:30 Add to Google Calendar December, 2023 29-12-2023, Friday Register Rakuten India: - Tier: Not Mentioned - Offer: Internship - Deadline: 09:30 Add to Google Calendar 20-12-2023, Wednesday Test Consoilio LLC: - Test Mode: Offline - Test Time: Not Mentioned Add to Google Calendar Interview Consoilio LLC: - Process: Offline - Time: Not Mentioned Add to Google Calendar 18-12-2023, Monday Test CMTI: - Test Mode: Not Mentioned - Test Time: Not Mentioned Add to Google Calendar 15-12-2023, Friday Register Victoria Secrete: - Tier: Not Mentioned - Offer: Internship - Deadline: 10:00 Add to Google Calendar 14-12-2023, Thursday Test Nextuple: - Test Mode: Offline - Test Time: 12:30 Add to Google Calendar Interview Cohesity: - Process: Online - Time: Not Mentioned Add to Google Calendar Nextuple: - Process: Offline - Time: 10:00 Add to Google Calendar 13-12-2023, Wednesday Interview Oracle PDO: - Process: Offline - Time: Not Mentioned Add to Google Calendar 12-12-2023, Tuesday Register Palo Alto: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar Test F5 Innovation: - Test Mode: Offline - Test Time: 10:15 Add to Google Calendar Interview F5 Innovation: - Process: Offline - Time: 13:30 Add to Google Calendar 11-12-2023, Monday Register MediBuddy: - Tier: Not Mentioned - Offer: Internship - Deadline: 10:00 Add to Google Calendar Test Cohesity: - Test Mode: Online - Test Time: 18:00 Add to Google Calendar Netcore Cloud: - Test Mode: Offline - Test Time: 09:30 Add to Google Calendar Interview Netcore Cloud: - Process: Offline - Time: Not Mentioned Add to Google Calendar Target: - Process: Online - Time: Not Mentioned Add to Google Calendar 09-12-2023, Saturday Register Cubic Logics: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar 08-12-2023, Friday Register AtkinsRealis: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: EOD Add to Google Calendar Cohesity: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar Netcore Cloud: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar IQVUA: - Tier: Not Mentioned - Offer: Internship, PPO - Deadline: 09:00 Add to Google Calendar Test Conga: - Test Mode: Online - Test Time: 19:00 Add to Google Calendar Newstreet Tech: - Test Mode: Online - Test Time: 20:00 Add to Google Calendar 07-12-2023, Thursday Register Oracle PDO: - Tier: Not Mentioned - Offer: FTE - Deadline: 09:00 Add to Google Calendar JAR APP: - Tier: Not Mentioned - Offer: FTE, Internship - Deadline: 09:00 Add to Google Calendar Metric: - Tier: Not Mentioned - Offer: Internship - Deadline: 09:00 Add to Google Calendar Test Oracle PDO: - Test Mode: Online - Test Time: 19:00 Add to Google Calendar Interview Akami Technologies: - Process: Offline - Time: Not Mentioned Add to Google Calendar 05-12-2023, Tuesday Register Biocliq AI: - Tier: Not Mentioned - Offer: Internship, PPO - Deadline: EOD Add to Google Calendar Flatworld: - Tier: Not Mentioned - Offer: Internship - Deadline: 09:00 Add to Google Calendar MatreComm Tech.