Glynk India Interview Questions and Answers

I'm knowlege of c language

Q1. Aney question of c language
Add your answer
Q2. And data base and etc
Add your answer

Q1. Given a string, find the longest length palindromic substring in the given string.
Add your answer

Q1. Mention the most challenging technical problem you had to solve.
Add your answer
Q2. Some minor low level entity design.
Add your answer

4 question were there i have completed all the problems in given time

Q1. Cab management sysntem
Add your answer

90 min long test, with 4 coding questions on data structures and algorithms, 2 of them being the medium and other medium-hard.

Q1. Distinct subsequences, leetcode problem link: leetcode.com/problems/distinct-subsequences
Ans. 
Count distinct subsequences of a string that match a target string using dynamic programming.
• Use dynamic programming to build a 2D table where dp[i][j] represents the number of distinct subsequences of s[0..i] that equals t[0..j].

• Initialize dp[0][0] = 1, as an empty string is a subsequence of another empty string.

• If t is empty, then dp[i][0] = 1 for all i, since an empty target can be formed from any prefix of s.

• If s i...read more
Answered by AI
Add your answer

4 question (1.5 hrs test) 400 points (100 points for question each)

Q1. Calculate the no.of consecutive zeroes in a binary array
Ans. 
Count consecutive zeroes in a binary array
• Iterate through the binary array and keep track of the maximum consecutive zeroes encountered

• Reset the count of consecutive zeroes when a non-zero element is encountered

• Return the maximum consecutive zeroes found
Answered by AI
Add your answer
Q2. Return k pairs of subsets having sum=num
Ans. 
Return k pairs of subsets with sum=num
• Use a nested loop to iterate through all possible pairs of subsets

• Check if the sum of the subsets equals the target num

• Store the valid pairs in an array and return k pairs
Answered by AI
Add your answer

1.5 hours, 4 coding questions: 1 math, 1 DP, 2 Graphs

Coding test was. good enough with leetfcode medium

Coding test was good enogugh with leetcode medum