AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
ChicKing Software Developer Interview Questions and Answers
ChicKing Software Developer Interview Experiences
1 interview found
chiggs jain
I applied via LinkedIn and was interviewed in Oct 2023. There were 2 interview rounds.
(1 Question)
- Q1. How it was good and better to way to act for dashboard
- Ans.
A good way to design a dashboard is to prioritize user experience, display relevant data, use visualizations effectively, and ensure responsiveness.
Prioritize user experience by organizing information logically and providing easy navigation.
Display relevant data by focusing on key metrics and avoiding clutter.
Use visualizations effectively to make data easy to understand at a glance.
Ensure responsiveness by designing f...
How would you deal with something if it occurs
Interview questions from similar companies
Anonymous
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1.
Rotate Matrix Right K Times
You are given a matrix
MATof size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma... - Ans.
Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.
Iterate 'K' times to perform right rotation on the matrix
Shift each column to the right by one position in each rotation
Handle wrapping around the matrix when shifting columns
Return the matrix elements row-wise after 'K' rotations
- Q2.
Word Search Problem Statement
Given a two-dimensional grid of size
N x Mconsisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.The 'WORD' can b...
- Ans.
Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.
Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use recursion to explore all possible paths from a starting cell to form the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of how man
(3 Questions)
Round duration - 75 minutes
Round difficulty - Medium
Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.
- Q1.
Problem Statement: Largest Island
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
- Ans.
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the
- Q2.
Pythagorean Triplet Problem
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Expl...
- Ans.
Check if there exists a Pythagorean triplet in a given array of integers.
Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number.
- Q3.
Top View of Binary Tree Problem Statement
Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...
- Ans.
Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.
Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.
Return the values of the topmost nodes in the map as the top view of the Binary Tree.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.
- Q1.
Fixing a Swapped Binary Search Tree
Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.
Input:
The first... - Ans.
Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.
Identify the two nodes that are swapped by mistake in the BST.
Swap the values of the two identified nodes to restore the BST.
Perform an in-order traversal of the BST to verify the correct restoration.
Ensure no extra space other than the recursion stack is used for the solution.
- Q2.
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named
Stackwhich supports the following operations, each in O(1... - Ans.
Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.
Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure that each operation runs in constant time O(1).
Handle edge cases like empty stack appropriately.
Test the implementation with sample queri
Interview Preparation Tips
Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.
Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
Coding question of medium level difficulty, from DP.
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.
- Q1.
Minimum Cost to Destination
You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...
- Ans.
Find the minimum cost to reach a destination in a matrix with blocked cells.
Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.
Keep track of the cost incurred at each cell and update it as you move through the matrix.
Return the minimum cost to reach the destination or -1 if it is unreachable.
(2 Questions)
Round duration - 30 minutes
Round difficulty - Medium
It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.
- Q1.
Triangle Formation Using Array Elements
Given an integer array/list
ARRof length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o... - Ans.
Determine if it is possible to form a non-degenerate triangle using array elements as sides.
Check if the sum of any two sides is greater than the third side for all combinations of sides.
If the above condition is met for any combination, return true; otherwise, return false.
- Q2.
Maximum Sum of Non-Adjacent Elements
You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...
- Ans.
Find the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.
Iterate through the array and update the maximum sum accordingly.
Example: F...
(2 Questions)
Round duration - 45 minutes
Round difficulty - Easy
It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.
- Q1.
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...
- Ans.
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.
Traverse the tree in a bottom-up manner, starting from the leaf nodes.
For each node, update its value to the sum of its children's values.
Set leaf nodes to 0.
Return the preorder traversal of the modified tree.
- Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
- Ans.
Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.
Types of indexes: B-tree, Hash, Bitmap, etc.
Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.
Factors affecting index performance: Selectivity, clustering factor, index fragmentation.
Examples: Creating an index on a column in a table to speed up search queries
Interview Preparation Tips
Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances
Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page
Skills evaluated in this interview
I appeared for an interview before May 2021.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Easy
- Q1.
Position of Right Most Set Bit
Determine the position of the rightmost set bit in the binary representation of a given number N.
Input:
T: Number of test cases
N: An integer for which the position of the... - Ans.
Find the position of the rightmost set bit in a given number's binary representation.
Convert the number to binary representation.
Find the position of the rightmost set bit by counting from right to left.
Return the position of the rightmost set bit.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Water Jug Problem Statement
You have two water jugs with capacities
XandYliters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to... - Ans.
The Water Jug Problem involves determining if a specific amount of water can be measured using two jugs of different capacities.
Start by considering the constraints and limitations of the problem.
Think about how the operations allowed can be used to reach the target measurement.
Consider different scenarios and test cases to understand the problem better.
Implement a function that can determine if the target measurement
Round duration - 60 Minutes
Round difficulty - Medium
Interview Preparation Tips
Tip 1 : Make your DSA and Algorithm as much as strong as possible.Main focus should be on Graphs and Trees.
Tip 2 : There are many standard algorithm on which questions are frequently asked.Try to practice as much as you can on them.
Tip 3 : Your project should be unique to create unforgettable impression.
Tip 1 : Add 2-3 best of your projects which shows something extraordinary.
Tip 2 : Add your achievements if you have any like getting top rank in a coding competition.
Skills evaluated in this interview
Selected
I applied via LinkedIn and was interviewed before Aug 2022. There were 3 interview rounds.
(1 Question)
- Q1. Operating system questions
Linked list standard questions
3 coding questions and platform was hackerrank
(1 Question)
- Q1. Some medium Graph problems from leetcode
Ashutosh Gupta
Selected
3 coding questions and platform was hackerrank
(1 Question)
- Q1. Two medium graph questions from leetcode
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
DSA , medium n easy leetcode question was there
(2 Questions)
- Q1. Low level design
- Q2. DSA and computer fundamental
Anuj Gupta
(1 Question)
- Q1. Merge sort algorithm and divide array in the chunks
- Ans.
Merge sort is a sorting algorithm that divides an array into smaller chunks and then merges them in sorted order.
Merge sort is a divide-and-conquer algorithm.
It recursively divides the array into two halves until each subarray has only one element.
Then it merges the subarrays in sorted order.
The merge step compares elements from both subarrays and places them in the correct order.
It has a time complexity of O(n log n).
Skills evaluated in this interview
Sai Vignan
Selected
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
Coding Questions and SQL
(1 Question)
- Q1. Topics : Trees and LinkedList
(1 Question)
- Q1. Trees, LinkedList and SQL queries
ChicKing Interview FAQs
Tell us how to improve this page.
ChicKing Interviews By Designations
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
ChicKing Software Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Restaurant Manager
11
salaries
|  ₹2.3 L/yr - ₹4.8 L/yr |
|
HR Executive
9
salaries
| ₹1.5 L/yr - ₹2.2 L/yr |
|
Accountant
7
salaries
| ₹1.4 L/yr - ₹2.4 L/yr |
|
Shift Manager
5
salaries
| ₹1.6 L/yr - ₹2.2 L/yr |
|
Cashier
5
salaries
| ₹1.2 L/yr - ₹3 L/yr |
Oyo Rooms
Mahindra Holidays & Resorts
Cafe Coffee Day
Oberoi Group of Hotels
- Home >
- Interviews >
- ChicKing Interview Questions >
- ChicKing Software Developer Interview Questions
