Add office photos
Filter interviews by
Goldcast SDE-2 Interview Questions and Answers for Freshers
Goldcast SDE-2 Interview Experiences for Freshers
1 interview found
I applied via Job Fair and was interviewed in Apr 2024. There were 2 interview rounds.
(1 Question)
- Q1. The interview was friendly and started the conversation with a project discussion after half an hour he asked one coding question , I got call from recruiter after 15 min of first round. second round sche...
(1 Question)
- Q1. NA NA NA NA
Interview Preparation Tips
Interview questions from similar companies
CodingNinjas
I was interviewed in Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Started with brief intro(5 mins) about interviewer.
Problem solving question, question was already there in the codelink shared by the interviewer. He explained the problem again with sample testcase.
The Interviewer was friendly.
- Q1. Course Schedule II
You have been given ‘N’ courses and some courses may have prerequisites. Now consider a matrix ‘PREREQUISITES’ of size 'M' x 2 which represents that you must complete course '...
- Ans. Breadth-First Search
Our current algorithm is based on the idea of the BFS approach. We first process all the courses with 0 in-degree implying no prerequisite courses required. If we remove all these courses from the graph, along with their outgoing edges, we can find out the courses/nodes that should be processed next. These would again be the nodes with 0 in-degree. We can continuously do this until all the courses h...
- Q2. System Design
System design a live video broadcast platform.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
There were 2 interviewers(India HM and Seattle HM), India HM was just shadowing and didn't ask any questions. Started with intro, he asked in detail about what I do at current company(10 mins). Again, jumped into LP's(25 mins).
- Q1. Distance between two nodes of a Tree
Given a binary tree and the value of two nodes, find the distance between the given two nodes of the Binary Tree.
Distance between two nodes is defined as the minimum...
- Ans. Naive Approach
In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...
- Q2. Median in a stream
Given that integers are read from a data stream. Your task is to find the median of the elements read so far.
Median is the middle value in an ordered integer list. If the size of the ...
- Ans. Brute force approach
Store the incoming data elements in a vector. Sort the vector everytime you need to output the median.
Algorithm:
- Store the incoming elements of the data stream in a vector.
- Step by step insert one element and sort the vector as soon as any element is added in the vector.
- If the size of the vector is odd, print the middle element of the sorted vector.
If the size of the vector is even, return the mean of...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
There was only 1 interviewer in this round and We had no video sharing in this round so it was becoming difficult to understand each other.
- Q1. Object Oriented Design Question
Started with brief intro about both(5 mins), then he jumped into LP's(25 mins). This was very difficult since there was no video and he was grilling me real hard on this, so...
Interview Preparation Tips
Tip 1 : Bookmark the GFG Amazon Archives. It helped me a lot during my preparations. Reading other’s interview experiences is one of the best ways to get yourselves ready for the next job interview. Practice daily atleast 5 questions.
Tip 2 : Most commonly asked topics in Amazon Interviews ( as per the mail I received from my recruiter ) :
BFS/DFS/Flood fill, Binary Search, Tree traversals, Hash tables, Linked list, stacks, queues, two pointers/sliding window
Binary heaps, Ad hoc/string manipulations.
Tip 3 : Highly recommended sites for practicing questions ( usually practice medium and hard level questions) :
Leetcode (highly encouraged)
Geeksforgeeks (highly encouraged)
CodeZen( highly encouraged)
Codeforces
Tip 4 : This is a great bigocheatsheet that could be of great help https://www.bigocheatsheet.com/
Tip 1 : Mention past working experience in detail as how you were important to your previous company.
Tip 2 : Try to keep your resume to 1 page if work experience < 5 years
Tip 3 : Update your resume according to role you are applying for and never put false things on resume.
Skills evaluated in this interview
I was interviewed in Dec 2020.
(1 Question)
Round duration - 30 minutes
Round difficulty - Medium
It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL
- Q1. Minimum Operations
You are given an array 'ARR' of 'N' positive integers. You need to find the minimum number of operations needed to make all elements of the array equal. You can perform a...
- Ans. Brute Force
For making all elements equal you can select a target value and then you can make all elements equal to that. Now, for converting a single element to a target value you can perform a single operation only once. In this manner, you can achieve your task in the maximum of ‘N’ operations but you have to minimize this number of operations and for this, your selection of target is very important because if ...
(1 Question)
Round duration - 15 minutes
Round difficulty - Easy
It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.
- Q1. Basic HR Questions
Who is your role model?
Why should we hire you?
- Ans.
Tip 1 : This question aims to evaluate the candidate’s interest in the role. Are they really motivated to get hired for this specific job or do they just mass-apply to every job ad under the sun? Candidates should show that this application was a conscious decision on their part.
Tip 2 : With this question, recruiters can assess whether candidates have truly understood the role’s requirements and whether they think they...
Interview Preparation Tips
Tip 1 : Practice as much as you can
Tip 2 : Try to get a good hold in Data Structures
Tip 3 : Do atleast 2 projects
Tip 1 : It should not be too long or too short.
Tip 2 : Each skill should be mentioned properly.
I was interviewed before May 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It is online round and it was conducted around 11 AM on campus. Difficulty was medium. 2 coding questions were asked. One question is based on arrays(easy) and the other question is based on usage of oops concepts like Inheritance, polymorphism. Everything went smooth.
- Q1. Subarray With Given Sum
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subar...
- Ans.
I started with brute force method but test cases were failed due to time complexity. Use a similar approach to a sliding window. Start with an empty subarray, add elements to the subarray until the sum is less than x. If the sum is greater than x, remove elements from the start of the current subarray
- Q2. OOPS Question
Only java was allowed. Parent class was given and asked to write code for child classes and function overloading.
- Ans.
Be clear with oops concepts. If oops concepts are clear then the question can be solved easily.
(4 Questions)
Round duration - 50 minutes
Round difficulty - Medium
Round started with self introduction and discussion of project. Everything went fine.
Note: we didn't have hr round due to time constraint. You can expect hr round.
- Q1. Find Duplicate
You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ...
- Ans.
Step 1: create an array of fixed size 256 as 256 ascii characters are available. Initialise all the elements of array with 0.
Step 2: iterate over array and store the frequency of every character.
Step 3: Iterate over the array and print the characters with frequency more than 1.
Note: problem can be solved using maps too. - Q2. DBMS Questions
Explain the concept of normalisation and types.
- Ans.
Tip 1 : Explain everything clearly.
Tip 2 : Don't use the words that you are not confident about. Interviewer might ask questions based on your answers. - Q3. DBMS Question
Explain ACID properties
- Ans.
Tip 1 : Go through DBMS concepts thoroughly.
- Q4. OOPS Question
Explain oops concepts with real life examples.
- Ans.
Tip 1 : Go through oops concepts thoroughly
Interview Preparation Tips
Tip 1 : Don't get frustrated if not selected, keep believing yourself.
Tip 2 : Prepare data structures and algorithms well. Practice coding daily. OOPS in any programming language will do. Prefer quality of codes to quantity.
Tip 3 : If possible do a project on full stack development.
Tip 1 : Keep it simple and try to adjust everything in one page. As a fresher it is better if you can have 2 projects in your cv.
Tip 2 : Don't add unnecessary details such as parents details.
Skills evaluated in this interview
AKANKSHA JAISWAL
I applied via Campus Placement
Apt and coding test was in first
2 coding questions was ask
(2 Questions)
- Q1. It was on your resume question
- Q2. Hr questions was asked in interview
SDE (Software Development Engineer) Interview Questions & Answers
Jio
Anonymous
posted on 25 Jul 2022
I applied via Company Website and was interviewed in Jun 2022. There were 4 interview rounds.
90 Mins on amcat global platform, 2 Easy level questions on Array and two pointers
(2 Questions)
- Q1. Print all the Elements not present in a sorted array and tell the time and space complexity of the algorithm.
- Ans.
Print all elements not present in a sorted array with time and space complexity.
Iterate through array and print missing elements
Use binary search for faster search
Time complexity: O(n log n)
Space complexity: O(1)
- Q2. Print all the elements not present in an unsorted array and tell the time and space complexity of the algorithm.
- Ans.
Print all elements not present in an unsorted array and give time and space complexity.
Iterate through array and use a hashset to keep track of seen elements.
Print elements not in hashset.
Time complexity: O(n), Space complexity: O(n)
(2 Questions)
- Q1. Tell me about yourself, your college , family, hobbies and projects
- Q2. Why do you want to join this company?
Interview Preparation Tips
- Arrays
- Linked List
- Two pointers
Skills evaluated in this interview
I applied via Internshala and was interviewed in Dec 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. I just filling this because I never had job here for now because I am undergrad student and this website is asking for my review so sorry for disappoint you..
Interview Preparation Tips
SDE (Software Development Engineer) Interview Questions & Answers
Wipro
060 Ravi Nayak
posted on 25 Sep 2021
I applied via Campus Placement
Interview Questionnaire
2 Questions
- Q1. The basic question of SQL
- Q2. Question from a project that mentioned in the resume
Interview Preparation Tips
Working as good
(1 Question)
- Q1. Core java and selenium
Interview Preparation Tips
SDE (Software Development Engineer) Interview Questions & Answers
Capgemini
Anonymous
posted on 25 Feb 2022
NA
(1 Question)
- Q1. Questions based on resume
Interview Preparation Tips
Goldcast Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
SDE-2 Interview Questions from Similar Companies
|
Customer Success Manager
5
salaries
|  ₹16 L/yr - ₹23 L/yr |
|
QA Engineer
4
salaries
| ₹15 L/yr - ₹16.5 L/yr |
|
Senior QA Engineer
4
salaries
| ₹15 L/yr - ₹15 L/yr |
|
Senior Brand Designer
4
salaries
| ₹20 L/yr - ₹23 L/yr |
Disney+ Hotstar
SonyLIV
ZEE5
ALTBalaji
Calculate your in-hand salary
- Home >
- Interviews >
- Goldcast Interview Questions >
- Goldcast SDE-2 Interview Questions for Fresher
