• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Given a float number convert it into the string WITHOUT using any inbuilt Function

March 25, 2014 by Dhaval Dave

Convert a floating point number to string

Given a float number convert it into the string WITHOUT using any inbuilt Function

Method 1:

class Float2String 
{ 
   public static void main(String[] args) 
   { 
      float f=7.64f; 
      String result; 
      result=""+f; 
      System.out.println(result); 
   } 
}


-by karthik dheeraj

Method 2:

#include<stdio.h>
#include<math.h>
 
// reverses a string 'str' of length 'len'
void reverse(char *str, int len)
{
    int i=0, j=len-1, temp;
    while (i<j)
    {
        temp = str[i];
        str[i] = str[j];
        str[j] = temp;
        i++; j--;
    }
}
 
 // Converts a given integer x to string str[]. 
int intToStr(int x, char str[], int d)
{
    int i = 0;
    while (x)
    {
        str[i++] = (x%10) + '0';
        x = x/10;
    }
 
    while (i < d)
        str[i++] = '0';
 
    reverse(str, i);
    str[i] = '\0';
    return i;
}
 
// Converts a floating point number to string.
void ftoa(float n, char *res, int afterpoint)
{
    int ipart = (int)n;
 
    float fpart = n - (float)ipart;
 
    int i = intToStr(ipart, res, 0);
 
    if (afterpoint != 0)
    {
        res[i] = '.';  // add dot
 
        // Get the value of fraction part upto given no.
        fpart = fpart * pow(10, afterpoint);
 
        intToStr((int)fpart, res + i + 1, afterpoint);
    }
}
 
int main()
{
    char res[20];
    float n = 233.007;
    ftoa(n, res, 4);
    printf("\n\"%s\"\n", res);
    return 0;
}

Similar Articles

Filed Under: Amazon Interview Question, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Generic Object Oriented Stack with Template

Right view of Binary tree

Find the smallest window in a string containing all characters of another string

Maximum sum contiguous subarray of an Array

Leetcode: Edit Distance

Walmart Labs Interview Experience

Code Chef PRGIFT Solution

Check if an array has duplicate numbers in O(n) time and O(1) space

VMWare SDEII Interview

Find two non repeating elements in an array of repeating elements

Length of the longest substring without repeating characters

SAP Hiring Off-Campus General Aptitude

Maximum occurred Smallest integer in n ranges

FizzBuzz Solution C C++

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Common Ancestor in a Binary Tree or Binary Search Tree

Longest Increasing Subsequence

Regular Expression Matching

Amazon Interview Experience – SDE Chennai

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

VMWare Openings

Reliance Jio Software Developer Interview Experience

Doubly linked list

Sort Stack in place

Given a string, find the first character which is non-repetitive

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Singly linked list

Generate largest number arranging a no. of given non negative integer numbers

Find the number ABCD such that when multipled by 4 gives DCBA.

Copyright © 2026 · Genesis Framework · WordPress · Log in