i
Girikon
Filter interviews by
I applied via Walk-in and was interviewed in Feb 2024. There were 3 interview rounds.
Like question from train, loss and profit, percentage and some computer mcq
I applied via Walk-in and was interviewed in Jan 2024. There were 3 interview rounds.
It was moderately tough
Create a database table for storing student information.
Create a table named 'students' with columns like 'student_id', 'name', 'age', 'grade', etc.
Define appropriate data types for each column (e.g. integer for student_id, varchar for name).
Set 'student_id' as the primary key to uniquely identify each student.
Add sample data to the table using SQL INSERT statements.
Sorting and searching code for array of strings
Use built-in sorting functions like sort() in programming languages like Python or Java
Implement custom sorting algorithms like bubble sort or quicksort if required
For searching, use linear search or binary search depending on the size and order of the array
I applied via Naukri.com and was interviewed in Sep 2023. There were 3 interview rounds.
Girikon interview questions for popular designations
I applied via Job Portal and was interviewed before Feb 2023. There was 1 interview round.
I applied via Walk-in and was interviewed in Aug 2022. There were 5 interview rounds.
It was a normal aptitude test with moderate difficulty.
It was mainly to check your grip on communication and party your accent.
I applied via Naukri.com and was interviewed before Mar 2023. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
Top trending discussions
posted on 31 May 2022
I was interviewed in Sep 2021.
Round duration - 180 min
Round difficulty - Hard
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'ac
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.
T...
Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.
Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.
Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.
Once you find the Kth largest element, return all elements greater than or equal to it in non-de
Round duration - 60 Minutes
Round difficulty - Medium
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).
A Binary Search Tree (BST) is def...
Find the size of the largest BST subtree in a binary tree.
Traverse the tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST found so far.
Recursively check if the current subtree is a BST and update the size accordingly.
Given 'N' 2-dimensional matrices and an array ARR
of length N + 1
, where the first N
integers denote the number of rows in each matrix and the last integer represents t...
Find the minimum number of multiplication operations required to multiply a series of matrices together.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the minimum number of operations needed to multiply matrices.
Iterate through different combinations of matrices to find the optimal solution.
Consider the dimensions of the matrices to determine the number of operations required.
Calcu...
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Li...
Rotate a linked list by K positions in a clockwise direction.
Traverse the linked list to find the length and the last node.
Connect the last node to the head to form a circular linked list.
Find the new head by moving (length - K) steps from the last node.
Break the circular list at the new head to get the rotated linked list.
Round duration - 45 minutes
Round difficulty - Easy
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
Given a string, find the longest palindromic substring within it.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume
Tip 1 : mention some good projects
Tip 2 : don't put false statement
The duration of Girikon interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 6 interviews
Interview experience
Salesforce Developer
154
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Salesforce Developer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
21
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech