i
Geeks
Invention
Filter interviews by
I applied via LinkedIn and was interviewed before Dec 2022. There were 3 interview rounds.
Given a string, find the length of the longest substring without repeating characters.
I applied via LinkedIn and was interviewed before Dec 2022. There were 3 interview rounds.
Given a set of items, each with a weight and a value, determine the maximum value you can obtain by selecting items without exceeding a given weight limit.
I applied via LinkedIn and was interviewed before Dec 2022. There were 3 interview rounds.
Given a set of item, each with a weight and a value, determine the maximum value you can obtain by selecting items without exceeding a given weight limit.
I applied via LinkedIn and was interviewed before Dec 2022. There were 3 interview rounds.
Given two strings, S and T, find the minimum window in S which will contain all the characters in T.
I applied via LinkedIn and was interviewed before Dec 2022. There were 3 interview rounds.
Coding test Runs for maximum 1 hours , problems from platforms like Leetcode, HackerRank or CodeSignal were asked.
Top trending discussions
I applied via Campus Placement
I appeared for an interview in Nov 2016.
Seeking better growth opportunities and challenges
Limited growth potential in current role
Desire to work on more challenging projects
Looking for a company with a better cultural fit
Relocating to a new area
I applied via Recruitment Consultant and was interviewed before Feb 2020. There were 3 interview rounds.
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if needed.
Bubble Sort has a time complexity of O(n^2) in the worst and average cases.
It can be optimized by adding a flag to check if any swaps were made during a pass.
If no swaps occur, the array is already sorted, and we can terminate early.
Example of optimized Bubble Sort: If the array is [5, ...
I applied via Campus Placement and was interviewed before Jun 2019. There were 4 interview rounds.
A string palindrome is a sequence that reads the same backward as forward, like 'racecar' or 'level'.
A palindrome can be checked by comparing characters from both ends towards the center.
Example: 'madam' is a palindrome because 'm' == 'm', 'a' == 'a'.
Ignoring spaces and punctuation: 'A man, a plan, a canal, Panama!' is a palindrome.
Case sensitivity can be ignored: 'No 'x' in Nixon' is a palindrome.
Swapping of numbers can be done using call by value, address and reference.
Call by value: Pass the values of variables as arguments to the function. Swap the values inside the function.
Call by address: Pass the addresses of variables as arguments to the function. Swap the values using pointers inside the function.
Call by reference: Pass the references of variables as arguments to the function. Swap the values using ref...
Reverse a given string
Use a loop to iterate through the string and append each character to a new string in reverse order
Alternatively, use built-in string functions like reverse() or slice()
Remember to handle edge cases like empty strings or strings with only one character
A multi-threading program to print 1 2 1 2 using 2 threads.
Create two threads and pass a flag to each thread to print either 1 or 2.
Use a synchronization mechanism like mutex or semaphore to ensure alternate printing.
Join the threads to wait for their completion.
Code for binary search algorithm
Binary search is a divide and conquer algorithm
It works by repeatedly dividing the search interval in half
If the value is found, return the index. Else, repeat on the appropriate half
The array must be sorted beforehand
I appeared for an interview before Jan 2021.
Round duration - 120 Minutes
Round difficulty - Medium
The test included MCQ questions from SQL, Linux Commands, C/C++ programming, Logical Reasoning, Aptitude questions. The other section was the coding round, where 2 SQL queries and 2 coding questions were there.
You are provided with an array/list ARR
of length N
containing only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe...
Count the number of subarrays where the number of 0s is equal to the number of 1s in a given array of 0s and 1s.
Iterate through the array and keep track of the count of 0s and 1s encountered so far.
Use a hashmap to store the count of 0s and 1s encountered at each index.
For each index, check if the count of 0s is equal to the count of 1s encountered so far and update the result accordingly.
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible triplets of numbers 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 for each trip...
Round duration - 50 Minutes
Round difficulty - Medium
This was a standard DSA round where I was asked to solve 2 questions and also code it in a production ready manner . At the end I was also asked some questions related to Linux and SQL . I was tested on some basic commands of Linux .
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome.
Store distinct palindromic substrings in alphabetical order.
Given two integers a
and b
, your task is to swap these numbers and output the swapped values.
The first line contains a single integer 't', representing the num...
Swap two integers 'a' and 'b' and output the swapped values.
Create a temporary variable to store one of the integers before swapping.
Swap the values of 'a' and 'b' using the temporary variable.
Output the swapped values of 'a' and 'b'.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally adding redundancy to improve query performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.
Denormalization involves combining tables or adding redundant data to...
Round duration - 60 Minutes
Round difficulty - Medium
This was a DS/Algo + Core round where I was asked questions related to DBMS , SQL queries and Linux Commands . The first question was of DSA and I was able to code it preety fast . I was also asked to execute some SQL queries on my laptop.
Overall , this round went good according to my opinion.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Check if two strings are anagrams of each other by comparing their sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the frequency of characters in each string and compare the dictionaries.
Ensure both strings have the same length before proceeding with comparison.
Handle edge cases like empty strings or strings with different lengths.
Use SQL query with GROUP BY and HAVING clause to delete duplicate emails from a database.
Use GROUP BY clause to group emails together
Use HAVING clause to filter out groups with more than one email
Use DELETE statement to remove duplicate emails
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers ON DELETE triggers, while TRUNCATE does not trigger any triggers.
DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.
Example: DELETE FRO...
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions .
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Some of the top questions asked at the Geeks Invention Software Developer interview -
The duration of Geeks Invention Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 6 interview experiences
Difficulty level
Duration
based on 6 reviews
Rating in categories
Software Developer
4
salaries
| ₹20 L/yr - ₹35 L/yr |
Amdocs
Yalamanchili Software Exports
OnProcess Technology
ScoreMe Solutions