SDE - 1
Gameskraft
5 rounds | 10 Coding problems
1270 views
Interview preparation journey
Preparation
Duration: 8 months
Topics: Data Structures, Algorithms, DBMS, Operating Systems, OOPS
Tip

Tip 1 : Learn DSA and practice atleast 20 quality questions from each topic by selecting the tag in leetcode.
Tip 2 : Give weekly contests in leetcode to get familiar with time bound problem solving.
Tip 3 : Give mock interviews to gain more confidence.

Application process
Where: Campus
Eligibility: No CGPA criteria. No branch criteria.
Resume tip

Tip 1 : Have atleast 2 decent projects.
Tip 2 : Mention coding profiles if any exist.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date30 Jul 2021
Problems3
Reach the destination

#### Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

view more
Weighted Job Scheduling

#### You are given 'N' jobs with their start time 'Start', end time 'End' and profit 'Profit'. You need to tell the maximum profit you can obtain by performing these jobs such th...

view more
Detect Cycle in a Directed Graph

#### Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least one cycle, else return false.

##### Input Format:
<...
view more
02
Round
Medium
Video Call
Duration60 minutes
Interview date3 Aug 2022
Problems2
Zigzag Binary Tree Traversal

#### Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from ...

view more
Subarray With Given Sum

#### Given an array ARR of N integers and an integer ...

view more
03
Round
Medium
Video Call
Duration60 minutes
Interview date3 Aug 2022
Problems2
Ugly Numbers

#### Ugly numbers are those numbers whose only prime factors are 2, 3, and 5. The first seven ugly numbers are 1, 2, 3, 4, 5, 6, 8, where 1...

view more
Longest Increasing Subsequence

#### For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

view more
04
Round
Medium
Video Call
Duration60 minutes
Interview date3 Aug 2022
Problems2
Technical Questions

What is indexing, advantages and disadvantages of the same. Explain sharding. Mysql vs nosql. Explain deadlocks. How to avoid them.

Problem approach

Tip 1 : learn dbms and operating systems concepts thoroughly.

Inorder Sucessor

#### You have been given an arbitrary binary tree and a node of this tree. You need to find the inorder successor of this node in the tree.

view more
05
Round
Easy
HR Round
Duration20 minutes
Interview date4 Aug 2022
Problems1
Basic HR Questions

What is your best learning. What is your biggest achievement. What are your short term and long term goals. What do you expect from an organisation. What are your strengths. What is your weakness.

Start a Discussion
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
1730 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
56 views
SDE - 1
3 rounds | 9 problems
Interviewed by Samsung
25 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Samsung
13 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57327 views